nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A time-luck tradeoff in relativized cryptography
|
Brassard, Gilles |
|
1981 |
22 |
3 |
p. 280-311 32 p. |
artikel |
2 |
A time-space tradeoff for sorting on non-oblivious machines
|
Borodin, Allan |
|
1981 |
22 |
3 |
p. 351-364 14 p. |
artikel |
3 |
Author index for volume 22
|
|
|
1981 |
22 |
3 |
p. 471- 1 p. |
artikel |
4 |
Computational Complexity of Algebraic Functions
|
Pippenger, Nicholas |
|
1981 |
22 |
3 |
p. 454-470 17 p. |
artikel |
5 |
Dedicated to our colleague and friend Michael Machtey
|
Meyer, Albert R. |
|
1981 |
22 |
3 |
p. 262-264 3 p. |
artikel |
6 |
Division in idealized unit cost RAMs
|
Simon, Janos |
|
1981 |
22 |
3 |
p. 421-441 21 p. |
artikel |
7 |
Editor's foreword
|
Rao Kosaraju, S. |
|
1981 |
22 |
3 |
p. 261- 1 p. |
artikel |
8 |
Explicit constructions of linear-sized superconcentrators
|
Gabber, Ofer |
|
1981 |
22 |
3 |
p. 407-420 14 p. |
artikel |
9 |
New hash functions and their use in authentication and set equality
|
Wegman, Mark N. |
|
1981 |
22 |
3 |
p. 265-279 15 p. |
artikel |
10 |
Number of quantifiers is better than number of tape cells
|
Immerman, Neil |
|
1981 |
22 |
3 |
p. 384-406 23 p. |
artikel |
11 |
On time versus space II
|
Paul, W. |
|
1981 |
22 |
3 |
p. 312-327 16 p. |
artikel |
12 |
On uniform circuit complexity
|
Ruzzo, Walter L. |
|
1981 |
22 |
3 |
p. 365-383 19 p. |
artikel |
13 |
Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems
|
Machtey, Michael |
|
1981 |
22 |
3 |
p. 442-453 12 p. |
artikel |
14 |
Semantics of probabilistic programs
|
Kozen, Dexter |
|
1981 |
22 |
3 |
p. 328-350 23 p. |
artikel |