|
8
|
Optimal Time-Space Trade-Offs for Sorting
– Jakob Pagter, Jakob Pagter, Theis Rauhe, Theis Rauhe
- 1998
|
|
46
|
Models of Computation -- Exploring the Power of Computing
– John E. Savage
|
|
1
|
Some Topics in Parallel Computation and Branching Programs
– Rakesh Kumar Sinha, To Offer Degree
- 1995
|
|
|
Time-Space Tradeoffs for Set Operations
– Boaz Patt , David Peleg
- 1994
|
|
9
|
Complexity Theoretical Results for Randomized Branching Programs
– Martin Sauerhoff
- 1998
|
|
1
|
Comparison-Based Time–Space Lower Bounds for Selection
– Timothy M. Chan
|
|
16
|
An overview of computational complexity
– Stephen A. Cook
- 1983
|
|
2
|
Time-Space Tradeoffs for Back-to-Back FFT Algorithms
– David A. Carlson
- 1983
|
|
52
|
A time-space tradeoff for sorting on a general sequential model of computation
– A. Borodin, S. Cook
- 1982
|
|
1
|
Binary Decision Diagrams
– Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
|
|
5
|
Time-Space Lower Bounds for Undirected and Directed ST-Connectivity on JAG
– Jeff A. Edmonds
- 1993
|
|
|
Time-Space Trade-Offs For Undirected ST-Connectivity on a JAG
– n.n.
|
|
3
|
Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting ∗
– Rasmus Pagh, Jakob Pagter, Copyright C, Rasmus Pagh, Jakob Pagter, Rasmus Pagh, Jakob Pagter
- 2001
|
|
141
|
Computing on Data Streams
– Monika Rauch Henzinger, Prabhakar Raghavan, Sridar Rajagopalan
- 1998
|
|
17
|
Computational geometry -- a survey
– D. T. Lee, Franco P. Preparata
- 1984
|
|
191
|
Semantical considerations on Floyd-Hoare Logic
– Vaughan R. Pratt
- 1976
|
|
19
|
Size Space tradeoffs for Resolution
– Eli Ben-Sasson
- 2002
|
|
11
|
Narrow proofs may be spacious: Separating space and width in resolution
– Jakob Nordström
- 2005
|
|
7
|
An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX
– D. Grigoriev, M. Karpinski, A. C. Yao
- 1995
|
