The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Journal of the ACM (JACM)
A data structure for manipulating priority queues
Communications of the ACM
A sorting problem and its complexity
Communications of the ACM
Time-Space Trade-Offs in a Pebble Game
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Time and Space Bounds for Selection Problems
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Three studies on computational problems
Three studies on computational problems
| Hi-index | 0.00 |
We introduce a model of programs for comparison-based problems. This model gives a measure of space usage and is “uniform”. We first obtain upper and lower bounds on the selection problems which demonstrate the tradeoffs between time and space. We next introduce the class of first order problems and characterize them semantically. A surprisingly simple classification of first order problems into three complexity classes is shown. Finally we extend the first order problems to the weak second order problems and show that these can be solved in polynomial time by programs in our model augmented with push-down stores.