nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A distributed algorithm for distributed termination
|
Hazari, Cyrus |
|
1987 |
24 |
5 |
p. 293-297 5 p. |
artikel |
2 |
A note on undefined expression values in programming logics
|
Tennent, R.D. |
|
1987 |
24 |
5 |
p. 331-333 3 p. |
artikel |
3 |
Automating the semantic component
|
Koch, Gregers |
|
1987 |
24 |
5 |
p. 299-305 7 p. |
artikel |
4 |
Computing the number of mergings with constraints
|
Atkinson, M.D. |
|
1987 |
24 |
5 |
p. 289-292 4 p. |
artikel |
5 |
Improved update/query algorithms for the interval valuation problem
|
Hirschberg, D.S. |
|
1987 |
24 |
5 |
p. 307-310 4 p. |
artikel |
6 |
On the costs of self-stabilization
|
Chang, Ernest J.H. |
|
1987 |
24 |
5 |
p. 311-316 6 p. |
artikel |
7 |
Remarks on string-matching and one-way multihead automata
|
Chrobak, Marek |
|
1987 |
24 |
5 |
p. 325-329 5 p. |
artikel |
8 |
Shortest path between two simple polygons
|
Asano, Takao |
|
1987 |
24 |
5 |
p. 285-288 4 p. |
artikel |
9 |
The automated solution of logic puzzles
|
Valentine, Mark |
|
1987 |
24 |
5 |
p. 317-324 8 p. |
artikel |
10 |
Time- and space-optimal contour computation for a set of rectangles
|
Widmayer, Peter |
|
1987 |
24 |
5 |
p. 335-338 4 p. |
artikel |
11 |
Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
|
Dillencourt, Michael B. |
|
1987 |
24 |
5 |
p. 339-342 4 p. |
artikel |
12 |
Using string-rewriting for solving the word problem for finitely presented groups
|
Madlener, Klaus |
|
1987 |
24 |
5 |
p. 281-284 4 p. |
artikel |
13 |
Variable abstraction in O(n log n) space
|
Kennaway, J.R. |
|
1987 |
24 |
5 |
p. 343-349 7 p. |
artikel |