Ordered Set Operations

Ordered Set Operations is a formal computational framework that supports efficient insertion, deletion, and search operations on elements maintained in sorted order within a probabilistically balanced linked hierarchy, distinguished by its use of skip list structures to achieve expected logarithmic time complexity.

27

Publications

1K

Citations

56

Authors

36

Institutions

Publications per year

2017–2026

4

Parents

Authors

56

  1. JM
    J.P. McGregor

    Princeton University, United States

    2 publications · 51 citations

    2

    h-index

  2. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    2 publications · 54 citations

    2

    h-index

  3. DF
    Daniel Ferizovic

    Karlsruhe Institute of Technology, Germany

    1 publications · 11 citations

    1

    h-index

  4. RJ
    Richard J. Nowakowski

    Dalhousie University, Canada

    1 publications · 38 citations

    1

    h-index

  5. DM
    David M. Bressoud

    Pennsylvania State University, United States

    1 publications · 31 citations

    1

    h-index

1–5 of 56

Venues

  1. European Journal of Operational Research

    2 publications · 65 citations

    2

    h-index

  2. Discrete Mathematics

    2 publications · 49 citations

    2

    h-index

  3. IEEE Transactions on Computers

    2 publications · 89 citations

    2

    h-index

  4. Operations Research Letters

    1 publications · 35 citations

    1

    h-index

  5. Order

    1 publications · 38 citations

    1

    h-index

1–5