Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting (2001)

by Rasmus Pagh , Jakob Pagter
Citations:3 - 0 self

Active Bibliography

R-way Branching Programs and the Hamming Distance Problem – Jakob Pagter, Jakob Pagter, Jakob Pagter - 909
2 Binary Decision Diagrams – Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
5 Comparison-Based Time–Space Lower Bounds for Selection – Timothy M. Chan
57 Models of Computation -- Exploring the Power of Computing – John E. Savage
10 Optimal Time-Space Trade-Offs for Sorting – Jakob Pagter, Jakob Pagter, Theis Rauhe, Theis Rauhe - 1998
Time-Space Tradeoffs for Set Operations – Boaz Patt , David Peleg - 1994
28 Time-Space Tradeoff Lower Bounds for Randomized Computation of Decision Problems – Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee - 2000
2 Approximation of Boolean Functions by Combinatorial Rectangles – Martin Sauerhoff - 2000
General Terms Theory – Martin Sauerhoff
8 Communication-space tradeoffs for unrestricted protocols – Paul Beame, Martin Tompa, Peiyuan Yan - 1994
7 A Time-Space Tradeoff for Boolean Matrix Multiplication – Karl Abrahamson
55 A non-linear time lower bound for boolean branching programs – Miklós Ajtai - 1999
1 Some Topics in Parallel Computation and Branching Programs – Rakesh Kumar Sinha, To Offer Degree - 1995
6 Quantum time-space tradeoffs for sorting – Hartmut Klauck - 2003
On Multipartition Communication Complexity (Extended Abstract) – Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
1 On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs – Beate Bollig, Martin Sauerhoff, Ingo Wegener
1 On Uncertainty versus Size in Branching Programs – Stasys Jukna, Stanislav Zak, Stanislav Zák
CHOICE-MEMORY TRADEOFF IN ALLOCATIONS – Noga Alon, Ori Gurel-gurevich, Eyal Lubetzky
6 Pebbling and Proofs of Work – Cynthia Dwork, Moni Naor, Hoeteck Wee