nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Data Structure for Dynamically Maintaining Rooted Trees
|
Frederickson, Greg N. |
|
1997 |
24 |
1 |
p. 37-65 29 p. |
artikel |
2 |
A Lower Bound on Wait-Free Counting
|
Moran, Shlomo |
|
1997 |
24 |
1 |
p. 1-19 19 p. |
artikel |
3 |
An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n 2Messages
|
Haldar, S. |
|
1997 |
24 |
1 |
p. 20-36 17 p. |
artikel |
4 |
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
|
Henzinger, Monika Rauch |
|
1997 |
24 |
1 |
p. 194-220 27 p. |
artikel |
5 |
Choosing Subsets with Maximum Weighted Average
|
Eppstein, David |
|
1997 |
24 |
1 |
p. 177-193 17 p. |
artikel |
6 |
Computing with Snakes in Directed Networks of Automata
|
Even, Shimon |
|
1997 |
24 |
1 |
p. 158-170 13 p. |
artikel |
7 |
Counting Minimum Weight Spanning Trees
|
Broder, Andrei Z. |
|
1997 |
24 |
1 |
p. 171-176 6 p. |
artikel |
8 |
Domino Treewidth
|
Bodlaender, Hans L. |
|
1997 |
24 |
1 |
p. 94-123 30 p. |
artikel |
9 |
Edge Weight Reduction Problems in Directed Acyclic Graphs
|
Hambrusch, Susanne E. |
|
1997 |
24 |
1 |
p. 66-93 28 p. |
artikel |
10 |
Page Migration Algorithms Using Work Functions
|
Chrobak, Marek |
|
1997 |
24 |
1 |
p. 124-157 34 p. |
artikel |
11 |
Papers to Appear in Forthcoming Issues
|
|
|
1997 |
24 |
1 |
p. 221- 1 p. |
artikel |