Concepedia

Parallel Dynamic Geometric Algorithms

Parallel Dynamic Geometric Algorithms is a class of computational methods in parallel algorithm design that enables efficient, concurrent updates and queries on dynamically changing geometric data structures through synchronized multi-processor operations.

4

Publications

134

Citations

6

Authors

5

Institutions

Publications per year

2017–2026

0

Parents

Publications

4

1–4 of 4

Authors

6

  1. YC
    Yi‐Jen Chiang

    New York University, United States

    1 publications · 18 citations

    1

    h-index

  2. CH
    Chazelle

    Carnegie Mellon University, United States

    1 publications · 60 citations

    1

    h-index

  3. RM
    Russ Miller

    University at Buffalo, State University of New York, United States

    1 publications · 14 citations

    1

    h-index

  4. ER
    Eugenio Roanes–Lozano

    Universidad Complutense de Madrid, Spain

    1 publications · 42 citations

    1

    h-index

  5. LB
    Laurence Boxer

    Niagara University, United States

    1 publications · 14 citations

    1

    h-index

1–5 of 6

Institutions

5

  1. John Brown University

    Siloam Springs, United States

    1 h-index

    1 publications

    60 citations

  2. University at Buffalo, State University of New York

    Buffalo, United States

    1 h-index

    1 publications

    14 citations

  3. Universidad Complutense de Madrid

    Madrid, Spain

    1 h-index

    1 publications

    42 citations

  4. Universidad Politécnica de Madrid

    Madrid, Spain

    1 h-index

    1 publications

    42 citations

  5. Niagara University

    Lewiston, United States

    1 h-index

    1 publications

    14 citations

1–5 of 5

Venues

  1. The Journal of Supercomputing

    1 publications · 14 citations

    1

    h-index

  2. IEEE Transactions on Computers

    1 publications · 60 citations

    1

    h-index

  3. Mathematical and Computer Modelling

    1 publications · 42 citations

    1

    h-index

1–3