| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A constant update time finger search tree
|
Dietz, Paul F
|
|
1994
|
52 |
3 |
p. 147-154
8 p.
|
artikel
|
| 2 |
Analysis of a list-update strategy
|
Pedrotti, A.
|
|
1994
|
52 |
3 |
p. 115-121
7 p.
|
artikel
|
| 3 |
A note on the Horton-Strahler number for random trees
|
Devroye, Luc
|
|
1994
|
52 |
3 |
p. 155-159
5 p.
|
artikel
|
| 4 |
Approximate map labeling is in Ω (n log n)
|
Wagner, Frank
|
|
1994
|
52 |
3 |
p. 161-165
5 p.
|
artikel
|
| 5 |
Average-case scalable on-line algorithms for fault replacement
|
Pruhs, Kirk R.
|
|
1994
|
52 |
3 |
p. 131-136
6 p.
|
artikel
|
| 6 |
Constructor equivalent term rewriting systems are strongly sequential: a direct proof
|
Durand, Irène
|
|
1994
|
52 |
3 |
p. 137-145
9 p.
|
artikel
|
| 7 |
On the feedback vertex set problem in permutation graphs
|
Daniel Liang, Y.
|
|
1994
|
52 |
3 |
p. 123-129
7 p.
|
artikel
|
| 8 |
On the learnability of monotone kμ-DNF formulae under product distributions * * Work supported by the ESPRIT II Basic Research Action Program of the European Community under contract No. 7141 “Algorithms and Complexity II” and by the Italian MURST 40% project “Algoritmi, Modelli di Calcolo e Struture Informative”. A preliminary version of this paper appears in Proc. IV Italian Conference on Theoretical Computer Science, 1992.
|
Flammini, Michele
|
|
1994
|
52 |
3 |
p. 167-173
7 p.
|
artikel
|
Tijdschrift beschrijving