nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A provably efficient algorithm for dynamic storage allocation
|
Coffman Jr., E.G. |
|
1989 |
38 |
1 |
p. 2-35 34 p. |
artikel |
2 |
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
|
Barrington, David A. |
|
1989 |
38 |
1 |
p. 150-164 15 p. |
artikel |
3 |
Editor's foreword
|
Hartmanis, Juris |
|
1989 |
38 |
1 |
p. 1- 1 p. |
artikel |
4 |
Embedding planar graphs in four pages
|
Yannakakis, Mihalis |
|
1989 |
38 |
1 |
p. 36-67 32 p. |
artikel |
5 |
Making data structures persistent
|
Driscoll, James R. |
|
1989 |
38 |
1 |
p. 86-124 39 p. |
artikel |
6 |
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines
|
Galil, Zvi |
|
1989 |
38 |
1 |
p. 134-149 16 p. |
artikel |
7 |
Optimal parallel selection has complexity O(Log Log N)
|
Ajtai, Miklós |
|
1989 |
38 |
1 |
p. 125-133 9 p. |
artikel |
8 |
The complexity of reasoning about knowledge and time. I. Lower bounds
|
Halpern, Joseph Y. |
|
1989 |
38 |
1 |
p. 195-237 43 p. |
artikel |
9 |
Topologically sweeping an arrangement
|
Edelsbrunner, Herbert |
|
1989 |
38 |
1 |
p. 165-194 30 p. |
artikel |
10 |
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
|
Cai, Jin-Yi |
|
1989 |
38 |
1 |
p. 68-85 18 p. |
artikel |