analysis of algorithms;
limiting distribution;
random allocations;
urn model;
D O I:
10.1016/S0378-3758(01)00156-2
中图分类号:
O21 [概率论与数理统计];
C8 [统计学];
学科分类号:
020208 ;
070103 ;
0714 ;
摘要:
We survey some problems that appear in the analysis of different problems in Computer Science, and show that they can be cast in a common framework (occupancy urn models) and admit a uniform treatment. (C) 2002 Elsevier Science B.V. All rights reserved.