On the average-case complexity of “bucketing” algorithms-Reference-Cited by-同舟云学术

On the average-case complexity of “bucketing” algorithms

Published:1982-03 Issue:1 Volume:3 Page:9-13
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Akl Selim G,Meijer Henk

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference15 articles.

1. Selection by distributive partitioning;Allison;Inform. Process. Lett.,1980

2. J. L. Bentley, M. G. Faust, and F. P. Preparata, “Approximation Algorithms for Convex Hulls,” Technical Report CMU-CS-80-109, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA.

3. Optimal expected-time algorithms for closest-point problems;Bentley;ACM Trans. Math. Software,1980

4. K. Q. Brown, “Geometric Transforms for Fast Geometric Algorithms,” Technical Report CMU-CS-80-101, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA.

5. Average time behaviour of distributive sorting algorithms;Devroye;Computing,1981

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Faster Convex-Hull Algorithm via Bucketing;Lecture Notes in Computer Science;2019

2. Search performance of double-linked coalesced hashing can not exceed “bucketing”;Information Sciences;1992-11-01

3. Analysing a class of distributive partitioning sort algorithms;Science of Computer Programming;1986

4. On nonparametric estimation of a functional of a probability density;IEEE Transactions on Information Theory;1986-01

5. An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem;SIAM Journal on Computing;1985-08