On the public citation graph
On the deque conjecture for the splay algorithm
0 signed · 35 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/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bf02579253openalex-snapshot
Sequential access in splay trees takes linear time
inferredcites →https://doi.org/10.1016/0020-0190(82)90083-7openalex-snapshot
A note on some tree similarity measures
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0928904-4openalex-snapshot
Rotation distance, triangulations, and hyperbolic geometry
inferredcites →https://doi.org/10.1137/0218004openalex-snapshot
Lower Bounds for Accessing Binary Search Trees with Rotations
inferredcites →https://doi.org/10.1145/100216.100218openalex-snapshot
On the dynamic finger conjecture for splay trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_263openalex-snapshot
O(log log n)‐competitive Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_263openalex-snapshot
O(log log n)-Competitive Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_37openalex-snapshot
Splaying Preorders and Postorders
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_13openalex-snapshot
Greedy Is an Almost Optimal Deque
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_10openalex-snapshot
Distribution-Sensitive Binomial Queues
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_263-2openalex-snapshot
O(log logn)-Competitive Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_67openalex-snapshot
A Self-adjusting Data Structure for Multidimensional Point Sets
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.02.001openalex-snapshot
A direct algorithm for restricted rotation distance
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.019openalex-snapshot
On the sequential access theorem and deque conjecture for splay trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.022openalex-snapshot
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.002openalex-snapshot
A unified access bound on comparison-based dynamic dictionaries
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00283-7openalex-snapshot
Right-arm rotation distance between binary trees
inferred← citeshttps://doi.org/10.1080/00207160500069870openalex-snapshot
An efficient algorithm for estimating rotation distance between two binary trees
inferred← citeshttps://doi.org/10.1080/00207160701435219openalex-snapshot
Effective splaying with restricted rotations
inferred← citeshttps://doi.org/10.1093/comjnl/47.2.259openalex-snapshot
Untangling Binary Trees via Rotations
inferred← citeshttps://doi.org/10.1137/140968574openalex-snapshot
Three Generalizations of Davenport--Schinzel Sequences
inferred← citeshttps://doi.org/10.1137/18m1195188openalex-snapshot
Smooth Heaps and a Dual View of Self-Adjusting Data Structures
inferred← citeshttps://doi.org/10.1145/1455248.1455252openalex-snapshot
Weak ε-nets and interval chains
inferred← citeshttps://doi.org/10.1145/1706591.1706597openalex-snapshot
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
inferred← citeshttps://doi.org/10.1184/r1/6605009openalex-snapshot
Dynamic optimality and multi-splay trees
inferred← citeshttps://doi.org/10.37236/4768openalex-snapshot
A Relationship Between Generalized Davenport-Schinzel Sequences and Interval Chains
inferred← citeshttps://doi.org/10.48550/arxiv.0707.2160openalex-snapshot
Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0063openalex-snapshot
Improved bounds on maximum sets of letters in sequences with forbidden alternations
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5709openalex-snapshot
Three Generalizations of Davenport-Schinzel Sequences
inferred← citeshttps://doi.org/10.5555/1109557.1109600openalex-snapshot
O(log log n)-competitive dynamic binary search trees
inferred← citeshttps://doi.org/10.5555/1496770.1496771openalex-snapshot
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
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.