Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
Randomized Allocation Processes
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Random Arc Allocation and Applications
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Simplified Witness Tree Arguments
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Partial and approximate symmetry detection for 3D geometry
ACM SIGGRAPH 2006 Papers
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Balls into bins with related random choices
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Coloring spatial point processes with applications to peer discovery in large wireless networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Work-optimal routing in wavelength-division multiplexed three-dimensional dense optical tori
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Carousel: scalable logging for intrusion prevention systems
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
The (1 + β)-choice process and weighted balls-into-bins
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Improved asymptotic multicast throughput for random extended networks
Computer Communications
Privacy-preserving group discovery with linear complexity
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Competitive analysis of flash memory algorithms
ACM Transactions on Algorithms (TALG)
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Parallel randomized load balancing: A lower bound for a more general model
Theoretical Computer Science
Parallel evaluation of conjunctive queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
On multicast throughput scaling of hybrid wireless networks with general node density
Computer Networks: The International Journal of Computer and Telecommunications Networking
Small cache, big effect: provable load balancing for randomly partitioned cluster services
Proceedings of the 2nd ACM Symposium on Cloud Computing
Coloring spatial point processes with applications to peer discovery in large wireless networks
IEEE/ACM Transactions on Networking (TON)
Systolic routing in an optical fat tree
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Balls into bins with related random choices
Journal of Parallel and Distributed Computing
From balls and bins to points and vertices
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On randomized broadcasting in power law networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Systolic routing in an optical butterfly
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Anonymous distribution of encryption keys in cellular broadcast systems
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Fractional matching via balls-and-bins
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Self-star Properties in Complex Information Systems
Revisiting randomized parallel load balancing algorithms
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Oblivious RAM with o((logn)3) worst-case cost
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
VIBE: An energy efficient routing protocol for dense and mobile sensor networks
Journal of Network and Computer Applications
Don't lose sleep over availability: the GreenUp decentralized wakeup service
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Revisiting randomized parallel load balancing algorithms
Theoretical Computer Science
Proceedings of the 15th International Conference on Database Theory
The impact of the power law exponent on the behavior of a dynamic epidemic type process
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Work-optimal two-phase routing in a sparse optical torus
Proceedings of the 13th International Conference on Computer Systems and Technologies
Balancing reducer skew in MapReduce workloads using progressive sampling
Proceedings of the Third ACM Symposium on Cloud Computing
Systolic routing in an optical ring with logarithmic shortcuts
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Performance, scalability, and semantics of concurrent FIFO queues
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness
International Journal of Distributed Systems and Technologies
Extending SSD lifetime in database applications with page overwrites
Proceedings of the 6th International Systems and Storage Conference
Balls-into-bins with nearly optimal load distribution
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
Predicting response times for the Spotify backend
Proceedings of the 8th International Conference on Network and Service Management
Outsourced private information retrieval
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Efficient vote elicitation under candidate uncertainty
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Journal of Parallel and Distributed Computing
File recipe compression in data deduplication systems
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower bounds which are reached with high probability. We prove bounds for all values of m(n) ≥ n=polylog(n) by using the simple and well-known method of the first and second moment.