Demo Data from VLDB 2026 / reviewers in the wild / expert
Edsger W. Dijkstra
dblp:d/WEDijkstra
· DBLP profile ↗
22ranked-venue papers
22as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 15 · 15 first-authorDatabases, data management, data science and information retrieval · 7 · 7 first-authorSoftware engineering, systems software and programming languages · 5 · 5 first-authorSystems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Operating systems · 87% Program verification · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Operating systems › resource management › process management
multiprogramming |
0.0 | 1 | 1967 | The structure of the "THE"-multiprogramming system · SOSP 1967 |
Operating systems
system architecture |
0.0 | 1 | 1967 | The structure of the "THE"-multiprogramming system · SOSP 1967 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | EWD1300: The Notational Conventions I Adopted, and WhyabstractAbstract. At a given moment, the concept of polite mathematics emerged, the underlying idea of which is that, even if you have only 60 readers, it pays to spend an hour if by doing so you can save your average reader a minute. By inventing an idealized ‘average reader’, we could translate most of the lofty, human goal of politeness into more or less formal criteria we could apply to our texts. This note is devoted to the resulting notational and stylistic conventions that were adopted as the years went by. We don't want to baffle or puzzle our reader, in particular it should be clear what has to be done to check our argument and it should be possible to do so without pencil and paper. This dictates small, explicit steps. On the other hand it is well known that brevity is the leading characteristic of mathematical elegance, and some fear that this ideal excludes the small, explicit steps, but one of the joys of my professional life has been the discovery that this fear is unfounded, for brevity can be achieved without committing the sin of omission. I should point out that my ideal of crisp clarity is not universally shared. Some consider the puzzles that are created by their omissions as spicy challenges, without which their texts would be boring; others shun clarity lest their work is considered trivial. Edsger W. Dijkstra |
Formal Aspects Comput. | 1 |
| 2001 | Under the spell of Leibniz's dream
Edsger W. Dijkstra |
Inf. Process. Lett. | 1 |
| 1995 | Heuristics for a Calculational Proof
Edsger W. Dijkstra |
Inf. Process. Lett. | 1 |
| 1992 | On the Economy of doing Mathematics
Edsger W. Dijkstra |
MPC | 1 |
| 1990 | Making a Fair Roulette From a Possibly Biased Coin
Edsger W. Dijkstra |
Inf. Process. Lett. | 1 |
| 1987 | A Heuristic Explanation of Batcher's Baffler
Edsger W. Dijkstra |
Sci. Comput. Program. | 1 |
| 1986 | A Simple Fixpoint Argument Without the Restriction to Continuity
Edsger W. Dijkstra, A. J. M. van Gasteren |
Acta Informatica | 1 |
| 1986 | A Belated Proof of Self-Stabilization
Edsger W. Dijkstra |
Distributed Comput. | 1 |
| 1983 | Derivation of a Termination Detection Algorithm for Distributed Computations
Edsger W. Dijkstra, Wim H. J. Feijen, A. J. M. van Gasteren |
Inf. Process. Lett. | 1 |
| 1982 | An Introduction to Three Algorithms for Sorting in Situ
Edsger W. Dijkstra, A. J. M. van Gasteren |
Inf. Process. Lett. | 1 |
| 1982 | Smoothsort, an Alternative for Sorting In Situ
Edsger W. Dijkstra |
Sci. Comput. Program. | 1 |
| 1981 | A Word of Welcome
Edsger W. Dijkstra |
Sci. Comput. Program. | 1 |
| 1980 | Some Beautiful Arguments Using Mathematical Induction
Edsger W. Dijkstra |
Acta Informatica | 1 |
| 1980 | Termination Detection for Diffusing Computations
Edsger W. Dijkstra, Carel S. Scholten |
Inf. Process. Lett. | 1 |
| 1979 | Software Engineering : As It Should Be
Edsger W. Dijkstra |
ICSE | 1 |
| 1978 | Finding the Correctness Proof of a Concurrent Program
Edsger W. Dijkstra |
MFCS | 1 |
| 1976 | The Effective Arrangement of Logical Systems
Edsger W. Dijkstra |
MFCS | 1 |
| 1976 | On a Gauntlet Thrown by David Gries
Edsger W. Dijkstra |
Acta Informatica | 1 |
| 1972 | Information Streams Sharing a Finite Buffer
Edsger W. Dijkstra |
Inf. Process. Lett. | 1 |
| 1971 | Hierarchical Ordering of Sequential Processes
Edsger W. Dijkstra |
Acta Informatica | 1 |
| 1967 | The structure of the "THE"-multiprogramming systemabstractA multiprogramming system is described in which all activities are divided over a number of sequential processes. These sequential processes are placed at various hierarchical levels, in each of which one or more independent abstractions have been implemented. The hierarchical structure proved to be vital for the verification of the logical soundness of the design and the correctness of its implementation. Edsger W. Dijkstra |
SOSP | 1 |
| 1962 | Operating Experience with ALGOL 60abstractThis paper describes the circumstances under which the ALGOL 60 translator of the Mathematical Centre, Amsterdam, has been constructed. It describes its main features, virtues and short-comings. Furthermore, it tells how the translator has shown itself to be an inspiring tool for a varied group of users. Edsger W. Dijkstra |
Comput. J. | 1 |