Concepedia

Randomized Intersection Algorithms

Randomized Intersection Algorithms is a computational method in computational geometry that uses probabilistic techniques to efficiently determine intersections among line segments by introducing randomization in the processing order or data structure selection to achieve expected optimal time complexity.

55

Publications

2K

Citations

98

Authors

55

Institutions

Publications per year

2017–2026

0

Parents

Publications

55

Improved Bounds for Matroid Partition and Intersection Algorithms

William H. Cunningham · SIAM Journal on Computing · 1986 · 115 citations

, , +13

More planar two-center algorithms

Timothy M. Chan · Computational Geometry · 1999 · 109 citations

, , +8

A fast planar partition algorithm. I

Ketan Mulmuley · 1988 · 106 citations

, , +10

Efficient Set Intersection with Simulation-Based Security

Michael J. Freedman, Carmit Hazay, Kobbi Nissim et al. · Journal of Cryptology · 2014 · 92 citations · Full text

, , +14

Efficient algorithms for a family of matroid intersection problems

Harold N. Gabow, Robert E. Tarjan · Journal of Algorithms · 1984 · 85 citations

, , +9

1–5 of 55

Authors

98

  1. SH
    Sariel Har-Peled

    University of Illinois Urbana-Champaign, United States

    2 publications · 45 citations

    2

    h-index

  2. DH
    David H. Marimont

    Palo Alto Research Center, United States

    2 publications · 68 citations

    2

    h-index

  3. HK
    Haim Kaplan

    Tel Aviv University, Israel

    2 publications · 66 citations

    2

    h-index

  4. LG
    Leonidas Guibas

    Stanford University, United States

    2 publications · 68 citations

    2

    h-index

  5. EJ
    Elizabeth J. Billington

    The University of Queensland, Australia

    2 publications · 31 citations

    2

    h-index

1–5 of 98

Institutions

55

  1. Stanford University

    Stanford, United States

    4 h-index

    4 publications

    169 citations

  2. Tel Aviv University

    Tel Aviv, Israel

    4 h-index

    6 publications

    169 citations

  3. Carnegie Mellon University

    Pittsburgh, United States

    3 h-index

    5 publications

    146 citations

  4. University of Waterloo

    Waterloo, Canada

    3 h-index

    6 publications

    317 citations

  5. Palo Alto Research Center

    Palo Alto, United States

    2 h-index

    2 publications

    68 citations

  6. University of Chile

    Santiago, Chile

    2 h-index

    3 publications

    132 citations

  7. University of Colorado Boulder

    Boulder, United States

    2 h-index

    3 publications

    185 citations

  8. Utrecht University

    Utrecht, The Netherlands

    1 h-index

    1 publications

    27 citations

1–8 of 55

Venues

  1. Computational Geometry

    5 publications · 193 citations

    5

    h-index

  2. SIAM Journal on Computing

    5 publications · 231 citations

    5

    h-index

  3. Theoretical Computer Science

    3 publications · 93 citations

    3

    h-index

  4. ACM Transactions on Algorithms

    TALG · 3 publications · 108 citations

    3

    h-index

  5. Journal of Algorithms

    3 publications · 184 citations

    3

    h-index

1–5