On the public citation graph
A new data structure for representing sorted lists
0 signed · 181 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-09526-8_10openalex-snapshot
Searching, sorting and information theory
inferredcites →https://doi.org/10.1007/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1016/0304-3975(80)90018-3openalex-snapshot
On the average number of rebalancing operations in weight-balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1137/0209045openalex-snapshot
Design and Analysis of a Data Structure for Representing Sorted Lists
inferredcites →https://doi.org/10.1145/800105.803395openalex-snapshot
A new representation for linear lists
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1983.tb03469.xopenalex-snapshot
Two New Kinds of Biased Search Trees
inferred← citeshttps://doi.org/10.1006/jagm.1993.1048openalex-snapshot
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot
On-line Planar Graph Embedding
inferred← citeshttps://doi.org/10.1006/jcss.1996.0025openalex-snapshot
Onk-Dimensional Balanced Binary Trees
inferred← citeshttps://doi.org/10.1006/jcss.1997.1511openalex-snapshot
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues
inferred← citeshttps://doi.org/10.1006/jcss.2000.1705openalex-snapshot
AVL Trees with Relaxed Balance
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1426openalex-snapshot
Multiple Templates Access of Trees in Parallel Memory Systems
inferred← citeshttps://doi.org/10.1007/11786986_34openalex-snapshot
Dynamic Interpolation Search Revisited
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_29openalex-snapshot
Measures of presortedness and optimal sorting algorithms
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_44openalex-snapshot
AVL-trees for localized search
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_4openalex-snapshot
Time parameter and arbitrary deunions in the set union problem
inferred← citeshttps://doi.org/10.1007/3-540-38076-0_28openalex-snapshot
A New Randomized Data Structure for the 1 1/2-dimensional Range Query Problem
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44867-5_7openalex-snapshot
Search Data Structures for Skewed Strings
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_17openalex-snapshot
Complexity of Layered Binary Search Trees with Relaxed Balance
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_19openalex-snapshot
Exponentially Decreasing Number of Operations in Balanced Trees
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_62openalex-snapshot
Solving the String Statistics Problem in Time $$ \mathcal{O} $$ (nlogn)
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_45openalex-snapshot
Amortized Complexity of Bulk Updates in AVL-Trees
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_12openalex-snapshot
Implementing I/O-efficient Data Structures Using TPIE
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_18openalex-snapshot
An Experimental Evaluation of Hybrid Data Structures for Searching
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_11openalex-snapshot
Finding Maximal Pairs with Bounded Gap
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_34openalex-snapshot
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-51084-2_1openalex-snapshot
Dynamic maintenance of paths and path expressions on graphs
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_66openalex-snapshot
A constant update time finger search tree
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_82openalex-snapshot
Computing the shortest path tree in a weak visibility polygon
inferred← citeshttps://doi.org/10.1007/3-540-57301-1_21openalex-snapshot
An algorithm for the implementation of replicated tables
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_74openalex-snapshot
A simple file structure for the weighted dictionary problem
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_243openalex-snapshot
A simple balanced search tree with O(1) worst-case update time
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_69openalex-snapshot
Amortization results for chromatic search trees, with an application to priority queues
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_74openalex-snapshot
The buffer tree: A new technique for optimal I/O-algorithms
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_27openalex-snapshot
Relaxed balance for search trees with local rebalancing
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_8openalex-snapshot
External-memory algorithms with applications in GIS
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_4openalex-snapshot
De-amortization of Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_52openalex-snapshot
A General Technique for Managing Strings in Comparison-Driven Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_24openalex-snapshot
Concurrency Control and I/O-Optimality in Bulk Insertion
inferred← citeshttps://doi.org/10.1007/978-3-642-02011-7_25openalex-snapshot
Bulk-Insertion Sort: Towards Composite Measures of Presortedness
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_8openalex-snapshot
Some Results for Elementary Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_22openalex-snapshot
Dynamic Planar Range Maxima Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_25openalex-snapshot
A Contention-Friendly Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-94-011-4122-2_8openalex-snapshot
Trees for Multilevel Memory
inferred← citeshttps://doi.org/10.1007/bf00289139openalex-snapshot
Optimal multiway search trees for variable size keys
inferred← citeshttps://doi.org/10.1007/bf00289142openalex-snapshot
Maintaining order in a generalized linked list
inferred← citeshttps://doi.org/10.1007/bf00299635openalex-snapshot
A balanced search tree with O(1) worst-case update time
inferred← citeshttps://doi.org/10.1007/bf01187021openalex-snapshot
A workbench for computational geometry
inferred← citeshttps://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
inferred← citeshttps://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferred← citeshttps://doi.org/10.1007/bf01952419openalex-snapshot
Visibility between two edges of a simple polygon
inferred← citeshttps://doi.org/10.1007/bf02247961openalex-snapshot
Computing the external geodesic diameter of a simple polygon
inferred← citeshttps://doi.org/10.1007/bfb0023445openalex-snapshot
Predecessor queries in dynamic integer sets
inferred← citeshttps://doi.org/10.1007/bfb0028283openalex-snapshot
Fully persistent data structures for disjoint set union problems
inferred← citeshttps://doi.org/10.1007/bfb0036494openalex-snapshot
Maintaining order in a generalized linked list
inferred← citeshttps://doi.org/10.1007/pl00013303openalex-snapshot
Relaxed balance for search trees with local rebalancing
inferred← citeshttps://doi.org/10.1007/s00236-005-0173-3openalex-snapshot
Exponentially decreasing number of operations in balanced trees
inferred← citeshttps://doi.org/10.1007/s00236-019-00335-9openalex-snapshot
Red–black trees with constant update time
inferred← citeshttps://doi.org/10.1007/s002360050145openalex-snapshot
Amortized constant relaxed rebalancing using standard rotations
inferred← citeshttps://doi.org/10.1007/s00453-002-0935-zopenalex-snapshot
Optimal Solutions for the Temporal Precedence Problem
inferred← citeshttps://doi.org/10.1007/s00453-003-1021-xopenalex-snapshot
The Buffer Tree: A Technique for Designing Batched External Data Structures
inferred← citeshttps://doi.org/10.1007/s00453-011-9541-2openalex-snapshot
External Memory Planar Point Location with Logarithmic Updates
inferred← citeshttps://doi.org/10.1007/s00454-007-9015-0openalex-snapshot
Improved Output-Sensitive Snap Rounding
inferred← citeshttps://doi.org/10.1007/s007780050028openalex-snapshot
An asymptotically optimal multiversion B-tree
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90099-6openalex-snapshot
Updating a balanced search tree in O(1) rotations
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00115-4openalex-snapshot
A constant update time finger search tree
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90034-2openalex-snapshot
Making data structures persistent
inferred← citeshttps://doi.org/10.1016/b978-0-444-87137-4.50014-xopenalex-snapshot
Computing Visibility Properties of Polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.04.001openalex-snapshot
I/O-efficient dynamic planar point location
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.07.007openalex-snapshot
I/O-efficient algorithms for computing planar geometric spanners
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104465openalex-snapshot
Dynamic Interpolation Search revisited
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.014openalex-snapshot
A locality-preserving cache-oblivious dynamic dictionary
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.023openalex-snapshot
Towards a real time algorithm for parameterized longest common prefix computation
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90534-4openalex-snapshot
The theory of fringe analysis and its application to 23 trees and b-trees
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80034-6openalex-snapshot
AVL-trees for localized search
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80033-xopenalex-snapshot
Sorting jordan sequences in linear time using level-linked search trees
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00228-4openalex-snapshot
On the existence and construction of non-extreme (a,b)-trees
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00013-8openalex-snapshot
Optimal finger search trees in the pointer machine
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00027-8openalex-snapshot
Relaxed multi-way trees with group updates
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60257-0openalex-snapshot
Multidimensional Data Structures: Review and Outlook
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80204-xopenalex-snapshot
Chapter 7 Fundamental algorithms and data structures
inferred← citeshttps://doi.org/10.1093/comjnl/bxv090openalex-snapshot
Cache-Sensitive Memory Layout for Dynamic Binary Trees
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/aqtr.2014.6857846openalex-snapshot
WaterfallTree — External indexing data structure
inferred← citeshttps://doi.org/10.1109/hipc.2016.042openalex-snapshot
Fast Parallel Operations on Search Trees
inferred← citeshttps://doi.org/10.1109/hipc53243.2021.00023openalex-snapshot
PPBT: A High Performance Parallel Search Tree
inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00029openalex-snapshot
Organic Mergesort and Finger Buffer-Tree Sort: Adaptive Sorting Algorithms with External-Memory or Parallel Implementations
inferred← citeshttps://doi.org/10.1109/ipps.1995.395932openalex-snapshot
B-trees with relaxed balance
inferred← citeshttps://doi.org/10.1109/ipps.1998.669955openalex-snapshot
Toward a universal mapping algorithm for accessing trees in parallel memory systems
inferred← citeshttps://doi.org/10.1109/istcs.1995.377045openalex-snapshot
A general technique for implementation of efficient priority queues
inferred← citeshttps://doi.org/10.1109/sequen.1997.666927openalex-snapshot
Sequence sorting in secondary storage
inferred← citeshttps://doi.org/10.1109/sfcs.1987.6openalex-snapshot
An output sensitive algorithm for computing visibility graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548515openalex-snapshot
Optimal dynamic interval management in external memory
inferred← citeshttps://doi.org/10.1109/tbdata.2025.3558844openalex-snapshot
FIFA: A Forest-Based Sliding Window Aggregation Scheme for Out-of-Order Data Streams
inferred← citeshttps://doi.org/10.1109/tc.1985.5009382openalex-snapshot
Measures of Presortedness and Optimal Sorting Algorithms
inferred← citeshttps://doi.org/10.1109/tkde.2013.152openalex-snapshot
I/O-Efficient Bundled Range Aggregation
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22472.xopenalex-snapshot
Planar Point Location Using Persistent Search Treesa
inferred← citeshttps://doi.org/10.1137/0215002openalex-snapshot
An Amortized Analysis of Insertions into AVL-Trees
inferred← citeshttps://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferred← citeshttps://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
inferred← citeshttps://doi.org/10.1137/110836377openalex-snapshot
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
inferred← citeshttps://doi.org/10.1137/s009753970240481xopenalex-snapshot
Optimal External Memory Interval Management
inferred← citeshttps://doi.org/10.1137/s0097539703424521openalex-snapshot
Distances and Finger Search in Random Binary Search Trees
inferred← citeshttps://doi.org/10.1137/s0097539703428324openalex-snapshot
An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539794263191openalex-snapshot
Efficiently Planning Compliant Motion in the Plane
inferred← citeshttps://doi.org/10.1142/s0129626416500158openalex-snapshot
A Fast Contention-Friendly Binary Search Tree
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/10515.10516openalex-snapshot
Linear time algorithms for visibility and shortest path problems inside simple polygons
inferred← citeshttps://doi.org/10.1145/1064546.1180615openalex-snapshot
Improving the performance of multidimensional search using fingers
inferred← citeshttps://doi.org/10.1145/1137856.1137909openalex-snapshot
Improved output-sensitive snap rounding
inferred← citeshttps://doi.org/10.1145/116873.116878openalex-snapshot
Data structures and algorithms for disjoint set union problems
inferred← citeshttps://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferred← citeshttps://doi.org/10.1145/12130.12170openalex-snapshot
A linear-time algorithm for triangulating simple polygons
inferred← citeshttps://doi.org/10.1145/1377676.1377699openalex-snapshot
External memory planar point location with logarithmic updates
inferred← citeshttps://doi.org/10.1145/160985.161172openalex-snapshot
Compliant motion in a simple polygon
inferred← citeshttps://doi.org/10.1145/177424.177601openalex-snapshot
Biased finger trees and three-dimensional layers of maxima
inferred← citeshttps://doi.org/10.1145/2523616.2523625openalex-snapshot
Memory-efficient groupby-aggregate using compressed buffer trees
inferred← citeshttps://doi.org/10.1145/2540068openalex-snapshot
Deletion without rebalancing in multiway search trees
inferred← citeshttps://doi.org/10.1145/258533.258647openalex-snapshot
On sorting strings in external memory (extended abstract)
inferred← citeshttps://doi.org/10.1145/2755573.2755604openalex-snapshot
Sorting with Asymmetric Read and Write Costs
inferred← citeshttps://doi.org/10.1145/303976.304010openalex-snapshot
On two-dimensional indexability and optimal range search indexing
inferred← citeshttps://doi.org/10.1145/314500.314525openalex-snapshot
I/O-efficient dynamic point location in monotone planar subdivisions
inferred← citeshttps://doi.org/10.1145/336154.336205openalex-snapshot
I/O-efficient dynamic planar point location (extended abstract)
inferred← citeshttps://doi.org/10.1145/3397506openalex-snapshot
Packing R-trees with Space-filling Curves
inferred← citeshttps://doi.org/10.1145/3564246.3585140openalex-snapshot
External Memory Fully Persistent Search Trees
inferred← citeshttps://doi.org/10.1145/3651609openalex-snapshot
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
inferred← citeshttps://doi.org/10.1145/3733620.3733625openalex-snapshot
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
inferred← citeshttps://doi.org/10.1145/3747536openalex-snapshot
Pushing the Information-Theoretic Limits of Random Access Lists: Traversing Cons Lists in (1 + 1/𝜎 ) ⌊lg 𝑛⌋ + 𝜎 + 9 Steps
inferred← citeshttps://doi.org/10.1145/375551.375566openalex-snapshot
Relaxed multi-way trees with group updates
inferred← citeshttps://doi.org/10.1145/3810240openalex-snapshot
History-Independent Dynamic Partitioning with Applications to B-Trees, Skip Lists and Fusion Trees
inferred← citeshttps://doi.org/10.1145/41958.41960openalex-snapshot
Finding the visibility graph of a simple polygon in time proportional to its size
inferred← citeshttps://doi.org/10.1145/44546.44559openalex-snapshot
Are applicative languages inefficient?
inferred← citeshttps://doi.org/10.1145/507635.507650openalex-snapshot
A simple implementation technique for priority search queues
inferred← citeshttps://doi.org/10.1145/507669.507650openalex-snapshot
A simple implementation technique for priority search queues
inferred← citeshttps://doi.org/10.1145/509907.509950openalex-snapshot
Cache-oblivious priority queue and graph algorithm applications
inferred← citeshttps://doi.org/10.1145/509907.509991openalex-snapshot
Optimal finger search trees in the pointer machine
inferred← citeshttps://doi.org/10.1145/5684.5688openalex-snapshot
A locally adaptive data compression scheme
inferred← citeshttps://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferred← citeshttps://doi.org/10.1145/777792.777826openalex-snapshot
Proximate planar point location
inferred← citeshttps://doi.org/10.1145/780542.780589openalex-snapshot
On the limits of cache-obliviousness
inferred← citeshttps://doi.org/10.1145/996546.996549openalex-snapshot
I/O-efficient point location using persistent B-trees
inferred← citeshttps://doi.org/10.1184/r1/6609716openalex-snapshot
Space-Efficient Finger Search on Degree-Balanced Search Trees
inferred← citeshttps://doi.org/10.1201/9781584888239-c10openalex-snapshot
External-Memory Algorithms and Data Structures
inferred← citeshttps://doi.org/10.14778/3339490.3339499openalex-snapshot
Optimal and general out-of-order sliding-window aggregation
inferred← citeshttps://doi.org/10.21236/ada201173openalex-snapshot
Dynamic Data Structures for Two-Dimensional Searching
inferred← citeshttps://doi.org/10.25596/jalc-2003-607openalex-snapshot
New Dynamic Balanced Search Trees with Worst-Case Constant Update Time
inferred← citeshttps://doi.org/10.48550/arxiv.1109.2378openalex-snapshot
Modern hierarchical, agglomerative clustering algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0406openalex-snapshot
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing
inferred← citeshttps://doi.org/10.48550/arxiv.1810.11308openalex-snapshot
Sub-O(log n) Out-of-Order Sliding-Window Aggregation
inferred← citeshttps://doi.org/10.5555/314613.314842openalex-snapshot
Finger search trees with constant insertion time
inferred← citeshttps://doi.org/10.5555/545381.545385openalex-snapshot
A locality-preserving cache-oblivious dynamic dictionary
inferred← citeshttps://doi.org/10.7146/brics.v3i28.20009openalex-snapshot
The Buffer Tree: A New Technique for Optimal I/O Algorithms
inferred← citeshttps://doi.org/10.7146/brics.v9i13.21731openalex-snapshot
Solving the String Statistics Problem in Time O(n log n)
inferred← citeshttps://doi.org/10.7155/jgaa.00209openalex-snapshot
Finding the Most Relevant Fragments in Networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.