nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A frame for general divide-and-conquer recurrences
|
Xiaodong, Wang |
|
1996 |
59 |
1 |
p. 45-51 7 p. |
artikel |
2 |
A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem
|
Manku, Gurmeet Singh |
|
1996 |
59 |
1 |
p. 1-7 7 p. |
artikel |
3 |
An
O(¦V¦ ∗ ¦E¦) algorithm for finding immediate multiple-vertex dominators
|
Alstrup, Stephen |
|
1996 |
59 |
1 |
p. 9-11 3 p. |
artikel |
4 |
A simple scheme to construct k-coteries with O(√N) uniform quorum sizes
|
Kuo, Yu-Chen |
|
1996 |
59 |
1 |
p. 31-36 6 p. |
artikel |
5 |
A subexponential exact learning algorithm for DNF using equivalence queries
|
Bshouty, Nader H. |
|
1996 |
59 |
1 |
p. 37-39 3 p. |
artikel |
6 |
Decidability results concerning k-limited ED0L systems
|
Wätjen, Dietmar |
|
1996 |
59 |
1 |
p. 13-17 5 p. |
artikel |
7 |
Editorial Board
|
|
|
1996 |
59 |
1 |
p. ii- 1 p. |
artikel |
8 |
Exact VC-dimension of Boolean monomials
|
Natschläger, Thomas |
|
1996 |
59 |
1 |
p. 19-20 2 p. |
artikel |
9 |
Fast and practical approximate string matching
|
Baeza-Yates, Ricardo A. |
|
1996 |
59 |
1 |
p. 21-27 7 p. |
artikel |
10 |
Maintaining a topological order under edge insertions
|
Marchetti-Spaccamela, Alberto |
|
1996 |
59 |
1 |
p. 53-58 6 p. |
artikel |
11 |
On the number of ANDs versus the number of ORs in monotone Boolean circuits
|
Zwick, Uri |
|
1996 |
59 |
1 |
p. 29-30 2 p. |
artikel |
12 |
On the number of small cuts in a graph
|
Henzinger, Monika |
|
1996 |
59 |
1 |
p. 41-44 4 p. |
artikel |