nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An Explanation of Splaying
|
Subramanian, Ashok |
|
1996 |
20 |
3 |
p. 512-525 14 p. |
artikel |
2 |
Author Index for Volume 20
|
|
|
1996 |
20 |
3 |
p. 633- 1 p. |
artikel |
3 |
α-Connectivity: A Gradually Nonparallel Graph Problem
|
Iwama, Kazuo |
|
1996 |
20 |
3 |
p. 526-544 19 p. |
artikel |
4 |
Cumulative Index for Volumes 1–20
|
|
|
1996 |
20 |
3 |
p. 634-660 27 p. |
artikel |
5 |
Derandomization in Computational Geometry
|
Matoušek, Jiřı́ |
|
1996 |
20 |
3 |
p. 545-580 36 p. |
artikel |
6 |
Efficient Algorithms for Finding a Core of a Tree with a Specified Length
|
Peng, Shietung |
|
1996 |
20 |
3 |
p. 445-458 14 p. |
artikel |
7 |
Efficient Preprocessing of Simple Binary Pattern Forests
|
Thorup, Mikkel |
|
1996 |
20 |
3 |
p. 602-612 11 p. |
artikel |
8 |
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
|
Chen, Danny Z. |
|
1996 |
20 |
3 |
p. 459-478 20 p. |
artikel |
9 |
Papers to Appear in Forthcoming Issues
|
|
|
1996 |
20 |
3 |
p. 633- 1 p. |
artikel |
10 |
Routing Problems on the Mesh of Buses
|
Iwama, Kazuo |
|
1996 |
20 |
3 |
p. 613-631 19 p. |
artikel |
11 |
Selection in Monotone Matrices and Computingkth Nearest Neighbors
|
Agarwal, Pankaj K |
|
1996 |
20 |
3 |
p. 581-601 21 p. |
artikel |
12 |
Traversing Layered Graphs Using the Work Function Algorithm
|
Burley, William R. |
|
1996 |
20 |
3 |
p. 479-511 33 p. |
artikel |