2026-09-19T14:01:30Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/602012022-01-13T07:54:35Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Peter Shor.
Redlich, Amanda E. (Amanda Epping)
Massachusetts Institute of Technology. Dept. of Mathematics.
Massachusetts Institute of Technology. Department of Mathematics
2010-12-06T17:37:18Z
2010-12-06T17:37:18Z
2010
2010
http://hdl.handle.net/1721.1/60201
681968171
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 65).
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.
by Amanda E. Redlich.
Ph.D.
65 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Mathematics.
Unbalanced allocations
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="14b2efa2-f687-47f8-9923-7416a8cccbff">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Unbalanced allocations</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2010</PublicationDate>
<Authors>
<Author>
<DisplayName>Redlich, Amanda E. (Amanda Epping)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mathematics.</Keyword>
<Abstract>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>