| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A linear time algorithm for graph partition problems
|
Clark, L.H.
|
|
1992
|
42 |
1 |
p. 19-24
6 p.
|
artikel
|
| 2 |
A lower bound for the nondeterministic space complexity of context-free recognition
|
Alt, Helmut
|
|
1992
|
42 |
1 |
p. 25-27
3 p.
|
artikel
|
| 3 |
A note on approximate linear programming
|
Megiddo, Nimrod
|
|
1992
|
42 |
1 |
p. 53-
1 p.
|
artikel
|
| 4 |
Computing the minimum weight triangulation of a set of linearly ordered points
|
Meijer, Henk
|
|
1992
|
42 |
1 |
p. 35-38
4 p.
|
artikel
|
| 5 |
Detecting cycles through three fixed vertices in a graph
|
Fleischner, Herbert
|
|
1992
|
42 |
1 |
p. 29-33
5 p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
1992
|
42 |
1 |
p. iii-
1 p.
|
artikel
|
| 7 |
Effective use of memory in iterative deepening search
|
Sarkar, U.K.
|
|
1992
|
42 |
1 |
p. 47-52
6 p.
|
artikel
|
| 8 |
On the routing problem in faulty supercubes
|
Sen, Arunabha
|
|
1992
|
42 |
1 |
p. 39-46
8 p.
|
artikel
|
| 9 |
On the structural grammatical inference problem for some classes of context-free grammars
|
Mäkinen, Erkki
|
|
1992
|
42 |
1 |
p. 1-5
5 p.
|
artikel
|
| 10 |
Optimal time bounds for some proximity problems in the plane
|
Aggarwal, Alok
|
|
1992
|
42 |
1 |
p. 55-60
6 p.
|
artikel
|
| 11 |
Towards an understanding of unbounded variables in asynchronous systems
|
Singh, Ambuj K.
|
|
1992
|
42 |
1 |
p. 7-17
11 p.
|
artikel
|
Tijdschrift beschrijving