Edsger Dajkstra

Edsger Dajkstra
Lični podaci
Datum rođenja	(1930-05-11)11. maj 1930.
Mesto rođenja	Roterdam, Holandija
Datum smrti	6. avgust 2002.(2002-08-06) (72 god.)
Mesto smrti	Njunen, Holandija
Obrazovanje	Univerzitet u Lajdenu, Erasmianum gimnazija, Univerzitet u Amsterdamu
Naučni rad
Polje	Računarstvo
Institucija	Mathematisch Centrum Teksaški univerzitet, Ostin
Učenici	Toni Hor Niklaus Virt Per Brinh Hansen Lesli Lamport Šlomi Dolev Aleksandar Stepanov Dejvid Gries Dejvid Parnas
Poznat po	Dajkstrinom algoritmu Semaforu
Nagrade	Tjuringova nagrada

Edsger Dajkstra (hol. Edsger Wybe Dijkstra; Roterdam, 11. maj 1930 — Njunen, 6. avgust 2002), fonetski Edsher Dejkstra, bio je holandski informatičar koji je 1972. godine dobio Tjuringovu nagradu za svoje ključne doprinose u razvoju programskih jezika.

Vidi još

• Dajkstrin algoritam
• Problem ručajućih filozofa
• Semafora

Izabrane publikacije

Knjige

• — (1962). A Primer of ALGOL 60 Programming: Together with Report on the Algorithmic Language ALGOL 60. Academic Press. ISBN 978-0122162503. 
• —; Dahl, Ole-Johan; Hoare, C.A.R. (1972). Structured Programming. Academic Press. ISBN 978-0-12-200550-3. 
• — (1976). A Discipline of Programming. Prentice Hall. ISBN 978-0132158718. 
• — (1982). Selected Writings on Computing: A Personal Perspective. Monographs in Computer Science. Springer. ISBN 978-0387906522. 
• —; Feijen, W.H.J.; Sterringa, Joke (1988). A Method of Programming. Addison-Wesley. ISBN 978-0201175363. 
• —; Scholten, Carel S. (1990). Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag. ISBN 978-0387969572. 

Izabrani članci

• — (1959). „A Note on Two Problems in Connexion with Graphs” (PDF). Numerische Mathematik. 23 (3): 269—271. CiteSeerX 10.1.1.165.7577 . S2CID 123284777. doi:10.1007/BF01386390. 
• — (1962). „Some Meditations on Advanced Programming”. Proc. IFIP Congress. Amsterdam: North-Holland. str. 535—8. 
• — (1965). Cooperating Sequential Processes (Tehnički izveštaj). Technische Hogeschool Eindhoven. EWD-123. Pristupljeno 2020-09-20.  Reprinted in Genuys, F., ur. (1968). Programming Languages: N.A.T.O. Advanced Summer School Held in Villard-de-Lans in 1966. Academic Press. str. 43—112. OCLC 499952053.  Published as Dijkstra, E.W. (1968). „Cooperating Sequential Processes”. Ur.: Hansen, P.B. The Origin of Concurrent Programming. New York: Springer. str. 65—138. ISBN 978-1-4419-2986-0. doi:10.1007/978-1-4757-3472-0_2. 
• — (1965). „Solution of a Problem in Concurrent Programming Control”. Comm. ACM. 8 (9): 569. S2CID 19357737. doi:10.1145/365559.365617. 
• — (1965). „Programming Considered as a Human Activity”. Proc. IFIP Congress. str. 213—7. 
• — (1968). „Go To Statement Considered Harmful”. Letters to the editor. Comm. ACM. 11 (3): 147—8. S2CID 17469809. doi:10.1145/362929.362947. 
• — (1968). „A Constructive Approach to the Problem of Program Correctness”. BIT Numerical Mathematics. 8 (3): 174—186. S2CID 62224342. doi:10.1007/bf01933419. 
• — (maj 1968). „The Structure of the 'THE'-Multiprogramming System”. ACM Symp. on Operating Systems. Comm. ACM. 11 (5): 341—346. S2CID 2021311. doi:10.1145/363095.363143. CS1 održavanje: Format datuma (veza)
• — (april 1970). Notes on Structured Programming (PDF) (Izveštaj). 70-WSK-03 — preko E.W. Dijkstra Archive. Center for American History, University of Texas at Austin. CS1 održavanje: Format datuma (veza)
• — (1971). A Short Introduction to the Art of Computer Programming. Eindhoven: Technische Hogeschool. OCLC 3474242. EWD316. 
• — (1971). „Hierarchical Ordering of Sequential Processes”. Acta Inform. 1 (2): 115—138. S2CID 31573213. doi:10.1007/bf00289519. 
• — (1972). „The Humble Programmer”. Comm. ACM. 15 (10): 859—866. doi:10.1145/355604.361591 . 
• — (June—July 1974). „Programming as a Discipline of Mathematical Nature”. American Mathematical Monthly. 81 (6): 608—612. JSTOR 2319209. doi:10.2307/2319209. 
• — (1974). „On the role of scientific thought”. E.W. Dijkstra Archive, Center for American History, University of Texas at Austin. EWD447. 
• — (1974). „Self-stabilizing Systems in Spite of Distributed Control”. Comm. ACM. 17 (11): 643—4. S2CID 11101426. doi:10.1145/361179.361202. 
• — (1975). „How do we tell truths that might hurt?”. Selected Writings on Computing: A Personal Perspective. Monographs in Computer Science. Springer (objavljeno 1982). str. 129—131. ISBN 978-0387906522. 
• — (1975). „Craftsman or Scientist”. ACM Pacific 1975. str. 217—223. 
• — (1975). „On the teaching of programming, i. e. on the teaching of thinking”. Language Hierarchies and Interfaces. 1975: 1—10. 
• — (1977). „Programming: From Craft to Scientific Discipline”. International Computing Symposium. 1977: 23—30. 
• — (1978). „On the Interplay between Mathematics and Programming”. Program Construction. Lecture Notes in Computer Science. 69. str. 35—46. ISBN 978-3-540-09251-3. S2CID 26233314. doi:10.1007/BFb0014649. 
• — (1975). „Correctness Concerns And, Among Other Things, Why They Are Resented”. (ACM) Proceedings of the International Conference on Reliable Software. 21–23 April 1975, Los Angeles, California, USA: 546—550. 
• — (1975). „Guarded Commands, Nondeterminacy and Formal Derivation of Programs”. Comm. ACM. 18 (8): 453—7. S2CID 1679242. doi:10.1145/360933.360975. 
• — (1978). „Finding the Correctness Proof of a Concurrent Program”. Program Construction. 1978: 24—34. 
• — (1984). „The threats to computing science”. E.W. Dijkstra Archive, Center for American History, University of Texas at Austin. EWD898. 
• — (1986). „On a Cultural Gap”. The Mathematical Intelligencer. 8 (1): 48—52. S2CID 120847834. doi:10.1007/BF03023921. 
• — (1987). „Mathematicians and Computing Scientists: The Cultural Gap”. Abacus. 4 (4): 26—31. 
• — (1989). „On the Cruelty of Really Teaching Computer Science”. A debate on teaching computing science. Comm. ACM. 32 (12): 1398—1404. S2CID 16961489. doi:10.1145/76380.76381. 
• — (1999). „Computing Science: Achievements and Challenges”. ACM SIGAPP Applied Computing Review. 7 (2): 2—9. S2CID 34430415. doi:10.1145/335527.335528. 
• — (2001). „The End of Computing Science?”. Comm. ACM. 44 (3): 92. S2CID 31142279. doi:10.1145/365181.365217. 
• — (2001). „What led to Notes on Structured Programming”. E.W. Dijkstra Archive, Center for American History, University of Texas at Austin. 

Literatura

• Altisen, Karine; Devismes, Stéphane; Dubois, Swan; Petit, Franck; Raynal, Michel (2019). Introduction to Distributed Self-Stabilizing Algorithms. San Rafael, CA: Morgan & Claypool Publishers. ISBN 9781681735375. 
• Apt, Krzysztof R. (2002). „Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius”. Formal Aspects of Computing. 14 (2): 92—98. Bibcode:2002cs.......10001A. S2CID 12482128. arXiv:cs/0210001 . doi:10.1007/s001650200029. 
• Brinch Hansen, Per (2002). The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls. Springer. ISBN 978-0-387-95401-1. 
• Ben-Ari, M. (2006). Principles of Concurrent and Distributed Programming (2nd izd.). Addison-Wesley. ISBN 978-0-321-31283-9. 
• Broy, M.; Denert, Ernst, ur. (2002). Software Pioneers: Contributions to Software Engineering. Springer. ISBN 978-3-540-43081-0. 
• Chen, Peter P. (2002). „From Goto-less to Structured Programming: The Legacy of Edsger W. Dijkstra”. IEEE Software. 19 (5): 21. S2CID 29320163. doi:10.1109/MS.2002.1032847. 
• Daylight, Edgar G. (2012). The Dawn of Software Engineering: from Turing to Dijkstra. Lonely Scholar. ISBN 9789491386022. 
• Daylight, Edgar G. (2011). „Dijkstra's Rallying Cry for Generalization: The Advent of the Recursive Procedure, Late 1950s–Early 1960s”. The Computer Journal. 54 (11): 1756—72. doi:10.1093/comjnl/bxr002. 
• Dolev, Shlomi (2000). Self-stabilization. MIT Press. ISBN 978-0-262-04178-2. 
• Feijen, W.H.J.; Gries, David, ur. (1990). Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra. Springer. ISBN 978-0-387-97299-2. 
• Istrail, Sorin (2008). „Storytelling About Lighthouses: Criticizing Professor Dijkstra Considered Harmless” (PDF). Conduit. sv. 17 br. 2. Brown University Department of Computer Science. str. 10—17. 
• Istrail, Sorin (2010). „Storytelling About Lighthouses: When Professor Dijkstra Slapped Me in the Quest for Beautiful Code” (PDF). Conduit. sv. 19 br. 1. Brown University Department of Computer Science. str. 10—12. 
• James, Mike (2013). „Edsger Dijkstra – The Poetry of Programming”. I-programmer.info. 
• Lamport, Leslie (jun 2015). „Turing Lecture: The Computer Science of Concurrency: The Early Years”. Comm. ACM. 58 (6): 71—76. S2CID 19164754. doi:10.1145/2771951. CS1 održavanje: Format datuma (veza)
• Laplante, Phillip A. (1996). Great papers in computer science. IEEE Press. ISBN 978-0-7803-1112-1. 
• Laplante, Phillip A. (2008). „Great Papers in Computer Science: A Retrospective” (PDF). Journal of Scientific and Practical Computing. 2 (1): 31—35. CiteSeerX 10.1.1.559.2457 . Arhivirano iz originala (PDF) 2018-05-05. g. 
• Lee, J.A.N. (1991). „Frontiers of Computing: A Tribute to Edsger W. Dijkstra on the Occasion of his 60th Birthday”. Ann. Hist. Comp. 13 (1): 91—96. doi:10.1109/MAHC.1991.10000. 
• Markoff, John (2002). „Edsger Dijkstra, 72, Physicist Who Shaped Computer Era”. The New York Times. 
• Milone, Lorenzo (2009). „E.W. Dijkstra, una vita da informatico [in Italian]” (PDF). Mondo Digitale. 9 (2). 
• O’Regan, Gerard (2013). Giants of Computing: A Compendium of Select, Pivotal Pioneers. Springer. ISBN 978-1-4471-5340-5. 
• Payette, Sandy (2014). „Hopper and Dijkstra: Crisis, Revolution, and the Future of Programming”. IEEE Annals of the History of Computing. 36 (4): 64—73. S2CID 9029390. doi:10.1109/MAHC.2014.54. 
• Shasha, Dennis; Lazere, Cathy (2. 7. 1998). Out of their Minds: The Lives and Discoveries of 15 Great Computer Scientists. Springer. ISBN 978-0-387-98269-4. CS1 održavanje: Format datuma (veza)

Spoljašnje veze

• Dajkstrina biografija Arhivirano na sajtu Wayback Machine (15. mart 2005) (jezik: engleski)
• Arhiva rukopisa Edsgera Dajkstre (jezik: engleski)
• Dajkstrin video intervju (jezik: engleski)
• „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.