Search the dblp DataBase
Edsger W. Dijkstra :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Edsger W. Dijkstra , Leslie Lamport , Alain J. Martin , Carel S. Scholten , Elisabeth F. M. Steffens On-the-Fly Garbage Collection: An Exercise in Cooperation. [Citation Graph (10, 0)][DBLP ] Commun. ACM, 1978, v:21, n:11, pp:966-975 [Journal ] Edsger W. Dijkstra The Structure of "THE"-Multiprogramming System. [Citation Graph (7, 0)][DBLP ] Commun. ACM, 1968, v:11, n:5, pp:341-346 [Journal ] Edsger W. Dijkstra Guarded Commands, Nondeterminacy and Formal Derivation of Programs. [Citation Graph (7, 0)][DBLP ] Commun. ACM, 1975, v:18, n:8, pp:453-457 [Journal ] Edsger W. Dijkstra , Carel S. Scholten Termination Detection for Diffusing Computations. [Citation Graph (6, 0)][DBLP ] Inf. Process. Lett., 1980, v:11, n:1, pp:1-4 [Journal ] Edsger W. Dijkstra Hierarchical Ordering of Sequential Processes [Citation Graph (3, 0)][DBLP ] Acta Inf., 1971, v:1, n:, pp:115-138 [Journal ] Edsger W. Dijkstra , W. H. J. Feijen , A. J. M. van Gasteren Derivation of a Termination Detection Algorithm for Distributed Computations. [Citation Graph (2, 0)][DBLP ] Inf. Process. Lett., 1983, v:16, n:5, pp:217-219 [Journal ] Edsger W. Dijkstra Smoothsort, an Alternative for Sorting In Situ. [Citation Graph (1, 0)][DBLP ] Sci. Comput. Program., 1982, v:1, n:3, pp:223-233 [Journal ] Edsger W. Dijkstra On the teaching of programming, i. e. on the teaching of thinking. [Citation Graph (0, 0)][DBLP ] Language Hierarchies and Interfaces, 1975, pp:1-10 [Conf ] Edsger W. Dijkstra Guarded commands, non-determinancy and a calculus for the derivation of programs. [Citation Graph (0, 0)][DBLP ] Language Hierarchies and Interfaces, 1975, pp:111-124 [Conf ] Edsger W. Dijkstra A time-wise hierarchy imposed upon the use of a two-level store. [Citation Graph (0, 0)][DBLP ] Language Hierarchies and Interfaces, 1975, pp:345-357 [Conf ] Edsger W. Dijkstra , Leslie Lamport , Alain J. Martin , Carel S. Scholten , Elisabeth F. M. Steffens On-the-fly garbage collection: an exercise in cooperation. [Citation Graph (0, 0)][DBLP ] Language Hierarchies and Interfaces, 1975, pp:43-56 [Conf ] Edsger W. Dijkstra On the transitive closure of a wellfounded relation. [Citation Graph (0, 0)][DBLP ] The School of Niklaus Wirth, 2000, pp:31-40 [Conf ] Edsger W. Dijkstra Formal Techniques and Sizeable Programs. [Citation Graph (0, 0)][DBLP ] ECI, 1976, pp:225-235 [Conf ] Edsger W. Dijkstra Software Engineering : As It Should Be. [Citation Graph (0, 0)][DBLP ] ICSE, 1979, pp:442-448 [Conf ] Edsger W. Dijkstra Programming: From Craft to Scientific Discipline. [Citation Graph (0, 0)][DBLP ] International Computing Symposium, 1977, pp:23-30 [Conf ] Edsger W. Dijkstra Some Meditations on Advanced Programming. [Citation Graph (0, 0)][DBLP ] IFIP Congress, 1962, pp:535-538 [Conf ] Edsger W. Dijkstra The Effective Arrangement of Logical Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1976, pp:39-51 [Conf ] Edsger W. Dijkstra Finding the Correctness Proof of a Concurrent Program. [Citation Graph (0, 0)][DBLP ] MFCS, 1978, pp:31-38 [Conf ] Edsger W. Dijkstra On the Economy of doing Mathematics. [Citation Graph (0, 0)][DBLP ] MPC, 1992, pp:2-10 [Conf ] Edsger W. Dijkstra Fibonacci and the greatest common divisor. [Citation Graph (0, 0)][DBLP ] NATO ASI DPD, 1996, pp:7-10 [Conf ] Edsger W. Dijkstra The balance and the coins. [Citation Graph (0, 0)][DBLP ] NATO ASI DPD, 1996, pp:11-13 [Conf ] Edsger W. Dijkstra Bulterman's theorem on shortest trees. [Citation Graph (0, 0)][DBLP ] NATO ASI DPD, 1996, pp:15-16 [Conf ] Edsger W. Dijkstra A prime is in at most 1 way the sum of 2 squares. [Citation Graph (0, 0)][DBLP ] NATO ASI DPD, 1996, pp:17-20 [Conf ] Edsger W. Dijkstra A bagatelle on Euclid's algorithm. [Citation Graph (0, 0)][DBLP ] NATO ASI DPD, 1996, pp:21-23 [Conf ] Edsger W. Dijkstra On two equations that have the same extreme solution. [Citation Graph (0, 0)][DBLP ] NATO ASI DPD, 1996, pp:25-26 [Conf ] Edsger W. Dijkstra An alternative of the ETAC to EWD1163. [Citation Graph (0, 0)][DBLP ] NATO ASI DPD, 1996, pp:27-28 [Conf ] Edsger W. Dijkstra The argument about the arithmetic mean and the geometric mean, heuristics included. [Citation Graph (0, 0)][DBLP ] NATO ASI DPD, 1996, pp:29-32 [Conf ] Edsger W. Dijkstra Craftsman or Scientist. [Citation Graph (0, 0)][DBLP ] ACM Pacific, 1975, pp:217-223 [Conf ] Edsger W. Dijkstra A More Formal Treatment of a Less Simple Example. [Citation Graph (0, 0)][DBLP ] Program Construction, 1978, pp:2-20 [Conf ] Edsger W. Dijkstra Stationary Behaviour of Some Ternary Networks. [Citation Graph (0, 0)][DBLP ] Program Construction, 1978, pp:21-23 [Conf ] Edsger W. Dijkstra Finding the Correctness Proof of a Concurrent Program. [Citation Graph (0, 0)][DBLP ] Program Construction, 1978, pp:24-34 [Conf ] Edsger W. Dijkstra On the Interplay between Mathematics and Programming. [Citation Graph (0, 0)][DBLP ] Program Construction, 1978, pp:35-46 [Conf ] Edsger W. Dijkstra A Theorem about Odd Powers of Odd Integers. [Citation Graph (0, 0)][DBLP ] Program Construction, 1978, pp:47-48 [Conf ] Edsger W. Dijkstra In Honour of Fibonacci. [Citation Graph (0, 0)][DBLP ] Program Construction, 1978, pp:49-50 [Conf ] Edsger W. Dijkstra On the Foolishness of "Natural Language Programming". [Citation Graph (0, 0)][DBLP ] Program Construction, 1978, pp:51-53 [Conf ] Edsger W. Dijkstra Program Inversion. [Citation Graph (0, 0)][DBLP ] Program Construction, 1978, pp:54-57 [Conf ] Edsger W. Dijkstra On a Gauntlet Thrown by David Gries. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1976, v:6, n:, pp:357-359 [Journal ] Edsger W. Dijkstra Some Beautiful Arguments Using Mathematical Induction. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1980, v:13, n:, pp:1-8 [Journal ] Edsger W. Dijkstra , A. J. M. van Gasteren A Simple Fixpoint Argument Without the Restriction to Continuity. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1986, v:23, n:1, pp:1-7 [Journal ] Edsger W. Dijkstra On Binary Operators and Their Derived Relations. [Citation Graph (0, 0)][DBLP ] BIT, 1988, v:28, n:3, pp:378-382 [Journal ] Edsger W. Dijkstra The end of computing science? [Citation Graph (0, 0)][DBLP ] Commun. ACM, 2001, v:44, n:3, pp:92- [Journal ] Edsger W. Dijkstra Letter to the editor: defense of ALGOL 60. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1961, v:4, n:11, pp:502-503 [Journal ] Edsger W. Dijkstra Some comments on the aims of MIRFAC. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1964, v:7, n:3, pp:190- [Journal ] Edsger W. Dijkstra Solution of a problem in concurrent programming control. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1965, v:8, n:9, pp:569- [Journal ] Edsger W. Dijkstra Letters to the editor: go to statement considered harmful. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1968, v:11, n:3, pp:147-148 [Journal ] Edsger W. Dijkstra The Humble Programmer. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1972, v:15, n:10, pp:859-866 [Journal ] Edsger W. Dijkstra Self-stabilizing Systems in Spite of Distributed Control. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1974, v:17, n:11, pp:643-644 [Journal ] Edsger W. Dijkstra Solutions of a Problem in Concurrent Programming Control (Reprint). [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1983, v:26, n:1, pp:21-22 [Journal ] Edsger W. Dijkstra The Structure of "THE"-Multiprogramming System (Reprint). [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1983, v:26, n:1, pp:49-52 [Journal ] Edsger W. Dijkstra , W. Heise , Alan J. Perlis , Klaus Samelson ALGOL Sub-Committee Report - Extensions. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1959, v:2, n:9, pp:24- [Journal ] John R. Rice , Edsger W. Dijkstra Letters to the editor: The go to statement reconsidered. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1968, v:11, n:8, pp:538- [Journal ] Edsger W. Dijkstra A Belated Proof of Self-Stabilization. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 1986, v:1, n:1, pp:5-6 [Journal ] Edsger W. Dijkstra EWD1300: The Notational Conventions I Adopted, and Why. [Citation Graph (0, 0)][DBLP ] Formal Asp. Comput., 2002, v:14, n:2, pp:99-107 [Journal ] Edsger W. Dijkstra Under the spell of Leibniz's dream. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:2-4, pp:53-61 [Journal ] Edsger W. Dijkstra Information Streams Sharing a Finite Buffer. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1972, v:1, n:5, pp:179-180 [Journal ] Edsger W. Dijkstra Making a Fair Roulette From a Possibly Biased Coin. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:36, n:4, pp:193- [Journal ] Edsger W. Dijkstra Heuristics for a Calculational Proof. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:53, n:3, pp:141-143 [Journal ] Edsger W. Dijkstra , A. J. M. van Gasteren An Introduction to Three Algorithms for Sorting in Situ. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:3, pp:129-134 [Journal ] Edsger W. Dijkstra The fruits of misunderstanding. [Citation Graph (0, 0)][DBLP ] Elektronische Rechenanlagen, 1983, v:25, n:6, pp:10-13 [Journal ] Edsger W. Dijkstra A Word of Welcome. [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 1981, v:1, n:1-2, pp:3-4 [Journal ] Edsger W. Dijkstra A Heuristic Explanation of Batcher's Baffler. [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 1987, v:9, n:3, pp:213-220 [Journal ] Edsger W. Dijkstra My recollections of operating system design. [Citation Graph (0, 0)][DBLP ] Operating Systems Review, 2005, v:39, n:2, pp:4-40 [Journal ] Coenraad Bron , Edsger W. Dijkstra A better way to combine efficient string length encoding and zero-termination. [Citation Graph (0, 0)][DBLP ] SIGPLAN Notices, 1989, v:24, n:6, pp:11-19 [Journal ] Edsger W. Dijkstra How do we tell truths that might hurt? [Citation Graph (0, 0)][DBLP ] SIGPLAN Notices, 1982, v:17, n:5, pp:13-15 [Journal ] Edsger W. Dijkstra , W. H. J. Feijen The Linear Search Revisited. [Citation Graph (0, 0)][DBLP ] Structured Programming, 1989, v:10, n:1, pp:5-9 [Journal ] Search in 0.005secs, Finished in 0.009secs