Priority Queue Implementation

Priority Queue Implementation is a data structure design that organizes elements according to their priorities, enabling efficient insertion and extraction of the highest-priority element, distinguished by its use of probabilistic skip list hierarchies to achieve average-case logarithmic time complexity for key operations.

199

Publications

20.7K

Citations

445

Authors

211

Institutions

Publications per year

2017–2026

19

Parents

Authors

445

  1. HN
    Harold N. Gabow

    University of Colorado Boulder, United States

    5 publications · 489 citations

    5

    h-index

  2. ZG
    Zvi Galil

    Tel Aviv University, Israel

    4 publications · 285 citations

    4

    h-index

  3. PT
    Philippas Tsigas

    Chalmers University of Technology, Sweden

    4 publications · 209 citations

    4

    h-index

  4. RA
    Rassul Ayani

    KTH Royal Institute of Technology, Sweden

    4 publications · 199 citations

    4

    h-index

  5. SK
    Sushil K. Prasad

    Georgia State University, United States

    4 publications · 118 citations

    4

    h-index

1–5 of 445

Venues

  1. Communications of the ACM

    7 publications · 1.5K citations

    7

    h-index

  2. Information Processing Letters

    6 publications · 286 citations

    6

    h-index

  3. IEEE Transactions on Computers

    6 publications · 382 citations

    6

    h-index

  4. Journal of the ACM

    JACM · 4 publications · 690 citations

    4

    h-index

  5. SIAM Journal on Computing

    4 publications · 422 citations

    4

    h-index

1–5