Applying parallel computation algorithms in the design of serial algorithms (1983)

Cached

Download Links

by Nimrod Megiddo
Venue:J. ACM
Citations:233 - 7 self

Documents Related by Co-Citation

127 RAY SHOOTING AND PARAMETRIC SEARCH – Pankaj K. Agarwal, et al. - 1993
106 Slowing down sorting networks to obtain faster sorting algorithms – R Cole - 1987
1770 Computational Geometry: An Introduction – Franco P Preparata, Michael Ian Shamos - 1985
396 Applications of Random Sampling in Computational Geometry, II – Kenneth L. Clarkson, Peter W. Shor - 1995
37 width, closest line pair, and parametric searching, Discrete Comput – B Chazelle, H Edelsbrunner, L Guibas, M Sharir, Diameter - 1993
266 Epsilon-Nets and Simplex Range Queries – David Haussler, Emo Welzl - 1986
43 Dynamic half-space range reporting and its applications – P K Agarwal, J Matouˇsek - 1995
65 Reporting points in halfspaces – Jirí Matousek - 1991
91 Applications of parametric searching in geometric optimization – Pankaj K. Agarwal, Micha Sharir - 1994
107 Decomposable searching problems I: Static-to-dynamic transformation – J L Bentley, J B Saxe - 1980
70 Quasioptimal upper bounds for simplex range searching and new zone theorems – Bernard Chazelle, Micha Sharir, Emo Welzl - 1992
54 shooting in convexpolytopes – O SCHWARZKOPF, Ray - 1992
186 Small-dimensional linear programming and convex hulls made easy – R Seidel - 1991
89 The upper envelope of Voronoi surfaces and its applications, Discrete Comput – D P Huttenlocher, K Kedem, M Sharir - 1993
80 On Range Searching with Semialgebraic Sets – Pankaj K. Agarwal, Jirí Matousek - 1994
194 Linear programming in linear time when the dimension is fixed – Nimrod Megiddo - 1984
277 Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms – Herbert Edelsbrunner, Ernst Peter Mücke - 1990
44 On geometric optimization with few violated constraints – J Matoušek - 1994
87 A combinatorial bound for linear programming and related problems – M Sharir, E Welzl - 1992