M. Adler, P. Berenbrink, and K. Schröder, Analyzing an infinite parallel job allocation process, Proceedings of the European Symposium on Algorithms (ESA), 1998.

M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen, Parallel randomized load balancing. Random Structures & Algorithms, vol.13, pp.159-188, 1998.

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.

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), 2017.

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, Balanced allocations (extended abstract), Proceedings of the ACM Symposium on Theory of Computing (STOC), 1994.

P. Berenbrink, A. Czumaj, T. Friedetzky, and N. D. Vvedenskaya, Infinite parallel job allocation (extended abstract), Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.99-108, 2000.

P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking, Balanced allocations: The heavily loaded case, SIAM Journal on Computing, vol.35, issue.6, pp.1350-1385, 2006.

P. Berenbrink, F. Meyer-auf-der-heide, and K. Schröder, Allocating weighted jobs in parallel. Theory of Computing Systems, vol.32, pp.281-300, 1999.

M. Mitzenmacher, Load balancing and density dependent jump Markov processes, Proceedings of International Conference on Foundations of Computer Science, 1996.

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.

Y. Mocquard, B. Sericola, and E. Anceaume, Balanced allocations and global clock in population protocols: An accurate analysis (Full version), 2018.
URL : https://hal.archives-ouvertes.fr/hal-01790973

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.

Y. Peres, K. Talwar, and U. Wieder, Graphical balanced allocations and the (1 + ?)-choice process, Random Structure of Algorithms, vol.47, issue.4, pp.760-775, 2015.

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.

K. Talwar and U. Wieder, Balanced allocations: A simple proof for the heavily loaded case, Automata, Languages, and Programming, pp.979-990, 2014.