| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Achievable high scores of ε-moves and running times in DPDA computations
|
Vitányi, Paul M.B.
|
|
1980
|
10 |
2 |
p. 83-86
4 p.
|
article
|
| 2 |
A lower bound for on-line bin packing
|
Liang, Frank M.
|
|
1980
|
10 |
2 |
p. 76-79
4 p.
|
article
|
| 3 |
An improvement in the iterative data flow analysis algorithm
|
Jazayeri, Mehdi
|
|
1980
|
10 |
2 |
p. 108-110
3 p.
|
article
|
| 4 |
An O(log n) algorithm for computing general order-k Fibonacci numbers
|
Wilson, Thomas C.
|
|
1980
|
10 |
2 |
p. 68-75
8 p.
|
article
|
| 5 |
A scheme for a fault-tolerant virtual memory
|
Brandwajn, Alexandre
|
|
1980
|
10 |
2 |
p. 99-103
5 p.
|
article
|
| 6 |
A simplified proof that regular resolution is exponential
|
Ben-Ari, Mordechai
|
|
1980
|
10 |
2 |
p. 96-98
3 p.
|
article
|
| 7 |
Dynamization of decomposable searching problems
|
Van Leeuwen, Jan
|
|
1980
|
10 |
2 |
p. 51-56
6 p.
|
article
|
| 8 |
Encoded pointers — an interesting data-structure for modern sil's
|
Anderson, Bruce
|
|
1980
|
10 |
2 |
p. 47-50
4 p.
|
article
|
| 9 |
Equivalence of free boolean graphs can be decided probabilistically in polynomial time
|
Blum, Manuel
|
|
1980
|
10 |
2 |
p. 80-82
3 p.
|
article
|
| 10 |
Extending the four Russians' bound to general matrix multiplication
|
Santoro, Nicola
|
|
1980
|
10 |
2 |
p. 87-88
2 p.
|
article
|
| 11 |
On the generation of compilers from language definitions
|
Pagan, Frank G.
|
|
1980
|
10 |
2 |
p. 104-107
4 p.
|
article
|
| 12 |
Purging in an equality data base
|
Samet, Hanan
|
|
1980
|
10 |
2 |
p. 89-95
7 p.
|
article
|
| 13 |
Structured programs for turing machines
|
Passy, Solomon
|
|
1980
|
10 |
2 |
p. 63-67
5 p.
|
article
|
| 14 |
The logic-termal equivalence is polynomial-time decidable
|
Sabelfeld, V.K.
|
|
1980
|
10 |
2 |
p. 57-62
6 p.
|
article
|
Journal description