Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Information Processing Letters
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
SIAM Journal on Computing
On the upper bound of the size of the r-cover-free families
Journal of Combinatorial Theory Series A
Journal of Computer and System Sciences
Journal of Combinatorial Theory Series A
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Dictionary look-up with one error
Journal of Algorithms
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
The Complexity of Some Simple Retrieval Problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM (JACM)
The Bit Probe Complexity Measure Revisited
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Membership in Constant Time and Minimum Space
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
A linear lower bound on index size for text retrieval
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Storing information with extractors
Information Processing Letters
Constructing set systems with prescribed intersection sizes
Journal of Algorithms
Lower Bounds in the Quantum Cell Probe Model
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Explicit Deterministic Constructions for Membership in the Bitprobe Model
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A linear lower bound on index size for text retrieval
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Deterministic load balancing and dictionaries in the parallel disk model
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The cell probe complexity of succinct data structures
Theoretical Computer Science
The cell probe complexity of succinct data structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the cell probe complexity of dynamic membership
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The Gelfand widths of lp-balls for 0
Journal of Complexity
Data structures for storing small sets in the bitprobe model
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
| Hi-index | 0.00 |