Unbalanced allocations
Author(s)
Redlich, Amanda E. (Amanda Epping)![Thumbnail](/bitstream/handle/1721.1/60201/681968171-MIT.pdf.jpg?sequence=4&isAllowed=y)
DownloadFull printable version (2.508Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Mathematics.
Advisor
Peter Shor.
Terms of use
Metadata
Show full item recordAbstract
Recently, there has been much research on processes that are mostly random, but also have a small amount of deterministic choice; e.g., Achlioptas processes on graphs. This thesis builds on the balanced allocation algorithm first described by Azar, Broder, Karlin and Upfal. Their algorithm (and its relatives) uses randomness and some choice to distribute balls into bins in a balanced way. Here is a description of the opposite family of algorithms, with an analysis of exactly how unbalanced the distribution can become.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010. Cataloged from PDF version of thesis. Includes bibliographical references (p. 65).
Date issued
2010Department
Massachusetts Institute of Technology. Department of MathematicsPublisher
Massachusetts Institute of Technology
Keywords
Mathematics.