Randomized Online Geometric Algorithms

Randomized Online Geometric Algorithms is a class of algorithmic methods in computational geometry that process spatial input sequences incrementally and irreversibly, where randomness is strategically incorporated into decision-making to achieve probabilistic performance guarantees under adversarial or uncertain input order.

8

Publications

207

Citations

23

Authors

17

Institutions

Publications per year

2017–2026

0

Authors

23

  1. SS
    Subhash Suri

    University of California, Santa Barbara, United States

    2 publications · 48 citations

    2

    h-index

  2. JH
    John Hershberger

    Stanford University, United States

    2 publications · 48 citations

    2

    h-index

  3. PH
    Pedro Henrique Del Bianco Hokama

    Universidade Estadual de Campinas (UNICAMP), Brazil

    1 publications · 13 citations

    1

    h-index

  4. RR
    Rajeev Raman

    University of Leicester, United Kingdom

    1 publications · 39 citations

    1

    h-index

  5. AB
    Amotz Bar-Noy

    IBM (United States), United States

    1 publications · 28 citations

    1

    h-index

1–5 of 23

Venues

  1. Information Processing Letters

    2 publications · 24 citations

    2

    h-index

  2. Combinatorics Probability Computing

    1 publications · 28 citations

    1

    h-index

  3. Computational Geometry

    1 publications · 13 citations

    1

    h-index

  4. Theory of Computing Systems

    1 publications · 39 citations

    1

    h-index

  5. 1

    h-index

1–5