A time-space tradeoff for element distinctness
SIAM Journal on Computing
Upper bounds for time-space trade-offs in sorting and selection
Journal of Computer and System Sciences
Two time-space tradeoffs for element distinctness
Theoretical Computer Science
The input/output complexity of sorting and related problems
Communications of the ACM
A general sequential time-space tradeoff for finding unique elements
SIAM Journal on Computing
The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
Near-Optimal Time-Space Tradeoff for Element Distinctness
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Determinism versus non-determinism for linear time RAMs (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures
External memory algorithms
On showing lower bounds for external-memory computational geometry problems
External memory algorithms
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Optimal Time-Space Trade-Offs for Sorting
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
New coding techniques for improved bandwidth utilization
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory model time-space tradeoffs. Using this technique we show strong I/O-space product lower bounds for Sorting and Element Distinctness. We also develop new space efficient external memory Sorting algorithms.