| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A layout for the shuffle-exchange network with Θ(N2⧸log N) area
|
Steinberg, David
|
|
1981
|
12 |
2 |
p. 83-88
6 p.
|
artikel
|
| 2 |
An extension of Savitch's theorem to small space bounds
|
Tompa, Martin
|
|
1981
|
12 |
2 |
p. 106-108
3 p.
|
artikel
|
| 3 |
Another look at the degree constrained subgraph problem
|
Shiloach, Yossi
|
|
1981
|
12 |
2 |
p. 89-92
4 p.
|
artikel
|
| 4 |
A user authentication scheme for shared data based on a trap-door one-way function
|
Ingemarsson, Ingemar
|
|
1981
|
12 |
2 |
p. 63-67
5 p.
|
artikel
|
| 5 |
Concurrency in a language employing messages
|
Harland, David M.
|
|
1981
|
12 |
2 |
p. 59-62
4 p.
|
artikel
|
| 6 |
Efficient searching using partial ordering
|
Borodin, A.
|
|
1981
|
12 |
2 |
p. 71-75
5 p.
|
artikel
|
| 7 |
Erratum
|
|
|
1981
|
12 |
2 |
p. 109-
1 p.
|
artikel
|
| 8 |
General methods for ‘all elements’ and ‘all pairs’ problems
|
Overmars, Mark H.
|
|
1981
|
12 |
2 |
p. 99-102
4 p.
|
artikel
|
| 9 |
How many polynomials can be approximated faster than they can be evaluated?
|
Schnorr, C.P.
|
|
1981
|
12 |
2 |
p. 76-78
3 p.
|
artikel
|
| 10 |
Optimal dynamization of decomposable searching problems
|
Mehlhorn, Kurt
|
|
1981
|
12 |
2 |
p. 93-98
6 p.
|
artikel
|
| 11 |
Optimal policy for database backup and recovery
|
Hatzopoulos, M.
|
|
1981
|
12 |
2 |
p. 55-58
4 p.
|
artikel
|
| 12 |
Presburger arithmetic with array segments
|
Jaffar, Joxan
|
|
1981
|
12 |
2 |
p. 79-82
4 p.
|
artikel
|
| 13 |
The morse sequence and iterated morphisms
|
Pansiot, J.J.
|
|
1981
|
12 |
2 |
p. 68-70
3 p.
|
artikel
|
| 14 |
Two-way deterministic finite automata are exponentially more succinct than sweeping automata
|
Micali, Silvio
|
|
1981
|
12 |
2 |
p. 103-105
3 p.
|
artikel
|
Tijdschrift beschrijving