Lower Bounds for Accessing Information on Pure Pointer Machines (original) (raw)
Related papers
The Communication Complexity of Pointer Chasing
Journal of Computer and System Sciences, 2001
Journal of the ACM, 1992
Pointers versus Arithmetic in PRAMs
Journal of Computer and System Sciences, 1996
Some separation results between classes of pointer algorithms
2006
A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys
2012
A time-space tradeoff for sorting on non-oblivious machines
Journal of Computer and System Sciences, 1981
On the Complexity of Search Queries
Fundamentals of Information Systems, 1999
Information Retrieval : Computation Control for Pointer Address
2012
On data structures and asymmetric communication complexity
1995
Lower bounds for restricted-use objects
2012
Constant-Time Retrieval with O(log m) Extra Bits
2019
Tables should be sorted (on random access machines)
Lecture Notes in Computer Science, 1995
Upper and Lower Bounds for Deterministic Approximate Objects
2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), 2021
Quantum bounded query complexity
1999
Space Complexity Vs. Query Complexity
computational complexity, 2008
A Framework for Dynamizing Succinct Data Structures
2007
Succinct indexes for strings, binary relations and multi-labeled trees
Proceedings of the eighteenth …, 2007
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
Lecture Notes in Computer Science
Lower bounds for union-split-find related problems on random access machines
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, 1994
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
Combinatorial Pattern Matching, 2011
The bit probe complexity measure revisited
Lecture Notes in Computer Science, 1993
A Tight Lower Bound for Index Erasure
2020
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
Springer eBooks, 2013
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
SIAM Journal on Computing
A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons
Nordic Journal of Computing, 2006
Query complexity of generalized Simon's problem
Information and Computation
Efficient searching using partial ordering
Information Processing Letters, 1981
Succinct Dynamic Ordered Sets with Random Access
ArXiv, 2020
Exact time bounds for computing boolean functions on PRAMs without simultaneous writes
Proceedings of the second annual ACM symposium on Parallel algorithms and architectures - SPAA '90, 1990
One, two, three . . . infinity: lower bounds for parallel computation
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85, 1985
PRACTICAL IMPLEMENTATION OF RANK AND SELECT QUERIES
The invariant problem for binary string structures and the parallel complexity theory of queries
Journal of Computer and System Sciences, 1992