艾兹赫尔·戴克斯特拉：修订间差异

艾兹赫尔·戴克斯特拉
Edsger Dijkstra
艾兹赫尔·戴克斯特拉; Edsger Dijkstra
出生	1930年5月11日; 荷蘭鹿特丹
逝世	2002年8月6日（72歲）; 荷蘭尼嫩
公民权	荷蘭
教育程度	萊頓大學（B.S., M.S.）; 阿姆斯特丹大學（Ph.D.）
知名于	戴克斯特拉算法; 结构化编程; THE 操作系统; 信号量（semaphore）
配偶	Maria (Ria) C. Debets
奖项	SIGCSE傑出貢獻獎（英语：Outstanding Contribution to Computer Science Education）（1989）; 圖靈獎（1972）; ACM會士（英语：ACM Fellow）（1994）; 戴克斯特拉獎（英语：Dijkstra Prize）（2002）;
	科学生涯
研究领域	計算機科學、理論計算機科學
机构	荷蘭數學和計算機科學研究學會; 埃因霍温理工大学; 寶來公司（英语：Burroughs Corporation）; 德克薩斯大學奧斯汀分校
论文	Communication with an Automatic Computer（1959）
博士導師	阿德里安·范·韦恩加登
博士生	尼可·赫伯曼; 揚·L·A·范·德·斯內普肖特（英语：Jan L. A. van de Snepscheut）; Netty van Gasteren; David A. Naumann
受影响自	阿德里安·范·韦恩加登;
施影响于	東尼·霍爾; 尼克勞斯·維爾特; 泊·派克·漢森; 萊斯利·蘭波特; 什洛米·多萊夫（英语：Shlomi Dolev）; 亞歷山大·斯特潘諾夫（英语：Alexander Stepanov）; 戴維·格里斯（英语：David Gries）; 大衛·派納斯（英语：David Parnas）;

以互动方式浏览历史

←上一版本

删除的内容添加的内容

可视化wikitext

行内

2024年10月27日 (日) 03:05的最新版本

艾兹赫尔·韦伯·戴克斯特拉（荷蘭語：Edsger Wybe Dijkstra，荷兰语：[ˈɛtsxər ˈʋibə ˈdɛikstra] （^ⓘ），1930年5月11日—2002年8月6日），又譯艾兹赫尔·韦伯·迪杰斯特拉，生於荷蘭鹿特丹，计算机科学家，是荷蘭第一位以程序设计為專業的科學家。^[9]他曾在1972年获得图灵奖，之后还获得1974年AFIPS Harry Goode Memorial Award、1989年ACM SIGCSE计算机科学教育教学杰出贡献奖。

2002年，在他去世前不久，获得了ACM PODC（分布式计算原理）最具影响力论文奖，以表彰他在分布式领域中关于程序计算自稳定的贡献。为了纪念他，这个每年一度奖项也在此之后更名为“Dijkstra奖”。

他曾经提出“GOTO有害论”，信号量和PV原语（passeren vrijgeven），解决了“哲学家就餐问题”。

生平

艾兹赫尔·韦伯·戴克斯特拉出生于鹿特丹，大學就讀於萊頓大學，研究理論物理學。^[10]^[11]但他很快就發現自己的興趣是計算機科學。1980年代，擔任埃因霍溫理工大學教授。

2002年8月6日，戴克斯特拉在荷兰尼嫩自己的家中与世长辞。终年72岁。

學術貢獻

他的贡献包括：

提出了目前在离散数学中应用广泛的最短路径算法（Dijkstra's Shortest Path First Algorithm）
为解决操作系统中资源分配问题，提出银行家算法。

註釋

^ Hoare, C.A.R. The 2010 Edsger W. Dijkstra Memorial Lecture: What Can We Learn from Edsger W. Dijkstra?. Department of Computer Science, The University of Texas at Austin. 12 October 2010 [12 August 2015]. （原始内容存档于2022-03-21）.
^ 引用错误：没有为名为Wirth2005的参考文献提供内容
^ 引用错误：没有为名为Wirth2008的参考文献提供内容
^ In his 2004 memoir, "A Programmer's Story: The Life of a Computer Pioneer", Brinch Hansen wrote that he used "Cooperating Sequential Processes" to guide his work implementing multiprogramming on the RC 4000, and described it saying, "One of the great works in computer programming, this masterpiece laid the conceptual foundation for concurrent programming."
^ Lamport, Leslie. 2002 PODC Influential Paper Award. ACM Symposium on Principles of Distributed Computing. 2002 [2020-09-22]. （原始内容存档于2019-10-06）. Edsger W. Dijkstra started the field of concurrent and distributed algorithms with his 1965 CACM paper "Solution of a Problem in Concurrent Programming Control", in which he first stated and solved the mutual exclusion problem. That paper is probably why PODC exists; it certainly inspired most of my work.
^ 引用错误：没有为名为Lamport (2015)的参考文献提供内容
^ Dolev, Shlomi: Self-stabilization. (Cambridge, MA: MIT Press, 2000) ISBN 978-0-262-04178-2
^ Lo Russo, Graziano (1997). An Interview with A. Stepanov (Edizioni Infomedia srl.). STLport.org. [21 December 2017]. （原始内容存档于2009-03-04）. Alexander Stepanov: "...I also discovered books of two great computer scientists from whose work I learned the scientific foundation of my trade: Donald Knuth and Edsger Dijkstra. Knuth taught me the answers. Dijkstra taught me the questions. Time and time again I come back to their works for new insights."
^ Hoare, Tony. Obituary: Edsger Wybe Dijkstra. Physics Today. March 2003, 56 (3): 96–98 [2017-07-19]. doi:10.1063/1.1570789. （原始内容存档于2016-08-31）.
^ Edsger Wybe Dijkstra. Stichting Digidome. 3 September 2003. （原始内容存档于6 December 2004）.
^ O'Connor, J J; Robertson, E F. Dijkstra biography. The MacTutor History of Mathematics, School of Mathematics and Statistics, University of St Andrews, Scotland. July 2008 [18 January 2014]. （原始内容存档于11 October 2013）.

延伸閱讀

Apt, Krzysztof R. Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius. Formal Aspects of Computing. 2002, 14 (2): 92–98 [2018-04-03]. arXiv:cs/0210001 . doi:10.1007/s001650200029. （原始内容存档于2021-04-11）.
Per Brinch Hansen. The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls. Springer. 2002 [2018-04-03]. ISBN 978-0-387-95401-1. （原始内容存档于2021-04-11）.
M. Ben-Ari（英语：Mordechai Ben-Ari）. Principles of Concurrent and Distributed Programming 2nd. Addison-Wesley. 2006 [2018-04-03]. ISBN 978-0-321-31283-9. （原始内容存档于2021-04-11）.
Broy, M.; Denert, Ernst (编). Software Pioneers: Contributions to Software Engineering. Springer. 2002: 3 [2018-04-03]. ISBN 978-3-540-43081-0. （原始内容存档于2021-04-11）.
Daylight, Edgar G. The Dawn of Software Engineering: from Turing to Dijkstra. Lonely Scholar. 2012. ISBN 9789491386022.
Daylight, Edgar G. Dijkstra's Rallying Cry for Generalization: The Advent of the Recursive Procedure, Late 1950s–Early 1960s. The Computer Journal. 2011, 54 (11): 1756–72. doi:10.1093/comjnl/bxr002.
Shlomi Dolev（英语：Shlomi Dolev）. Self-stabilization. MIT Press. 2000 [2018-04-03]. ISBN 978-0-262-04178-2. （原始内容存档于2021-04-11）.
Feijen, W.H.J.; Gries, David (编). Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra. Springer. 1990 [2018-04-03]. ISBN 978-0-387-97299-2. （原始内容存档于2021-04-11）.
Laplante, Phillip A. Great papers in computer science. IEEE Press. 1996 [2018-04-03]. ISBN 978-0-7803-1112-1. （原始内容存档于2021-04-11）.
Lee, J.A.N. Frontiers of Computing: A Tribute to Edsger W. Dijkstra on the Occasion of his 60th Birthday (PDF). Ann. Hist. Comp. 1991, 13 (1): 91–96 [2018-04-03]. （原始内容存档于2021-04-11）.
O’Regan, Gerard. Giants of Computing: A Compendium of Select, Pivotal Pioneers. Springer. 2013 [2018-04-03]. ISBN 978-1-4471-5340-5. （原始内容存档于2021-04-11）.
Payette, Sandy. Hopper and Dijkstra: Crisis, Revolution, and the Future of Programming. IEEE Annals of the History of Computing. 2014, 36 (4): 64–73 [2018-04-03]. doi:10.1109/MAHC.2014.54. （原始内容存档于2021-04-11）.
Shasha, Dennis; Lazere, Cathy. Out of their Minds: The Lives and Discoveries of 15 Great Computer Scientists. Springer. 1998 [2018-04-03]. ISBN 978-0-387-98269-4. （原始内容存档于2021-04-11）.

外部連結

E.W. Dijkstra Archive. Center for American History, University of Texas at Austin. [2018-04-03]. （原始内容存档于2005-04-20）.
Dijkstra's Rallying Cry for Generalization. A site devoted to Dijkstra’s works and thoughts, created and maintained by the historian of computing Edgar Graham Daylight. [2018-04-03]. （原始内容存档于2021-04-11）.

[1] Hoare, C.A.R. The 2010 Edsger W. Dijkstra Memorial Lecture: What Can We Learn from Edsger W. Dijkstra?. Department of Computer Science, The University of Texas at Austin. 12 October 2010 [12 August 2015]. （原始内容存档于2022-03-21）.

[Wirth2005-2] 引用错误：没有为名为Wirth2005的参考文献提供内容

[Wirth2008-3] 引用错误：没有为名为Wirth2008的参考文献提供内容

[4] In his 2004 memoir, "A Programmer's Story: The Life of a Computer Pioneer", Brinch Hansen wrote that he used "Cooperating Sequential Processes" to guide his work implementing multiprogramming on the RC 4000, and described it saying, "One of the great works in computer programming, this masterpiece laid the conceptual foundation for concurrent programming."

[LLamport2002-5] Lamport, Leslie. 2002 PODC Influential Paper Award. ACM Symposium on Principles of Distributed Computing. 2002 [2020-09-22]. （原始内容存档于2019-10-06）. Edsger W. Dijkstra started the field of concurrent and distributed algorithms with his 1965 CACM paper "Solution of a Problem in Concurrent Programming Control", in which he first stated and solved the mutual exclusion problem. That paper is probably why PODC exists; it certainly inspired most of my work.

[Lamport_(2015)-6] 引用错误：没有为名为Lamport (2015)的参考文献提供内容

[Dolev2000-7] Dolev, Shlomi: Self-stabilization. (Cambridge, MA: MIT Press, 2000) ISBN 978-0-262-04178-2

[Stepanov-8] Lo Russo, Graziano (1997). An Interview with A. Stepanov (Edizioni Infomedia srl.). STLport.org. [21 December 2017]. （原始内容存档于2009-03-04）. Alexander Stepanov: "...I also discovered books of two great computer scientists from whose work I learned the scientific foundation of my trade: Donald Knuth and Edsger Dijkstra. Knuth taught me the answers. Dijkstra taught me the questions. Time and time again I come back to their works for new insights."

[9] Hoare, Tony. Obituary: Edsger Wybe Dijkstra. Physics Today. March 2003, 56 (3): 96–98 [2017-07-19]. doi:10.1063/1.1570789. （原始内容存档于2016-08-31）.

[10] Edsger Wybe Dijkstra. Stichting Digidome. 3 September 2003. （原始内容存档于6 December 2004）.

[11] O'Connor, J J; Robertson, E F. Dijkstra biography. The MacTutor History of Mathematics, School of Mathematics and Statistics, University of St Andrews, Scotland. July 2008 [18 January 2014]. （原始内容存档于11 October 2013）.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

@@ 第4行： / 第4行： @@
 }}
 {{Infobox scientist
-| name              = 艾兹赫尔·戴克斯特拉<br>Edsger Dijkstra
+| name              = 艾兹赫尔·戴克斯特拉
-| native_name       =
+| native_name       = Edsger Dijkstra
 | native_name_lang  = nl
 | image             = Edsger Wybe Dijkstra.jpg
@@ 第16行： / 第16行： @@
 | citizenship       = {{NET}}
 | spouse            =  Maria (Ria) C. Debets
-| field             = {{Unbulleted list |[[計算機科學]] |[[理論計算機科學]]}}
+| field             = [[計算機科學]]、[[理論計算機科學]]
-| workplaces = {{Unbulleted list |[[荷蘭數學和計算機科學研究學會]] |[[埃因霍温理工大学]] |{{le|寶來公司|Burroughs Corporation}} |[[德克薩斯大學奧斯汀分校]]}}
+| workplaces        = [[荷蘭數學和計算機科學研究學會]]<br>[[埃因霍温理工大学]]<br>{{le|寶來公司|Burroughs Corporation}}<br>[[德克薩斯大學奧斯汀分校]]
 | education         = [[萊頓大學]]（B.S., M.S.）<br>[[阿姆斯特丹大學]]（Ph.D.）
-| doctoral_advisor  = {{le|阿德里安·範·韋恩加登|Adriaan van Wijngaarden}}
+| doctoral_advisor  = [[阿德里安·范·韦恩加登]]
-| doctoral_students = {{Unbulleted list |{{le|尼可·赫伯曼|Nico Habermann}} |{{le|Jan van de Snepscheut|Jan L. A. van de Snepscheut}}
+| doctoral_students = [[尼可·赫伯曼]]<br>{{le|揚·L·A·范·德·斯內普肖特|Jan L. A. van de Snepscheut}}<br>Netty van Gasteren<br>David A. Naumann
+| thesis_title      = ''Communication with an Automatic Computer''
-    |Netty van Gasteren |David A. Naumann }}
-| thesis_title      = Communication with an Automatic Computer
 | thesis_year = 1959
-| influences        = {{Unbulleted list |{{le|阿德里安·範·韋恩加登|Adriaan van Wijngaarden}}}}
+| influences        = {{Unbulleted list |[[阿德里安·范·韦恩加登]]}}
 | influenced        = {{Unbulleted list
- |[[東尼·霍爾]]<ref>{{cite web|url=https://www.cs.utexas.edu/users/EWD/DijkstraMemorialLectures/Tony%20Hoare.html |author-link=Tony Hoare|last=Hoare |first=C.A.R. |title=The 2010 Edsger W. Dijkstra Memorial Lecture: What Can We Learn from Edsger W. Dijkstra? |publisher=Department of Computer Science, The University of Texas at Austin |date=12 October 2010 |access-date=12 August 2015}}</ref>
+ |[[東尼·霍爾]]<ref>{{cite web |url=https://www.cs.utexas.edu/users/EWD/DijkstraMemorialLectures/Tony%20Hoare.html |author-link=Tony Hoare |last=Hoare |first=C.A.R. |title=The 2010 Edsger W. Dijkstra Memorial Lecture: What Can We Learn from Edsger W. Dijkstra? |publisher=Department of Computer Science, The University of Texas at Austin |date=12 October 2010 |access-date=12 August 2015 |archive-date=2022-03-21 |archive-url=https://web.archive.org/web/20220321191414/https://www.cs.utexas.edu/users/EWD/DijkstraMemorialLectures/Tony%20Hoare.html |dead-url=no }}</ref>
  |[[尼克勞斯·維爾特]]<ref name=Wirth2005/><ref name=Wirth2008/>
  |[[泊·派克·漢森]]<ref>In his 2004 memoir, "A Programmer's Story: The Life of a Computer Pioneer", Brinch Hansen wrote that he used "Cooperating Sequential Processes" to guide his work implementing multiprogramming on the RC 4000, and described it saying, "One of the great works in computer programming, this masterpiece laid the conceptual foundation for concurrent programming."</ref>
- |[[萊斯利·蘭波特]]<ref name="LLamport2002">{{cite web |last=Lamport |first=Leslie |year=2002 |url=http://www.podc.org/influential/2002-influential-paper/ |access-date=2020-09-22 |title=2002 PODC Influential Paper Award |publisher=ACM Symposium on Principles of Distributed Computing |quote=Edsger W. Dijkstra started the field of concurrent and distributed algorithms with his 1965 CACM paper "Solution of a Problem in Concurrent Programming Control", in which he first stated and solved the mutual exclusion problem. That paper is probably why [[PODC]] exists; it certainly inspired most of my work.}}</ref><ref name="Lamport (2015)"/>
+ |[[萊斯利·蘭波特]]<ref name="LLamport2002">{{cite web |last=Lamport |first=Leslie |year=2002 |url=http://www.podc.org/influential/2002-influential-paper/ |access-date=2020-09-22 |title=2002 PODC Influential Paper Award |publisher=ACM Symposium on Principles of Distributed Computing |quote=Edsger W. Dijkstra started the field of concurrent and distributed algorithms with his 1965 CACM paper "Solution of a Problem in Concurrent Programming Control", in which he first stated and solved the mutual exclusion problem. That paper is probably why [[PODC]] exists; it certainly inspired most of my work. |archive-date=2019-10-06 |archive-url=https://web.archive.org/web/20191006073138/http://www.podc.org/influential/2002-influential-paper/ |dead-url=no }}</ref><ref name="Lamport (2015)"/>
  |{{le|什洛米·多萊夫|Shlomi Dolev}}<ref name="Dolev2000">[[Shlomi Dolev|Dolev, Shlomi]]: ''[[Self-stabilization]]''. (Cambridge, MA: MIT Press, 2000) {{ISBN|978-0-262-04178-2}}</ref>
- |{{le|亞歷山大·斯特潘諾夫|Alexander Stepanov}}<ref name="Stepanov">{{cite web|url=http://www.stlport.org/resources/StepanovUSA.html |author=Lo Russo, Graziano (1997) |title=An Interview with A. Stepanov (Edizioni Infomedia srl.) |publisher=STLport.org |quote=[[Alexander Stepanov]]: "...I also discovered books of two great computer scientists from whose work I learned the scientific foundation of my trade: [[Donald Knuth]] and Edsger Dijkstra. Knuth taught me the answers. Dijkstra taught me the questions. Time and time again I come back to their works for new insights." |access-date=21 December 2017}}</ref>
+ |{{le|亞歷山大·斯特潘諾夫|Alexander Stepanov}}<ref name="Stepanov">{{cite web |url=http://www.stlport.org/resources/StepanovUSA.html |author=Lo Russo, Graziano (1997) |title=An Interview with A. Stepanov (Edizioni Infomedia srl.) |publisher=STLport.org |quote=[[Alexander Stepanov]]: "...I also discovered books of two great computer scientists from whose work I learned the scientific foundation of my trade: [[Donald Knuth]] and Edsger Dijkstra. Knuth taught me the answers. Dijkstra taught me the questions. Time and time again I come back to their works for new insights." |access-date=21 December 2017 |archive-date=2009-03-04 |archive-url=https://web.archive.org/web/20090304120628/http://www.stlport.org/resources/StepanovUSA.html |dead-url=no }}</ref>
  |{{le|戴維·格里斯|David Gries}}
  |{{le|大衛·派納斯|David Parnas}}}}
@@ 第38行： / 第37行： @@
 | footnotes               =
 }}
-'''艾兹赫尔·韦伯·戴克斯特拉'''（{{lang-nl|Edsger Wybe Dijkstra}}，{{IPA-nl|ˈɛtsxər ˈʋibə ˈdɛikstra|lang|Dijkstra.ogg|lang}}，{{bd|1930年|5月11日|2002年|8月6日|catIdx=D}}），又譯'''艾兹赫尔·韦伯·迪杰斯特拉'''，生於[[荷蘭]][[鹿特丹]]，[[计算机科学]]家，是荷蘭第一位以程式為專業的科學家。<ref>{{cite journal|author=Hoare, Tony|authorlink=Tony Hoare|title=Obituary: Edsger Wybe Dijkstra|journal=Physics Today|date=March 2003|volume=56|issue=3|pages=96–98|url=http://scitation.aip.org/content/aip/magazine/physicstoday/article/56/3/10.1063/1.1570789|doi=10.1063/1.1570789}}</ref>曾在1972年获得[[图灵奖]]，之后，他还获得1974年AFIPS Harry Goode Memorial Award、1989年ACM SIGCSE计算机科学教育教学杰出贡献奖。
+'''艾兹赫尔·韦伯·戴克斯特拉'''（{{lang-nl|Edsger Wybe Dijkstra}}，{{IPA-nl|ˈɛtsxər ˈʋibə ˈdɛikstra|lang|Dijkstra.ogg|lang}}，{{bd|1930年|5月11日|2002年|8月6日|catIdx=D}}），又譯'''艾兹赫尔·韦伯·迪杰斯特拉'''，生於[[荷蘭]][[鹿特丹]]，[[计算机科学]]家，是荷蘭第一位以程序设计為專業的科學家。<ref>{{cite journal|author=Hoare, Tony|authorlink=Tony Hoare|title=Obituary: Edsger Wybe Dijkstra|journal=Physics Today|date=March 2003|volume=56|issue=3|pages=96–98|url=http://scitation.aip.org/content/aip/magazine/physicstoday/article/56/3/10.1063/1.1570789|doi=10.1063/1.1570789|access-date=2017-07-19|archive-date=2016-08-31|archive-url=https://web.archive.org/web/20160831092258/http://scitation.aip.org/content/aip/magazine/physicstoday/article/56/3/10.1063/1.1570789|dead-url=no}}</ref>他曾在1972年获得[[图灵奖]]，之后还获得1974年AFIPS Harry Goode Memorial Award、1989年ACM SIGCSE计算机科学教育教学杰出贡献奖。
-年，在他去世前不久，艾兹赫尔获得了ACM PODC（分布式计算原理）最具影响力论文奖，以表彰他在分布式领域中关于程序计算自稳定的贡献。为了纪念他，这个每年一度奖项也在此后被更名为“Dijkstra奖”。
+年，在他去世前不久，获得了ACM PODC（分布式计算原理）最具影响力论文奖，以表彰他在分布式领域中关于程序计算自稳定的贡献。为了纪念他，这个每年一度奖项也在此之后更名为“Dijkstra奖”。
-他曾经提出“[[Goto#对于goto使用的批评|GOTO有害论]]”，[[信号量]]和[[PV原语]]（{{lang|nl|passeren vrijgeven}}），解决了有趣的“[[哲学家就餐问题]]”。
+他曾经提出“[[Goto#对于goto使用的批评|GOTO有害论]]”，[[信号量]]和PV原语（{{lang|nl|passeren vrijgeven}}），解决了“[[哲学家就餐问题]]”。
 ==生平==
@@ 第51行： / 第50行： @@
 == 學術貢獻 ==
 他的贡献包括：
-* 提出了目前在[[离散数学]]中应用广泛的[[Dijkstra演算法|最短路径算法]]（Dijkstra's Shortest Path First Algorithm）
+* 提出了目前在[[离散数学]]中应用广泛的[[Dijkstra算法|最短路径算法]]（Dijkstra's Shortest Path First Algorithm）
 * 为解决[[操作系统]]中资源分配问题，提出[[银行家算法]]。
@@ 第59行： / 第58行： @@
 == 延伸閱讀 ==
 {{refbegin|2}}
-*{{cite journal |first=Krzysztof R. |last=Apt |title=Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius |journal=Formal Aspects of Computing |volume=14 |issue=2 |pages=92–98 |year=2002 |doi=10.1007/s001650200029 |url=https://link.springer.com/article/10.1007/s001650200029 |arxiv=cs/0210001 |ref=harv}}
+*{{cite journal |first=Krzysztof R. |last=Apt |title=Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius |journal=Formal Aspects of Computing |volume=14 |issue=2 |pages=92–98 |year=2002 |doi=10.1007/s001650200029 |url=https://link.springer.com/article/10.1007/s001650200029 |arxiv=cs/0210001 |ref=harv |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411092949/https://link.springer.com/article/10.1007/s001650200029 |dead-url=no }}
-*{{cite book |author1=[[泊·派克·漢森|Per Brinch Hansen]] |title=The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls |url=https://books.google.com/books?id=LFpzL3529vkC |date=2002 |publisher=Springer |isbn=978-0-387-95401-1 |ref=harv}}
+*{{cite book |author1=[[泊·派克·漢森|Per Brinch Hansen]] |title=The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls |url=https://books.google.com/books?id=LFpzL3529vkC |date=2002 |publisher=Springer |isbn=978-0-387-95401-1 |ref=harv |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411100111/https://books.google.com/books?id=LFpzL3529vkC |dead-url=no }}
-*{{cite book |author1={{tsl|en|Mordechai Ben-Ari||M. Ben-Ari}}|title=Principles of Concurrent and Distributed Programming |url=https://books.google.com/books?id=BJNQAAAAMAAJ |edition=2nd |year=2006 |publisher=Addison-Wesley |isbn=978-0-321-31283-9}}
+*{{cite book |author1={{tsl|en|Mordechai Ben-Ari||M. Ben-Ari}} |title=Principles of Concurrent and Distributed Programming |url=https://books.google.com/books?id=BJNQAAAAMAAJ |edition=2nd |year=2006 |publisher=Addison-Wesley |isbn=978-0-321-31283-9 |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411100115/https://books.google.com/books?id=BJNQAAAAMAAJ |dead-url=no }}
-*{{cite book |editor-first=M. |editor-last=Broy |editor2-first=Ernst |editor2-last=Denert |title=Software Pioneers: Contributions to Software Engineering |url=https://books.google.com/books?id=6f-8ZhMO3ScC&pg=PA3 |date=2002 |publisher=Springer |isbn=978-3-540-43081-0 |pages=3 |ref=harv}}
+*{{cite book |editor-first=M. |editor-last=Broy |editor2-first=Ernst |editor2-last=Denert |title=Software Pioneers: Contributions to Software Engineering |url=https://books.google.com/books?id=6f-8ZhMO3ScC&pg=PA3 |date=2002 |publisher=Springer |isbn=978-3-540-43081-0 |pages=3 |ref=harv |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411093036/https://books.google.com/books?id=6f-8ZhMO3ScC&pg=PA3 |dead-url=no }}
 *{{cite book |first=Edgar G. |last=Daylight |title=The Dawn of Software Engineering: from Turing to Dijkstra |publisher=Lonely Scholar |location= |year=2012 |isbn=9789491386022 }}
 *{{cite journal |first=Edgar G. |last=Daylight |title=Dijkstra's Rallying Cry for Generalization: The Advent of the Recursive Procedure, Late 1950s–Early 1960s |journal=The Computer Journal |volume=54 |issue=11 |pages=1756–72 |year=2011 |doi=10.1093/comjnl/bxr002 |url=https://archive.org/details/sim_computer-journal_2011-11_54_11/page/1756}}
-*{{cite book |author1={{tsl|en|Shlomi Dolev|}} |title=Self-stabilization |url=https://books.google.com/books?id=UPdnRDX-ygQC |year=2000 |publisher=MIT Press |isbn=978-0-262-04178-2 |ref=harv}}
+*{{cite book |author1={{tsl|en|Shlomi Dolev|}} |title=Self-stabilization |url=https://books.google.com/books?id=UPdnRDX-ygQC |year=2000 |publisher=MIT Press |isbn=978-0-262-04178-2 |ref=harv |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411093052/https://books.google.com/books?id=UPdnRDX-ygQC |dead-url=no }}
-*{{cite book |editor-first=W.H.J. |editor-last=Feijen |editor2-first=David |editor2-last=Gries |title=Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra |url=https://books.google.com/books?id=G9QXCy94KQYC |date=1990 |publisher=Springer |isbn=978-0-387-97299-2 |ref=harv}}
+*{{cite book |editor-first=W.H.J. |editor-last=Feijen |editor2-first=David |editor2-last=Gries |title=Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra |url=https://books.google.com/books?id=G9QXCy94KQYC |date=1990 |publisher=Springer |isbn=978-0-387-97299-2 |ref=harv |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411093039/https://books.google.com/books?id=G9QXCy94KQYC |dead-url=no }}
-*{{cite book |first=Phillip A. |last=Laplante |title=Great papers in computer science |url=https://books.google.com/books?id=GmgZAQAAIAAJ |date=1996 |publisher=IEEE Press |isbn=978-0-7803-1112-1 |ref=harv}}
+*{{cite book |first=Phillip A. |last=Laplante |title=Great papers in computer science |url=https://books.google.com/books?id=GmgZAQAAIAAJ |date=1996 |publisher=IEEE Press |isbn=978-0-7803-1112-1 |ref=harv |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411100119/https://books.google.com/books?id=GmgZAQAAIAAJ |dead-url=no }}
-*{{cite journal |first=J.A.N. |last=Lee |title=Frontiers of Computing: A Tribute to Edsger W. Dijkstra on the Occasion of his 60th Birthday |journal=Ann. Hist. Comp. |volume=13 |issue=1 |pages=91–96 |year=1991 |format=PDF |url=http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4638285}}
+*{{cite journal |first=J.A.N. |last=Lee |title=Frontiers of Computing: A Tribute to Edsger W. Dijkstra on the Occasion of his 60th Birthday |journal=Ann. Hist. Comp. |volume=13 |issue=1 |pages=91–96 |year=1991 |format=PDF |url=http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4638285 |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411100124/https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4638285 |dead-url=no }}
-*{{cite book |first=Gerard |last=O’Regan |title=Giants of Computing: A Compendium of Select, Pivotal Pioneers |url=https://books.google.com/books?id=oSq5BAAAQBAJ |date=2013 |publisher=Springer |isbn=978-1-4471-5340-5}}
+*{{cite book |first=Gerard |last=O’Regan |title=Giants of Computing: A Compendium of Select, Pivotal Pioneers |url=https://books.google.com/books?id=oSq5BAAAQBAJ |date=2013 |publisher=Springer |isbn=978-1-4471-5340-5 |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411093111/https://books.google.com/books?id=oSq5BAAAQBAJ |dead-url=no }}
-*{{cite journal |first=Sandy |last=Payette |title=Hopper and Dijkstra: Crisis, Revolution, and the Future of Programming |journal=IEEE Annals of the History of Computing |volume=36 |issue=4 |pages=64–73 |year=2014 |doi=10.1109/MAHC.2014.54 |url=http://ieeexplore.ieee.org/abstract/document/6982140/}}
+*{{cite journal |first=Sandy |last=Payette |title=Hopper and Dijkstra: Crisis, Revolution, and the Future of Programming |journal=IEEE Annals of the History of Computing |volume=36 |issue=4 |pages=64–73 |year=2014 |doi=10.1109/MAHC.2014.54 |url=http://ieeexplore.ieee.org/abstract/document/6982140/ |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411100144/https://ieeexplore.ieee.org/abstract/document/6982140/ |dead-url=no }}
-*{{cite book |first=Dennis |last=Shasha |first2=Cathy |last2=Lazere |title=Out of their Minds: The Lives and Discoveries of 15 Great Computer Scientists |url=https://books.google.com/books?id=-0tDZX3z-8UC |date=1998 |publisher=Springer |isbn=978-0-387-98269-4}}
+*{{cite book |first=Dennis |last=Shasha |first2=Cathy |last2=Lazere |title=Out of their Minds: The Lives and Discoveries of 15 Great Computer Scientists |url=https://books.google.com/books?id=-0tDZX3z-8UC |date=1998 |publisher=Springer |isbn=978-0-387-98269-4 |access-date=2018-04-03 |archive-date=2021-04-11 |archive-url=https://web.archive.org/web/20210411093132/https://books.google.com/books?id=-0tDZX3z-8UC |dead-url=no }}
 {{refend}}
@@ 第77行： / 第76行： @@
 {{Commons category|Edsger Wybe Dijkstra}}
 {{wikiquote}}
-*{{cite web |title=E.W. Dijkstra Archive |date= |work= |publisher=Center for American History, [[University of Texas at Austin]] |url=http://www.cs.utexas.edu/users/EWD/}}
+*{{cite web |title=E.W. Dijkstra Archive |date= |work= |publisher=Center for American History, [[University of Texas at Austin]] |url=http://www.cs.utexas.edu/users/EWD/ |access-date=2018-04-03 |archive-date=2005-04-20 |archive-url=https://web.archive.org/web/20050420044927/http://www.cs.utexas.edu/users/EWD/ |dead-url=no }}
-*{{cite web |title=Dijkstra's Rallying Cry for Generalization |date= |work=|publisher=A site devoted to Dijkstra’s works and thoughts, created and maintained by the historian of computing Edgar Graham Daylight|url=http://www.dijkstrascry.com/}}
+*{{cite web|title=Dijkstra's Rallying Cry for Generalization|date=|work=|publisher=A site devoted to Dijkstra’s works and thoughts, created and maintained by the historian of computing Edgar Graham Daylight|url=http://www.dijkstrascry.com/|access-date=2018-04-03|archive-date=2021-04-11|archive-url=https://web.archive.org/web/20210411093205/https://www.dijkstrascry.com/|dead-url=no}}
 {{-}}
 {{圖靈獎}}
@@ 第86行： / 第85行： @@
 {{DEFAULTSORT:Dijkstra}}
 [[Category:荷兰计算机科学家]]
+[[Category:计算机科学教育家]]
 [[Category:圖靈獎獲得者]]
-[[Category:德州大學奧斯汀分校教師|D]]
+[[Category:德克薩斯大學奧斯汀分校教師|D]]
 [[Category:荷蘭程序員]]
 [[Category:萊頓大學校友]]

查论编图灵奖获得者
1960年代	1966年：艾伦·佩利 1967年：莫里斯·威尔克斯 1968年：理查德·衛斯里·漢明 1969年：马文·闵斯基
1970年代	1970年：詹姆斯·哈迪·威尔金森 1971年：約翰·麥卡錫 1972年：艾兹赫尔·戴克斯特拉 1973年：查尔斯·巴赫曼 1974年：高德纳 1975年：艾伦·纽厄尔司马贺 1976年：迈克尔·拉宾达纳·斯科特 1977年：約翰·巴科斯 1978年：罗伯特·弗洛伊德 1979年：肯尼斯·艾佛森
1980年代	1980年：東尼·霍爾 1981年：埃德加·科德 1982年：史提芬·古克 1983年：肯·汤普逊丹尼斯·里奇 1984年：尼克劳斯·维尔特 1985年：理查德·卡普 1986年：约翰·霍普克罗夫特羅伯特·塔揚 1987年：約翰·科克 1988年：伊凡·蘇澤蘭 1989年：威廉·卡韓
1990年代	1990年：费尔南多·考巴托 1991年：罗宾·米尔纳 1992年：巴特勒·蘭普森 1993年：尤里斯·哈特马尼斯理查德·斯特恩斯 1994年：愛德華·費根鮑姆拉吉·瑞迪 1995年：曼纽尔·布卢姆 1996年：阿米尔·伯努利 1997年：道格拉斯·恩格尔巴特 1998年：詹姆斯·尼古拉·格雷 1999年：弗雷德里克·布鲁克斯
2000年代	2000年：姚期智 2001年：奧利-約翰·達爾克利斯登·奈加特 2002年：罗纳德·李维斯特阿迪·萨莫尔伦纳德·阿德曼 2003年：艾伦·凯 2004年：文頓·瑟夫罗伯特·卡恩 2005年：彼得·諾爾 2006年：法兰·艾伦 2007年：爱德蒙·克拉克艾伦·爱默生约瑟夫·斯发基斯 2008年：芭芭拉·利斯科夫 2009年：查尔斯·萨克尔
2010年代	2010年：莱斯利·瓦利安特 2011年：朱迪亚·珀尔 2012年：莎菲·戈德瓦塞尔希爾維奧·米卡利 2013年：莱斯利·兰波特 2014年：迈克尔·斯通布雷克 2015年：惠特菲爾德·迪菲馬丁·赫爾曼 2016年：蒂姆·伯纳斯-李 2017年：約翰·軒尼詩大衛·帕特森 2018年：杰弗里·辛顿杨立昆约书亚·本希奥 2019年：帕特里克·汉拉恩艾德文·卡特姆
2020年代	2020年：阿尔佛雷德·艾侯杰弗瑞·乌尔曼 2021年：杰克·唐加拉 2022年：罗伯特·梅特卡夫 2023年：阿维·威格德森
Category:图灵奖获得者

规范控制数据库
国际	FAST ISNI VIAF WorldCat
各地	挪威法国 BnF data 德国以色列比利时美国瑞典拉脱维亚日本捷克澳大利亚克罗地亚荷兰波兰
学术	计算机协会 CiNii DBLP MathSciNet 数学谱系计划 Scopus zbMATH
人物	荷兰 Trove
其他	CONOR SNAC IdRef