Machine models and linear time complexity
ACM SIGACT News
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Determinism versus non-determinism for linear time RAMs (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal time-space trade-offs for non-comparison-based sorting
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Determinism versus nondeterminism for linear time RAMs with memory restrictions
Journal of Computer and System Sciences - STOC 1999
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Quantum time-space tradeoffs for sorting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Graph properties checkable in linear time in the number of vertices
Journal of Computer and System Sciences
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |