Journal of Algorithms
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing
Logarithmic Lower Bounds in the Cell-Probe Model
SIAM Journal on Computing
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Changing base without losing space
Proceedings of the forty-second ACM symposium on Theory of computing
Towards polynomial lower bounds for dynamic problems
Proceedings of the forty-second ACM symposium on Theory of computing
Cell-probe lower bounds for succinct partial sums
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
The cell probe complexity of dynamic range counting
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
A New Infinity of Distance Oracles for Sparse Graphs
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |