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
27
A Dictionary Machine (for VLSI)
Ottmann, Rosenberg, Stockmeyer · IEEE Transactions on Computers · 1982 · 79 citations
1–5 of 27
56
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 56
36
Princeton University
Princeton, United States
2 h-index
4 publications
102 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
108 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
2 publications
158 citations
King's College London
London, United Kingdom
1 h-index
1 publications
24 citations

University of Toronto
Toronto, Canada
1 h-index
1 publications
79 citations

Uppsala University
Uppsala, Sweden
1 h-index
2 publications
20 citations
University of Connecticut
Storrs, United States
1 h-index
2 publications
20 citations
Université de Montréal
Montreal, Canada
1 h-index
1 publications
17 citations
1–8 of 36
2 publications · 65 citations
2
h-index
2 publications · 49 citations
2
h-index
2 publications · 89 citations
2
h-index
1 publications · 35 citations
1
h-index
1 publications · 38 citations
1
h-index
1–5