Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 1994: Algorithm Theory — SWAT '94 pp 252–254Cite as

Randomized geometric algorithms (abstract)

  • Conference paper
  • First Online:

  • 145 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 824))

This is a preview of subscription content, log in via an institution.

References

  1. M. O. Rabin. Probabilistic algorithms. In J. F. Traub, editor, Algorithms and Complexity, pages 21–30. Academic Press, New York, 1976.

    Google Scholar 

  2. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete & Computational Geometry, 2:195–222, 1987.

    Google Scholar 

  3. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete & Computational Geometry, 2:127–151, 1987.

    Google Scholar 

  4. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete & Computational Geometry, 4:387–421, 1989.

    Google Scholar 

  5. K. Mulmuley. A fast planar partition algorithm, I. In 29th Annual IEEE Symposium on the Foundations Of Computer Science, pages 580–589, 1988.

    Google Scholar 

  6. K. Mulmuley and S. Sen. Dynamic point location in arrangements of hyperplanes. Discrete & Computational Geometry, 8:335–360, 1992.

    Google Scholar 

  7. W. Pngh. Skip lists: A probabilistic alternative to balanced trees. Commun. ACM, 33(6):668–676, 1990.

    Google Scholar 

  8. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373–395, 1984.

    Google Scholar 

  9. L. G. Khachiyan. Polynomial algorithms in linear programming. U.S.S.R. Comput. Math. and Math. Phys., 20:53–72, 1980.

    Google Scholar 

  10. R. Seidel. Linear programming and convex hulls made easy. In 6th Annual ACM Symposium on Computational Geometry, pages 211–215, 1990.

    Google Scholar 

  11. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. In 8th Annual ACM Symposium on Computational Geometry, pages 1–8, 1992.

    Google Scholar 

  12. K. Mehlhorn, M. Sharir, and E. Welzl. Tail estimates for the space complexity of randomized incremental algorithms. In 3rd Annual ACM Symposium On Discrete Algorithms, pages 89–93, 1992.

    Google Scholar 

  13. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications. Theoret. Comput. Sci., 84:77–105, 1991.

    Google Scholar 

  14. J. H. Reif and S. Sen. Polling: A new randomized sampling technique for computational geometry. In 21st Annual ACM Symposium on Theory Of Computing, pages 394–404, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Chicago, USA

    Ketan Mulmuley

Authors
  1. Ketan Mulmuley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Erik M. Schmidt Sven Skyum

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mulmuley, K. (1994). Randomized geometric algorithms (abstract). In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-58218-5_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58218-2

  • Online ISBN: 978-3-540-48577-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation