A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Lower bounds for set intersection queries
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Lower bounds for dynamic algebraic problems
Information and Computation
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Tight bounds for the partial-sums problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for dynamic connectivity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A model of summary data and its applications in statistical databases
SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
On dynamic bit-probe complexity
Theoretical Computer Science
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Lower bounds for dynamic algebraic problems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Observations concerning the complexity of a class of on-line algebraic problems
IEEE Transactions on Computers
On dynamic bit-probe complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved range searching lower bounds
Proceedings of the twenty-eighth annual symposium on Computational geometry
Incrementally maintaining run-length encoded attributes in column stores
Proceedings of the 16th International Database Engineering & Applications Sysmposium
| Hi-index | 0.01 |