55

A timespace tradeoff for sorting on a general sequential model of computation
– A. Borodin, S. Cook
 1982

27

A General Sequential TimeSpace Tradeoff for Finding Unique Elements
– Paul Beame
 1991

25

Nearoptimal timespace tradeoff for element distinctness
– A C Yao
 1988

42

The recognition problem for the set of perfect squares
– A Cobham
 1966

10

Timespace tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential randomaccess computer
– Y Yesha
 1984

16

Timespace tradeoffs for computing functions, using connectivity properties of their circuits
– Martin Tompa
 1978

17

A timespace tradeoff for element distinctness
– A Borodin, F E Fich, F Meyer auf der Heide, E Upfal, A Wigderson
 1987

4

Lower bounds on stringmatching
– M Li
 1984

12

k oneway heads cannot do string matching
– T Jiang, M Li
 1993

8

Saving space in fast string matching
– Z Galil, J Seiferas
 1980

28

Timespaceoptimal string matching
– Z Galil, J Seiferas
 1983

629

Fast pattern matching in strings
– D E Knuth, J Morris, V R Pratt
 1977

574

A fast string searching algorithm
– R S Boyer, J S Moore
 1977

9

Stringmatching cannot be done by a twohead oneway deterministic finite automaton
– M Li, Y Yesha
 1986

316

Relationships between nondeterministic and deterministic tape complexities
– W J Savitch
 1970

103

Multiparty protocols, pseudorandom generators for logspace, and timespace tradeoffs
– L Babai, N Nisan, M Szegedy
 1992

5

A sublinear space, polynomial time algorithm for directed stconnectivity on the JAG model. Manuscript
– C K Poon

13

Space Bounds for Graph Connectivity Problems on Nodenamed JAGs and Nodeordered JAGs
– C K POON
 1993

19

A Sublinear Space, Polynomial Time Algorithm for Directed st Connectivity
– Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
 1992
