M. Adler, P. Berenbrink, and K. Schröder, Analyzing an Infinite Parallel Job Allocation Process
DOI : 10.1007/3-540-68530-8_35
URL : http://www.cs.umass.edu/~micah/pubs/infinite.ps

M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen, Parallel randomized load balancing, Random Structures and Algorithms, vol.13, issue.2, pp.159-188, 1998.
DOI : 10.1002/(SICI)1098-2418(199809)13:2<159::AID-RSA3>3.0.CO;2-Q
URL : http://www.cs.umass.edu/~micah/pubs/balls.ps

D. Alistarh, J. Aspnes, and R. Gelashvili, Space-Optimal Majority in Population Protocols, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.2221-2239, 2018.
DOI : 10.1137/1.9781611975031.144
URL : http://epubs.siam.org/doi/pdf/10.1137/1.9781611975031.144

D. Alistarh, J. Kopinsky, J. Li, and G. Nadiradze, The Power of Choice in Priority Scheduling, Proceedings of the ACM Symposium on Principles of Distributed Computing , PODC '17, 2017.
DOI : 10.1145/2688500.2688547

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, Balanced allocations (extended abstract), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, 1994.
DOI : 10.1145/195058.195412

P. Berenbrink, A. Czumaj, T. Friedetzky, and N. D. Vvedenskaya, Infinite parallel job allocation (extended abstract), Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures , SPAA '00, pp.99-108, 2000.
DOI : 10.1145/341800.341813
URL : http://www.cis.njit.edu/~czumaj/PUBLICATIONS/SPAA2000.ps.gz

P. Berenbrink, A. Czumaj, A. Steger, and B. Vcking, Balanced allocations, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.1350-1385, 2006.
DOI : 10.1145/335305.335411

P. Berenbrink, F. Meyer-auf-der-heide, and K. Schröder, Allocating Weighted Jobs in Parallel, Theory of Computing Systems, vol.32, issue.3, pp.281-300, 1999.
DOI : 10.1007/s002240000119
URL : http://www.uni-paderborn.de/sfb376/projects/c5/publications/BMK99.ps.gz

M. Mitzenmacher, Load balancing and density dependent jump Markov processes, Proceedings of 37th Conference on Foundations of Computer Science, 1996.
DOI : 10.1109/SFCS.1996.548480
URL : http://www.research.digital.com/SRC/personal/Michael_Mitzenmacher/NEWWORK/postscripts/density-conf.ps.gz

M. Mitzenmacher, A. W. Richa, and R. Sitaraman, The Power of Two Random Choices: A Survey of Techniques and Results, Handbook of Randomized Computing, pp.255-312, 2000.
DOI : 10.1007/978-1-4615-0013-1_9

Y. Peres, K. Talwar, and U. Wieder, The (1 + ??)-Choice Process and Weighted Balls-into-Bins, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010.
DOI : 10.1137/1.9781611973075.131
URL : http://research.microsoft.com/pubs/104938/YPeres.pdf

Y. Peres, K. Talwar, and U. Wieder, Graphical balanced allocations and the (1 + ??)-choice process, Random Structures & Algorithms, vol.50, issue.4, pp.760-775, 2015.
DOI : 10.1145/1248377.1248407

M. Raab and A. Steger, ???Balls into Bins??? ??? A Simple and Tight Analysis, Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pp.159-170, 1998.
DOI : 10.1007/3-540-49543-6_13

K. Talwar and U. Wieder, Balanced Allocations: A Simple Proof for the Heavily Loaded Case, Automata, Languages, and Programming, pp.979-990, 2014.
DOI : 10.1007/978-3-662-43948-7_81