A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
| Title: | A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation |
|---|---|
| Authors: | Borodin, A.; Cook, S. |
| Source: | Logic, Automata, and Computational Complexity. :245-260 |
| Availability: | http://dl.acm.org/doi/10.1145/3588287.3588302 |
| Database: | ACM Full-Text Collection |