The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimal Arrangement of Keys in a Hash Table
Journal of the ACM (JACM)
The Analysis of Hashing Techniques That Exhibit k-ary Clustering
Journal of the ACM (JACM)
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
Hashing practice: analysis of hashing and universal hashing
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
Journal of the ACM (JACM)
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Parallel randomized load balancing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient Hardware Hashing Functions for High Performance Computers
IEEE Transactions on Computers
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Techniques for collision resolution in hash tables with open addressing
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Laws of large numbers and tail inequalities for random tries and PATRICIA trees
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries
IEEE Transactions on Knowledge and Data Engineering
Performance of Shared Memory in a Parallel Computer
IEEE Transactions on Parallel and Distributed Systems
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Simplified Witness Tree Arguments
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Cuckoo hashing: further analysis
Information Processing Letters
Reducing Network Congestion and Blocking Probability through Balanced Allocation
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing
Job shop scheduling with unit processing times
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Randomization does not reduce the average delay in parallel packet switches
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Structure and complexity of extreme Nash equilibria
Theoretical Computer Science - Game theory meets theoretical computer science
Partial and approximate symmetry detection for 3D geometry
ACM SIGGRAPH 2006 Papers
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
On the structure and complexity of worst-case equilibria
Theoretical Computer Science
Job Shop Scheduling with Unit Processing Times
Mathematics of Operations Research
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer
IEEE Transactions on Computers
Balls and bins with structure: balanced allocations on hypergraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dependent link padding algorithms for low latency anonymity systems
Proceedings of the 15th ACM conference on Computer and communications security
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the use of hash tables in real-time applications
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Divide and discriminate: algorithm for deterministic and fast hash lookups
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Algorithms and theory of computation handbook
Tight bounds for parallel randomized load balancing: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the expected longest length probe sequence for hashing with separate chaining
Journal of Discrete Algorithms
On the structure and complexity of worst-case equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Hash tables with finite buckets are less resistant to deletions
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Simpler Approach to Matrix Completion
The Journal of Machine Learning Research
Access-efficient Balanced Bloom Filters
Computer Communications
How the (1+λ) evolutionary algorithm optimizes linear functions
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Memory footprint matters: efficient equi-join algorithms for main memory data processing
Proceedings of the 4th annual Symposium on Cloud Computing
| Hi-index | 0.01 |