论文信息 - On the Average-Case Complexity of "Bucketing" Algorithms

On the Average-Case Complexity of "Bucketing" Algorithms

Abstract We analyze the average-case behavior of a general class of algorithms to which the method of buckets can be applied. In particular, we give sufficient conditions under which an algorithm A that solves a problem P of size n in O(nk), k > 1, worst-case time, can be made to run in linear expected time.

Selim G. Akl | Henk Meijer | S. Akl | H. Meijer

[1] B. Weide. Statistical methods in algorithm design and analysis. , 1978 .

[2] Selim G. Akl,et al. The Design and Analysis of a New Hybrid Sorting Algorithm , 1980, Inf. Process. Lett..

[3] Wlodzimierz Dobosiewicz,et al. Sorting by Distributive Partitioning , 1978, Inf. Process. Lett..

[4] Gideon Yuval,et al. Finding Nearest Neighbors , 1976, Inf. Process. Lett..

[5] W. Rudin. Real and complex analysis , 1968 .

[6] John E. Hopcroft,et al. A Note on Rabin's Nearest-Neighbor Algorithm , 1978, Inf. Process. Lett..

[7] Bruce W. Weide,et al. Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[8] Kevin Q. Brown. Geometric transforms for fast geometric algorithms , 1979 .

[9] E. Gumbel,et al. Statistics of extremes , 1960 .

[10] Donald C. S. Allison,et al. Selection by Distributive Partitioning , 1980, Inf. Process. Lett..

[11] Franco P. Preparata,et al. Approximation algorithms for convex hulls , 1982, CACM.