1. Azar Y, Broder A, Karlin A, Upfal E (1994) Balanced allocation. In: Proc of the 26th ACM Symp on Theory of Computing (STOC), pp 593–602
2. Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C (2007) Dynamic and redundant data placement. In: IEEE International Conference on Distributed Computing Systems (ICDCS), pp 29–38
3. Brinkmann A, Salzwedel K, Scheideler C (2000) Efficient, distributed data placement strategies for storage area networks. In: Proc of the 12th ACM Symp on Parallel Algorithms and Architectures (SPAA), pp 119–128
4. Brinkmann A, Salzwedel K, Scheideler C (2002) Compact, adaptive placement schemes for non-uniform capacities. In: Proc of the 14th ACM Symp on Parallel Algorithms and Architectures (SPAA), pp 53–62
5. Carter J, Wegman M (1979) Universal classes of hash functions. J Comput Sys Sci 18(2):143–154