On the public citation graph
On random 2?3 trees
0 signed · 190 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/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
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-09118-1_9openalex-snapshot
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_39openalex-snapshot
A uniform approach to balanced binary and multiway trees
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-45876-x_42openalex-snapshot
Aggregate Processing of Planar Points
inferred← citeshttps://doi.org/10.1007/3-540-46506-5_13openalex-snapshot
Performance Analysis of Database Systems
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_85openalex-snapshot
Expected behaviour analysis of AVL trees
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_67openalex-snapshot
Average case analysis of algorithms using matrix recurrences
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_73openalex-snapshot
Maintaining bounded disorder files in multiprocessor multi-disk environments
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_70openalex-snapshot
Analysis of bounded disorder
inferred← citeshttps://doi.org/10.1007/3-540-60392-1_35openalex-snapshot
Range queries involving spatial relations: A performance analysis
inferred← citeshttps://doi.org/10.1007/978-1-4613-9883-7_1openalex-snapshot
A Survey of File Organizations and Performance
inferred← citeshttps://doi.org/10.1007/978-3-031-00123-9_44openalex-snapshot
HATree: A Hotness-Aware Tree Index with In-Node Hotspot Cache for NVM/DRAM-Based Hybrid Memory Architecture
inferred← citeshttps://doi.org/10.1007/978-3-0348-0609-1_3openalex-snapshot
Empirical Clustering and Classic Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0_3openalex-snapshot
Arbres, algorithmes et données
inferred← citeshttps://doi.org/10.1007/978-3-322-91882-6_8openalex-snapshot
Externes Suchen und Sortieren
inferred← citeshttps://doi.org/10.1007/978-3-322-92105-5_8openalex-snapshot
Externes Suchen und Sortieren
inferred← citeshttps://doi.org/10.1007/978-3-642-37688-7_2openalex-snapshot
Inverted File-Based General Metric Space Indexing for Quality-Aware Similarity Search in Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-642-70640-0_15openalex-snapshot
Quantitative Bewertung Fehlertoleranter Hashtabellen-Implementierungen in Datenbanksystemen durch Simulationsreihen
inferred← citeshttps://doi.org/10.1007/978-3-642-87472-7_15openalex-snapshot
Quantitative Bewertung Fehlertoleranter B*-Baum-Implementierungen in Datenbanksystemen Durch Simulationsreihen
inferred← citeshttps://doi.org/10.1007/978-94-011-4122-2_8openalex-snapshot
Trees for Multilevel Memory
inferred← citeshttps://doi.org/10.1007/978-981-19-8069-5_6openalex-snapshot
Improving the Storage Utilization of 0-Complete Trees as Index Structures
inferred← citeshttps://doi.org/10.1007/bf00263296openalex-snapshot
Improving time and space efficiency in generalized binary search trees
inferred← citeshttps://doi.org/10.1007/bf00263500openalex-snapshot
A model of the dynamic behavior of B-trees
inferred← citeshttps://doi.org/10.1007/bf00263927openalex-snapshot
Storage utilization in B *-trees with a generalized overflow technique
inferred← citeshttps://doi.org/10.1007/bf00276022openalex-snapshot
Modeling splits in file structures
inferred← citeshttps://doi.org/10.1007/bf00289146openalex-snapshot
Expected behaviour of B+-trees under random insertions
inferred← citeshttps://doi.org/10.1007/bf00289710openalex-snapshot
Some average performance measures for the B-tree
inferred← citeshttps://doi.org/10.1007/bf00299632openalex-snapshot
Transforming Unbalanced Multiway trees into a practical external data structure
inferred← citeshttps://doi.org/10.1007/bf00996136openalex-snapshot
Query costs in HB(1) trees versus 2?3 trees
inferred← citeshttps://doi.org/10.1007/bf00996801openalex-snapshot
A comparative study of 2-3 trees and AVL trees
inferred← citeshttps://doi.org/10.1007/bf01186643openalex-snapshot
Variance of storage requirements for B+-trees
inferred← citeshttps://doi.org/10.1007/bf01193577openalex-snapshot
Unbalanced multiway trees improved by partial expansions
inferred← citeshttps://doi.org/10.1007/bf01263046openalex-snapshot
Performance of B+ tree concurrency control algorithms
inferred← citeshttps://doi.org/10.1007/bf01932772openalex-snapshot
Higher order analysis of random 1–2 brother trees
inferred← citeshttps://doi.org/10.1007/bf01933619openalex-snapshot
Binary search trees with limited rotation
inferred← citeshttps://doi.org/10.1007/bf01994883openalex-snapshot
Improved bounds for the expected behaviour of AVL trees
inferred← citeshttps://doi.org/10.1007/bf02136039openalex-snapshot
Average number of rotations and access cost in iR-trees
inferred← citeshttps://doi.org/10.1007/bf02254848openalex-snapshot
Aspects of insertion in random trees
inferred← citeshttps://doi.org/10.1007/bf02575768openalex-snapshot
Una struttura bidimensionale per la memorizzazione dei file trasposti
inferred← citeshttps://doi.org/10.1007/bfb0022161openalex-snapshot
An adaptive overflow technique for B-trees
inferred← citeshttps://doi.org/10.1007/bfb0032438openalex-snapshot
Performance of on-line index construction algorithms
inferred← citeshttps://doi.org/10.1007/bfb0035833openalex-snapshot
Functional equations for data structures
inferred← citeshttps://doi.org/10.1007/s002240000094openalex-snapshot
Asynchronous Shared Memory Search Structures
inferred← citeshttps://doi.org/10.1007/s00366-004-0283-5openalex-snapshot
Etree: a database-oriented method for generating large octree meshes
inferred← citeshttps://doi.org/10.1007/s00778-002-0067-8openalex-snapshot
Speeding up construction of PMR quadtree-based spatial indexes
inferred← citeshttps://doi.org/10.1007/s00778-008-0094-1openalex-snapshot
B-tries for disk-based string management
inferred← citeshttps://doi.org/10.1007/s00778-019-00555-yopenalex-snapshot
LSM-based storage techniques: a survey
inferred← citeshttps://doi.org/10.1007/s00778-023-00823-yopenalex-snapshot
Morphtree: a polymorphic main-memory learned index for dynamic workloads
inferred← citeshttps://doi.org/10.1007/s11704-023-3344-xopenalex-snapshot
Optimizing B+-tree for hybrid memory with in-node hotspot cache and eADR awareness
inferred← citeshttps://doi.org/10.1007/s11771-999-0037-zopenalex-snapshot
Sequential retrieval of B-trees and a file structure with a dense B-tree index
inferred← citeshttps://doi.org/10.1007/s42979-024-03268-4openalex-snapshot
Improving the Storage Utilization of 0-Complete Trees
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90127-3openalex-snapshot
Some observations on random 2–3 trees
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90100-xopenalex-snapshot
Insertion-safeness in balanced trees
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90085-1openalex-snapshot
Approximate storage utilisation of B-trees: A simple derivation and generalisations
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90123-6openalex-snapshot
On the use of Extendible Hashing without hashing
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90101-8openalex-snapshot
Approximate storage utilization of B-trees
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90029-9openalex-snapshot
Modeling B-tree insertion activity
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90215-8openalex-snapshot
Some average measures in m-ary search trees
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90063-4openalex-snapshot
HCB_tree: a height compressed B_tree for parallel processing
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90043-wopenalex-snapshot
Performance analysis of file organizations that use multi-bucket data leaves
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90020-wopenalex-snapshot
B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90269-gopenalex-snapshot
Algorithms for sequential generation of combinatorial structures
inferred← citeshttps://doi.org/10.1016/0169-023x(95)00034-popenalex-snapshot
Indexing temporal data using existing B+ -trees
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90023-0openalex-snapshot
Analysis of the space of search trees under the random insertion algorithm
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90018-3openalex-snapshot
On the average number of rebalancing operations in weight-balanced trees
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90145-7openalex-snapshot
(g0, g1, …, gk)-trees and unary OL systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90040-xopenalex-snapshot
Balance in AVL trees and space cost of brother trees
inferred← citeshttps://doi.org/10.1016/0306-4379(87)90022-6openalex-snapshot
Achieving minimum height for block split tree structured files
inferred← citeshttps://doi.org/10.1016/0306-4379(89)90001-xopenalex-snapshot
An analysis of B-trees and their variants
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90038-bopenalex-snapshot
Using multi-bucket data leaves with overflow chains—performance analysis
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00125-iopenalex-snapshot
Space saving generalization of B-trees with 23 utilization
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/j.camwa.2004.03.005openalex-snapshot
Search trees and Stirling numbers
inferred← citeshttps://doi.org/10.1016/j.datak.2006.08.001openalex-snapshot
Processing partially specified queries over high-dimensional databases
inferred← citeshttps://doi.org/10.1016/j.is.2012.02.002openalex-snapshot
PBFilter: A flash-based indexing scheme for embedded systems
inferred← citeshttps://doi.org/10.1016/j.jss.2011.08.005openalex-snapshot
Using compressed index structures for processing moving objects in large spatio-temporal databases
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115821openalex-snapshot
On the histories of B-trees
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/s0020-0190(97)00184-1openalex-snapshot
On rotations in fringe-balanced binary trees
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10024-5openalex-snapshot
Indexing transaction time databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00060-8openalex-snapshot
Direction relations and two-dimensional range queries: optimisation techniques
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00318-3openalex-snapshot
Fringe analysis of synchronized parallel insertion algorithms in 2–3 Trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00061-8openalex-snapshot
Bounded disorder: The effect of the index
inferred← citeshttps://doi.org/10.1017/s026996480000084xopenalex-snapshot
Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
inferred← citeshttps://doi.org/10.1017/s0269964800003776openalex-snapshot
Toward a Formal Derivation of the Expected Behavior of Prefix B-Trees
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1080/03155986.1982.11731849openalex-snapshot
A Look at Symmetric Binary B-Trees
inferred← citeshttps://doi.org/10.1090/dimacs/050/11openalex-snapshot
S(b)-tree library: An efficient way of indexing data
inferred← citeshttps://doi.org/10.1093/comjnl/43.5.420openalex-snapshot
Fringe Analysis of 2-3 Trees with Lazy Parent Split
inferred← citeshttps://doi.org/10.1109/12.57061openalex-snapshot
Parallel processing of large node B-trees
inferred← citeshttps://doi.org/10.1109/69.334867openalex-snapshot
A combined method for maintaining large indices in multiprocessor multidisk environments
inferred← citeshttps://doi.org/10.1109/69.87964openalex-snapshot
Performance of B/sup +/-trees with partial expansions
inferred← citeshttps://doi.org/10.1109/jcit.1990.128265openalex-snapshot
An interleaved file system for a highly distributed MIMD architecture
inferred← citeshttps://doi.org/10.1109/jcit.1990.128320openalex-snapshot
Overlapping B+trees for temporal data
inferred← citeshttps://doi.org/10.1109/pdis.1991.183086openalex-snapshot
An efficient method for distributing search structures
inferred← citeshttps://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferred← citeshttps://doi.org/10.1109/tkde.2003.1198400openalex-snapshot
Persistently cached B-trees
inferred← citeshttps://doi.org/10.1109/tkde.2004.13openalex-snapshot
Performance analysis of R*-trees with arbitrary node extents
inferred← citeshttps://doi.org/10.1109/tkde.2004.93openalex-snapshot
Range aggregate processing in spatial databases
inferred← citeshttps://doi.org/10.1109/tse.1987.233491openalex-snapshot
Two Access Methods Using Compact Binary Trees
inferred← citeshttps://doi.org/10.1109/vldb.1979.718150openalex-snapshot
On Optimistic Methods For Concurrency Control
inferred← citeshttps://doi.org/10.1137/0208003openalex-snapshot
A Partial Analysis of Random Height-Balanced Trees
inferred← citeshttps://doi.org/10.1137/0209045openalex-snapshot
Design and Analysis of a Data Structure for Representing Sorted Lists
inferred← citeshttps://doi.org/10.1137/0210041openalex-snapshot
Key Comparison Optimal 2-3 Trees with Maximum Utilization
inferred← citeshttps://doi.org/10.1137/0211061openalex-snapshot
A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
inferred← citeshttps://doi.org/10.1137/0606041openalex-snapshot
Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
inferred← citeshttps://doi.org/10.1137/s009753979223023xopenalex-snapshot
The Joint Distribution of Elastic Buckets in Multiway Search Trees
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1055709.1055713openalex-snapshot
Historical spatio-temporal aggregation
inferred← citeshttps://doi.org/10.1145/1132863.1132870openalex-snapshot
Indexing the past, present, and anticipated future positions of moving objects
inferred← citeshttps://doi.org/10.1145/113413.113428openalex-snapshot
Performance analysis of file organizations that use multi-bucket data leaves with partial expansions (extended abstract)
inferred← citeshttps://doi.org/10.1145/115790.115860openalex-snapshot
Performance of B-tree concurrency control algorithms
inferred← citeshttps://doi.org/10.1145/119995.115860openalex-snapshot
Performance of B-tree concurrency control algorithms
inferred← citeshttps://doi.org/10.1145/12047.12049openalex-snapshot
Partial expansions for file organizations with an index
inferred← citeshttps://doi.org/10.1145/151284.151289openalex-snapshot
Performance analysis of file organizations that use multibucket data leaves with partial expansions
inferred← citeshttps://doi.org/10.1145/1516360.1516429openalex-snapshot
A sequential indexing scheme for flash-based embedded systems
inferred← citeshttps://doi.org/10.1145/2882903.2915222openalex-snapshot
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes
inferred← citeshttps://doi.org/10.1145/303976.304009openalex-snapshot
Locality preserving dictionaries
inferred← citeshttps://doi.org/10.1145/308386.308424openalex-snapshot
Analysis of bounded disorder file organization
inferred← citeshttps://doi.org/10.1145/319540.319564openalex-snapshot
New file organization based on dynamic hashing
inferred← citeshttps://doi.org/10.1145/319540.319565openalex-snapshot
Time- and space-optimality in B-trees
inferred← citeshttps://doi.org/10.1145/319566.319567openalex-snapshot
On optimistic methods for concurrency control
inferred← citeshttps://doi.org/10.1145/319628.319665openalex-snapshot
Analysis of index-sequential files with overflow chaining
inferred← citeshttps://doi.org/10.1145/319830.319837openalex-snapshot
Bounded index exponential hashing
inferred← citeshttps://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferred← citeshttps://doi.org/10.1145/320435.320450openalex-snapshot
An efficient model for representing and analyzing B-trees
inferred← citeshttps://doi.org/10.1145/335191.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferred← citeshttps://doi.org/10.1145/3654948openalex-snapshot
Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction
inferred← citeshttps://doi.org/10.1145/3673038.3673088openalex-snapshot
DiStore: A Fully Memory Disaggregation Friendly Key-Value Store with Improved Tail Latency and Space Efficiency
inferred← citeshttps://doi.org/10.1145/3707641openalex-snapshot
HLN-Tree: A memory-efficient B+-Tree with huge leaf nodes and locality predictors
inferred← citeshttps://doi.org/10.1145/3801894openalex-snapshot
Bounding the Fragmentation of B-Trees Subject to Batched Insertions
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1145/3857.3858openalex-snapshot
Height-balanced trees of order (β, γ, δ)
inferred← citeshttps://doi.org/10.1145/581751.581754openalex-snapshot
Cost models for overlapping and multiversion structures
inferred← citeshttps://doi.org/10.1145/582250.582281openalex-snapshot
Experiments with B-tree reorganization
inferred← citeshttps://doi.org/10.1145/582318.582323openalex-snapshot
B+ trees and indexed sequential files
inferred← citeshttps://doi.org/10.1145/588011.588037openalex-snapshot
A class of data structures for associative searching
inferred← citeshttps://doi.org/10.1145/5922.5923openalex-snapshot
Order-preserving key transformations
inferred← citeshttps://doi.org/10.1145/602259.602265openalex-snapshot
An empirical comparison of B-trees, compact B-trees and multiway trees
inferred← citeshttps://doi.org/10.1145/76902.76908openalex-snapshot
A unified analysis of batched searching of sequential and tree-structured files
inferred← citeshttps://doi.org/10.1145/781027.781063openalex-snapshot
Effect of node size on the performance of cache-conscious B + -trees
inferred← citeshttps://doi.org/10.1145/800133.804328openalex-snapshot
A representation for linear lists with movable fingers
inferred← citeshttps://doi.org/10.1145/885651.781063openalex-snapshot
Effect of node size on the performance of cache-conscious B + -trees
inferred← citeshttps://doi.org/10.1145/971697.602265openalex-snapshot
An empirical comparison of B-trees, compact B-trees and multiway trees
inferred← citeshttps://doi.org/10.1184/r1/6605516openalex-snapshot
Extracting Hexahedral Mesh Structures from Balanced Linear Octrees
inferred← citeshttps://doi.org/10.12794/metadc103298openalex-snapshot
Investigating the Extractive Summarization of Literary Novels
inferred← citeshttps://doi.org/10.14778/3494124.3494132openalex-snapshot
An experimental evaluation and investigation of waves of misery in r-trees
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.18419/opus-3589openalex-snapshot
Supporting multi-tenancy in Relational Database Management Systems for OLTP-style software as a service applications
inferred← citeshttps://doi.org/10.21248/gups.62802openalex-snapshot
Some results on the theory and practice of algorithms
inferred← citeshttps://doi.org/10.21936/si2009_v30.n3b.435openalex-snapshot
Zaawansowane hurtownie danych
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5192openalex-snapshot
Modeling of Physical Database Design and Performance Analysis With Emphasis on VSAM Files.
inferred← citeshttps://doi.org/10.4304/jcp.9.10.2342-2351openalex-snapshot
Recursive Updates in Copy-on-write File Systems - Modeling and Analysis
inferred← citeshttps://doi.org/10.46298/dmtcs.3506openalex-snapshot
Some exactly solvable models of urn process theory
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02964openalex-snapshot
Central limit theorem analogues for multicolour urn models
inferred← citeshttps://doi.org/10.48550/arxiv.2004.10360openalex-snapshot
Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems (Extended Version)
inferred← citeshttps://doi.org/10.5120/ijca2015906322openalex-snapshot
Map vs. Unordered Map: An Analysis on Large Datasets
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.