The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Efficient Storage and Retrieval by Content and Address of Static Files
Journal of the ACM (JACM)
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
The Complexity of Some Simple Retrieval Problems
Journal of the ACM (JACM)
Optimal Arrangement of Keys in a Hash Table
Journal of the ACM (JACM)
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Implicit data structures (Preliminary Draft)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Storing a sparse table
Graphs and Hypergraphs
Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On aspects of university and performance for closed hashing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Not all keys can be hashed in constant time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Journal of the ACM (JACM)
STOC '93 Proceedings of the twenty-fifth 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
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Asynchronous shared memory search structures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Worst-case and amortised optimality in union-find (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Tighter bounds for nearest neighbor search and related problems in the cell probe model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A linear lower bound on index size for text retrieval
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Worst case constant time priority queue
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Storing information with extractors
Information Processing Letters
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing
A New Trade-Off for Deterministic Dictionaries
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Space Time Tradeoffs for Graph Properties
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Nordic Journal of Computing
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
Cell-probe lower bounds for the partial match problem
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
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
Batch codes and their applications
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lower bounds for dynamic connectivity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Cell-probe lower bounds for the partial match problem
Journal of Computer and System Sciences - Special issue: STOC 2003
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Worst case constant time priority queue
Journal of Systems and Software
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
ACM Transactions on Algorithms (TALG)
Compressed indexes for dynamic text collections
ACM Transactions on Algorithms (TALG)
Tight bounds for dynamic convex hull queries (again)
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Increasing the Output Length of Zero-Error Dispersers
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Orthogonal range searching in linear and almost-linear space
Computational Geometry: Theory and Applications
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The problem of space invariance for sequential machines
Information and Computation
Integer representation and counting in the bit probe model
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Proceedings of the forty-second ACM symposium on Theory of computing
Similarity search and locality sensitive hashing using ternary content addressable memories
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
ACM SIGACT News
ACM Transactions on Computation Theory (TOCT)
On the cell probe complexity of dynamic membership
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Cell probe lower bounds and approximations for range mode
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching
SIAM Journal on Computing
Lower bounds for online integer multiplication and convolution in the cell-probe model
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximate top-k queries in sensor networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Predecessor queries in constant time?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Low-contention data structures
Journal of Parallel and Distributed Computing
The cell probe complexity of dynamic range counting
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Dynamic Indexability and the Optimality of B-Trees
Journal of the ACM (JACM)
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
SIAM Journal on Computing
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |