Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

RANDOM
1998
Springer

favoriteEmaildiscussreport

98views Theoretical Computer Science» more RANDOM 1998»

"Balls into Bins" - A Simple and Tight Analysis

14 years 3 months ago

"Balls into Bins" - A Simple and Tight Analysis

Download wwwmayr.informatik.tu-muenchen.de

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.

Martin Raab, Angelika Steger

Real-time Traffic

Lower Bounds | Maximum Number | Natural Question | RANDOM 1998 | Theoretical Computer Science |

claim paper

Related Content

» 35Way Cuckoo Hashing for the Price of 2andaBit

» Tight WCRT analysis of synchronous C programs

» Tight results for Next Fit and Worst Fit with resource augmentation

» Optimal Cognitive Access of Markovian Channels under Tight Collision Constraints

» Searching for Tight Performance Bounds in FeedForward Networks

» A Simple Optimal Randomized Algorithm for Sorting on the PDM

» Solving MAXrSAT Above a Tight Lower Bound

» Robust mixedsize placement under tight whitespace constraints

» Virtual Simple Architecture VISA Exceeding the Complexity Limit in Safe RealTime Systems

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	RANDOM
Authors	Martin Raab, Angelika Steger

Comments (0)