On the public citation graph

Nearly optimal binary search trees

https://doi.org/10.1007/bf00264563
0 signed · 114 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00264289openalex-snapshot
Optimum binary search trees
inferredcites →https://doi.org/10.1007/bf00289510openalex-snapshot
Least upper bound on the cost of optimum binary search trees
inferredcites →https://doi.org/10.1145/800116.803774openalex-snapshot
Two applications of a probabilistic search technique
inferredcites →https://doi.org/10.1147/rd.172.0101openalex-snapshot
Bounds for Weight Balanced 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/3-540-07407-4_4openalex-snapshot
Best possible bounds on the weighted path length of optimum binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_25openalex-snapshot
Dynamic Binary Search
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_131openalex-snapshot
Tree-structures for set manipulation problems
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_16openalex-snapshot
The analysis of search trees: A survey
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_31openalex-snapshot
Efficient Expected-Case Algorithms for Planar Point Location
inferred← citeshttps://doi.org/10.1007/3-540-50171-1_10openalex-snapshot
On using conditional rotation operations to adaptively structure binary search trees
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-57811-0_13openalex-snapshot
Efficient reorganization of binary search trees
inferred← citeshttps://doi.org/10.1007/978-3-030-92068-5_4openalex-snapshot
A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs
inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_7openalex-snapshot
Old and New Results on Alphabetic Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_15openalex-snapshot
The Power and Limitations of Static Binary Search Trees with Lazy Finger
inferred← citeshttps://doi.org/10.1007/978-3-319-40253-6_22openalex-snapshot
Towards Efficient Fully Randomized Message-Locked Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_55openalex-snapshot
New Ways to Construct Binary Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-87473-7_1openalex-snapshot
Query Responsive Index Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_21openalex-snapshot
Efficient Construction of Near-Optimal Binary and Multiway Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_7openalex-snapshot
Reflections on Optimal and Nearly Optimal Binary Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_11openalex-snapshot
Priority Range Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_10openalex-snapshot
A History of Distribution-Sensitive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_65openalex-snapshot
Biased Predecessor Search
inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_22openalex-snapshot
Binary Search Trees: Average and Worst Case Behavior (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-95388-0_3openalex-snapshot
Realisierung von operationalen Schnittstellen
inferred← citeshttps://doi.org/10.1007/bf00264017openalex-snapshot
On the max-entropy rule for a binary search tree
inferred← citeshttps://doi.org/10.1007/bf00269807openalex-snapshot
Binary search trees in secondary memory
inferred← citeshttps://doi.org/10.1007/bf00288540openalex-snapshot
Optimum multiway search trees
inferred← citeshttps://doi.org/10.1007/bf00289093openalex-snapshot
Dynamic weighted binary search trees
inferred← citeshttps://doi.org/10.1007/bf00289143openalex-snapshot
Generalized binary split trees
inferred← citeshttps://doi.org/10.1007/bf00289410openalex-snapshot
Performances of an algorithm constructing a nearly optimal binary tree
inferred← citeshttps://doi.org/10.1007/bfb0029563openalex-snapshot
Self-organizing data structures
inferred← citeshttps://doi.org/10.1007/bfb0045096openalex-snapshot
Construction of nearly optimal multiway trees
inferred← citeshttps://doi.org/10.1007/bfb0120912openalex-snapshot
Optimization problems arising from the incorporation of split values in search trees
inferred← citeshttps://doi.org/10.1007/s00224-018-9881-2openalex-snapshot
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
inferred← citeshttps://doi.org/10.1007/s00446-019-00351-5openalex-snapshot
Demand-aware network designs of bounded degree
inferred← citeshttps://doi.org/10.1007/s00453-001-0057-zopenalex-snapshot
Efficient Reorganization of Binary Search Trees
inferred← citeshttps://doi.org/10.1007/s00453-007-9060-3openalex-snapshot
Dynamic Hotlinks
inferred← citeshttps://doi.org/10.1007/s00453-010-9440-yopenalex-snapshot
Biased Range Trees
inferred← citeshttps://doi.org/10.1007/s00453-015-0075-xopenalex-snapshot
Certifying 3-Edge-Connectivity
inferred← citeshttps://doi.org/10.1007/s00453-016-0146-7openalex-snapshot
Biased Predecessor Search
inferred← citeshttps://doi.org/10.1007/s00453-016-0224-xopenalex-snapshot
The Power and Limitations of Static Binary Search Trees with Lazy Finger
inferred← citeshttps://doi.org/10.1007/s00453-019-00604-6openalex-snapshot
Extensions of Self-Improving Sorters
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90143-5openalex-snapshot
Greedy binary search trees are nearly optimal
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90071-0openalex-snapshot
Growing nearly optimal binary search trees
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90212-ropenalex-snapshot
On binary search trees
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90031-9openalex-snapshot
Universal retrieval trees
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90052-6openalex-snapshot
A subquadratic algorithm for constructing approximately optimal binary search trees
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90064-5openalex-snapshot
Schranken fur balanced trees bei ausgewogenen verteilungen
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00153-0openalex-snapshot
New lower bounds on the cost of binary search trees
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50038-1openalex-snapshot
ENHANCING DATA RETRIEVAL USING ARTIFICIALLY SYNTHESIZED QUERIES
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50011-4openalex-snapshot
Data Structures
inferred← citeshttps://doi.org/10.1016/j.amc.2007.02.052openalex-snapshot
A new genetic approach to construct near-optimal binary search trees
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104707openalex-snapshot
On the cost of unsuccessful searches in search trees with two-way comparisons
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.014openalex-snapshot
Restructuring binary search trees revisited
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.08.012openalex-snapshot
Assembling approximately optimal binary search trees efficiently using arithmetics
inferred← citeshttps://doi.org/10.1016/j.peva.2021.102238openalex-snapshot
Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.020openalex-snapshot
A study on splay trees
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80013-9openalex-snapshot
Implicit data structures for weighted elements
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-0255(96)00135-1openalex-snapshot
Optimal insertion in two-dimensional arrays
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00262-6openalex-snapshot
A strategy for searching with different access costs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxh073openalex-snapshot
Self-Adjusting of Ternary Search Tries Using Conditional Rotations and Randomized Heuristics
inferred← citeshttps://doi.org/10.1109/69.234780openalex-snapshot
Adaptive structuring of binary search trees using conditional rotations
inferred← citeshttps://doi.org/10.1109/focs.2015.32openalex-snapshot
Pattern-Avoiding Access in Binary Search Trees
inferred← citeshttps://doi.org/10.1109/ipdps.2013.40openalex-snapshot
Locally Self-Adjusting Tree Networks
inferred← citeshttps://doi.org/10.1109/p2p.2013.6688721openalex-snapshot
OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs
inferred← citeshttps://doi.org/10.1109/sfcs.1976.26openalex-snapshot
Self-organizing binary search trees
inferred← citeshttps://doi.org/10.1109/sfcs.1981.19openalex-snapshot
Implicit data structures for the weighted dictionary problem
inferred← citeshttps://doi.org/10.1109/tifs.2016.2622013openalex-snapshot
Secure and Efficient Cloud Data Deduplication With Randomized Tag
inferred← citeshttps://doi.org/10.1109/tit.2024.3428699openalex-snapshot
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
inferred← citeshttps://doi.org/10.1109/tnet.2015.2410313openalex-snapshot
SplayNet: Towards Locally Self-Adjusting Networks
inferred← citeshttps://doi.org/10.1137/0206017openalex-snapshot
A Best Possible Bound for The Weighted Path Length of Binary Search Trees
inferred← citeshttps://doi.org/10.1137/0208007openalex-snapshot
Heuristics That Dynamically Organize Data Structures
inferred← citeshttps://doi.org/10.1137/0213020openalex-snapshot
Self-Organizing Heuristics for Implicit Data Structures
inferred← citeshttps://doi.org/10.1137/0214041openalex-snapshot
Biased Search Trees
inferred← citeshttps://doi.org/10.1137/1.9781611973068.54openalex-snapshot
Biased Range Trees
inferred← citeshttps://doi.org/10.1137/1.9781611973730.121openalex-snapshot
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
inferred← citeshttps://doi.org/10.1137/1.9781611977073.75openalex-snapshot
Splay trees on trees
inferred← citeshttps://doi.org/10.1137/1.9781611977929.4openalex-snapshot
Fast and simple unrooted dynamic forests
inferred← citeshttps://doi.org/10.1137/130936889openalex-snapshot
Random Access to Grammar-Compressed Strings and Trees
inferred← citeshttps://doi.org/10.1137/s0097539700381991openalex-snapshot
On Binary Searching with Nonuniform Costs
inferred← citeshttps://doi.org/10.1142/s0218195912600084openalex-snapshot
A STATIC OPTIMALITY TRANSFORMATION WITH APPLICATIONS TO PLANAR POINT LOCATION
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1998196.1998200openalex-snapshot
A static optimality transformation with applications to planar point location
inferred← citeshttps://doi.org/10.1145/2229163.2229173openalex-snapshot
Entropy, triangulation, and point location in planar subdivisions
inferred← citeshttps://doi.org/10.1145/3039241openalex-snapshot
Property Testing on Product Distributions
inferred← citeshttps://doi.org/10.1145/322092.322094openalex-snapshot
Self-Organizing Binary Search Trees
inferred← citeshttps://doi.org/10.1145/3310165.3310170openalex-snapshot
Toward demand-aware networking
inferred← citeshttps://doi.org/10.1145/3531227openalex-snapshot
A Generalization of Self-Improving Algorithms
inferred← citeshttps://doi.org/10.1145/356631.356634openalex-snapshot
Binary Search Trees and File Organization
inferred← citeshttps://doi.org/10.1145/3595180openalex-snapshot
Competitive Online Search Trees on Trees
inferred← citeshttps://doi.org/10.1145/3634737.3637661openalex-snapshot
Pairwise and Parallel: Enhancing the Key Mismatch Attacks on Kyber and Beyond
inferred← citeshttps://doi.org/10.1145/800127.804129openalex-snapshot
Dynamic Binary Search Trees
inferred← citeshttps://doi.org/10.1145/800176.810007openalex-snapshot
An empirical evaluation of algorithms for dynamically maintaining binary search trees
inferred← citeshttps://doi.org/10.17760/d20253673openalex-snapshot
The nearly optimal n-ary search tree
inferred← citeshttps://doi.org/10.22215/etd/2006-06665openalex-snapshot
Tries in data retrieval and syntactic pattern recognition
inferred← citeshttps://doi.org/10.22215/etd/2012-09696openalex-snapshot
Exploiting non-uniform query distributions in data structuring problems
inferred← citeshttps://doi.org/10.22215/etd/2015-10682openalex-snapshot
Biased Nearest Neighbour Search
inferred← citeshttps://doi.org/10.3390/a18080452openalex-snapshot
Bayesian Binary Search
inferred← citeshttps://doi.org/10.4230/lipics.swat.2022.14openalex-snapshot
The Diameter of Caterpillar Associahedra
inferred← citeshttps://doi.org/10.48550/arxiv.0804.0940openalex-snapshot
Optimum Binary Search Trees on the Hierarchical Memory Model
inferred← citeshttps://doi.org/10.48550/arxiv.1009.3527openalex-snapshot
Priority Range Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6897openalex-snapshot
The Power and Limitations of Static Binary Search Trees with Lazy Finger
inferred← citeshttps://doi.org/10.48550/arxiv.1705.06024openalex-snapshot
Demand-Aware Network Designs of Bounded Degree
inferred← citeshttps://doi.org/10.48550/arxiv.1807.02935openalex-snapshot
Toward Demand-Aware Networking: A Theory for Self-Adjusting Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1904.03263openalex-snapshot
ReNets: Toward Statically Optimal Self-Adjusting Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1906.08448openalex-snapshot
Extensions of Self-Improving Sorters
inferred← citeshttps://doi.org/10.48550/arxiv.2012.13698openalex-snapshot
Arithmetic Binary Search Trees: Static Optimality in the Matching Model
inferred← citeshttps://doi.org/10.5555/1496770.1496824openalex-snapshot
Biased range trees
inferred← citeshttps://doi.org/10.5555/2722129.2722250openalex-snapshot
Property testing on product distributions: optimal testers for bounded derivative properties
inferred← citeshttps://doi.org/10.5555/313852.313880openalex-snapshot
Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
inferred← citeshttps://doi.org/10.5555/365411.365796openalex-snapshot
On binary searching with non-uniform costs
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.