|
52
|
A time-space tradeoff for sorting on a general sequential model of computation
– A. Borodin, S. Cook
- 1982
|
|
24
|
A General Sequential Time-Space Tradeoff for Finding Unique Elements
– Paul Beame
- 1991
|
|
24
|
Near optimal time-space tradeoffs for element distinctness
– A C C Yao
- 1988
|
|
40
|
The recognition problem for the set of perfect squares
– A Cobham
- 1966
|
|
9
|
A time-space tradeoff for matrix multiplication and the discrete Fourier transform on a general sequential random access
– Y Yesha
- 1984
|
|
13
|
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
– M TOMPA
- 1978
|
|
16
|
A time-space tradeoff for element distinctness
– A Borodin, F Fich, F Meyer aud der Heide, E Upfal, A Wigderson
- 1987
|
|
6
|
String-matching cannot be done by a two-head one-way deterministic finite automaton
– M Li, Y Yesha
- 1986
|
|
7
|
Saving Space in Fast String Matching
– Z Galil, J Seiferas
- 1980
|
|
487
|
A fast string searching algorithm
– R S Boyer, J S Moore
- 1977
|
|
12
|
Three one-way heads cannot do string matching
– M Ger'eb-Graus, M Li
- 1990
|
|
4
|
Lower bounds on string-matching
– M Li
- 1984
|
|
28
|
Time-space-optimal string matching
– Z Galil, J Seiferas
- 1983
|
|
546
|
Fast pattern matching in strings
– D E Knuth, J H Morris, V B Pratt
- 1977
|
|
262
|
Relationships between nondeterministic and deterministic tape complexities
– W J Savitch
- 1970
|
|
10
|
Time-Space Tradeoffs for Algebraic Problems on
– K Abrahamson
- 1991
|
|
5
|
Upper bounds for time-space trade-offs in sorting and selection
– G N Frederickson
- 1987
|
|
98
|
Selection and sorting with limited storage
– J I Munro, M Paterson
- 1980
|
|
36
|
Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions
– Miklos Ajtai
- 1998
|
