AI helps you reading Science
Phase transition for parking blocks, Brownian excursion and coalescence
Random Struct. Algorithms, no. 1 (2002): 76-119
EI
Abstract
In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n m), and ℓ = m - n empty places. For a noncomputer science-minded reader, we shall use the metaphore of n cars parking on m places: each car ci chooses a place pi at random, and if pi is occupied, ci tries successively pi + 1, pi + 2, until...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn