On the public citation graph
A balanced search tree with O(1) worst-case update time
0 signed · 60 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/bf00288968openalex-snapshot
A new data structure for representing sorted lists
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(81)90093-4openalex-snapshot
Worst-case optimal insertion and deletion methods for decomposable searching problems
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.1007/11602613_33openalex-snapshot
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour
inferred← citeshttps://doi.org/10.1007/11785293_10openalex-snapshot
Sorting by Merging or Merging by Sorting?
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_3openalex-snapshot
Time and Space Efficient Multi-method Dispatching
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-48523-6_34openalex-snapshot
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
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-56939-1_58openalex-snapshot
Dynamic interpolation search in o(log log n) time
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_256openalex-snapshot
Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
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-61422-2_116openalex-snapshot
The Randomized Complexity of Maintaining the Minimum
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_151openalex-snapshot
Binary search trees: How low can you go?
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_4openalex-snapshot
De-amortization of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_31openalex-snapshot
Improved Bounds for Finger Search on a RAM
inferred← citeshttps://doi.org/10.1007/978-3-540-75185-4_15openalex-snapshot
Indexing Mobile Objects on the Plane Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_21openalex-snapshot
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_23openalex-snapshot
Skip Lift: A Probabilistic Alternative to Red-Black Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-23088-2_5openalex-snapshot
NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees
inferred← citeshttps://doi.org/10.1007/s00236-019-00335-9openalex-snapshot
Red–black trees with constant update time
inferred← citeshttps://doi.org/10.1007/s00453-018-0528-0openalex-snapshot
A Simple Greedy Algorithm for Dynamic Graph Orientation
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/j.compeleceng.2011.12.009openalex-snapshot
Partially persistent B-trees with constant worst-case update time
inferred← citeshttps://doi.org/10.1016/j.datak.2008.06.009openalex-snapshot
A new approach on indexing mobile objects on the plane
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104465openalex-snapshot
Dynamic Interpolation Search revisited
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.12.008openalex-snapshot
Multidimensional heaps and complementary range searching
inferred← citeshttps://doi.org/10.1016/j.jda.2010.08.001openalex-snapshot
ISB-tree: A new indexing scheme with efficient expected behaviour
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.017openalex-snapshot
Skip lift: A probabilistic alternative to red–black trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.014openalex-snapshot
Dynamic 3-sided planar range queries with expected doubly-logarithmic time
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/s0927-0507(05)80204-xopenalex-snapshot
Chapter 7 Fundamental algorithms and data structures
inferred← citeshttps://doi.org/10.1109/focs.2012.79openalex-snapshot
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List
inferred← citeshttps://doi.org/10.1109/fscs.1990.89528openalex-snapshot
New results on dynamic planar point location
inferred← citeshttps://doi.org/10.1137/0221057openalex-snapshot
New Results on Dynamic Planar Point Location
inferred← citeshttps://doi.org/10.1137/1.9781611974782.28openalex-snapshot
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
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/s0097539793254376openalex-snapshot
Dynamic Trees and Dynamic Point Location
inferred← citeshttps://doi.org/10.1145/103418.103472openalex-snapshot
Dynamic trees and dynamic point location
inferred← citeshttps://doi.org/10.1145/1060590.1060607openalex-snapshot
Worst-case update times for fully-dynamic all-pairs shortest paths
inferred← citeshttps://doi.org/10.1145/1236457.1236460openalex-snapshot
Dynamic ordered sets with exponential search trees
inferred← citeshttps://doi.org/10.1145/1643823.1643863openalex-snapshot
An experimental performance comparison for indexing mobile objects on the plane
inferred← citeshttps://doi.org/10.1145/1804669.1804676openalex-snapshot
Efficient processing of 3-sided range queries with probabilistic guarantees
inferred← citeshttps://doi.org/10.1145/335305.335344openalex-snapshot
Tight(er) worst-case bounds on dynamic searching and priority queues
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/509907.509991openalex-snapshot
Optimal finger search trees in the pointer machine
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.4018/978-1-4666-1577-9.ch019openalex-snapshot
An Experimental Performance Comparison for Indexing Mobile Objects on the Plane
inferred← citeshttps://doi.org/10.4018/joci.2010100105openalex-snapshot
An Experimental Performance Comparison for Indexing Mobile Objects on the Plane
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.33openalex-snapshot
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.0805.2671openalex-snapshot
Finger Indexed Sets: New Approaches
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.5555/1109557.1109603openalex-snapshot
Implicit dictionaries with O(1) modifications per update and fast search
inferred← citeshttps://doi.org/10.5555/127787.127809openalex-snapshot
Persistence, amortization and randomization
inferred← citeshttps://doi.org/10.5555/314613.314842openalex-snapshot
Finger search trees with constant insertion time
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.