Author:
Raab Martin,Steger Angelika
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal. On-line load balancing (extended abstract). In 33rd Annual Symposium on Foundations of Computer Science, pages 218–225, Pittsburgh, Pennsylvania, 24–27 October 1992. IEEE.
2. B. Bollobás. Random graphs. Academic Press, New York-San Francisco-London-San Diego, 1985.
3. A. Czumaj and V. Stemann. Randomized allocation processes. In 38th Annual Symposium on Foundations of Computer Science, pages 194–203, 1997.
4. G.H. Gonnet. Expected length of the longest probe sequence in hash code searching. J. ACM, 28(2):289–304, 1981.
5. N. Johnson and S. Kotz. Urn Models and Their Applications. John Wiley and Sons, 1977.
Cited by
132 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献