Efficient randomized algorithms for the repeated median line estimator

Authors:
Jiří Matoušek;David M. Mount;Nathan S. Netanyahu
Affiliations:
Department of Applied Mathematics, Charles University, Prague, Czechoslovakia and Free University, Berlin, Germany;Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland;NASA Goddard Space and Flight Center, Greenbelt, Maryland and Center for Automation Research, University of Maryland, College Park, Maryland
Venue:
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Year:
1993

Halfplanar range search in linear space and O(n0.695) query time

Information Processing Letters
An optimal-time algorithm for slope selection

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
Efficient partition trees

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Randomized optimal algorithm for slope selection

Information Processing Letters
Finding the repeated median regression line

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Diameter, width, closest line pair, and parametric searching

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)

Hi-index	0.00