#### Filter Results:

#### Publication Year

1975

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Dijkstra E W. A note on two problems in connexion with graphs. We consider a graph with n vertices, all pairs of which are connected by an edge; each edge is of given positive length. The following two basic problems are solved. Problem 1: construct the tree of minimal total length between the n vertices. (A tree is a graph with one and only one path… (More)

- Edsger W. Dijkstra
- Commun. ACM
- 1975

So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms… (More)

- Edsger W. Dijkstra
- Commun. ACM
- 1983

A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the “critical section” of its cycle.

- Edsger W. Dijkstra
- Texts and Monographs in Computer Science
- 1982

- Edsger W. Dijkstra, Carel S. Scholten
- Inf. Process. Lett.
- 1980

- Edsger W. Dijkstra, Carel S. Scholten
- Texts and Monographs in Computer Science
- 1990

- Edsger W. Dijkstra
- Language Hierarchies and Interfaces
- 1975

So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow non-deterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms… (More)

These notes have the status of "Letters written to myself": I wrote them down because, without doing so, I found myself repeating the same arguments over and over again. When reading what I had written, I was not always too satisfied. For one thing, I felt that they suffered from a marked verbosity. Yet I do not try to condense them (now), firstly because… (More)

- Edsger W. Dijkstra, Leslie Lamport, Alain J. Martin, Carel S. Scholten, Elisabeth F. M. Steffens
- Language Hierarchies and Interfaces
- 1975

As an example of cooperation between sequential processes with very little mutual interference despite frequent manipulations of a large shared data space, a technique is developed which allows nearly all of the activity needed for garbage detection and collection to be performed by an additional processor operating concurrently with the processor devoted… (More)