On the public citation graph
Binary Search Trees of Bounded Balance
0 signed · 249 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.1016/b978-1-4832-3187-7.50023-4openalex-snapshot
A TOP-DOWN ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL LEXICOGRAPHIC TREES††This research was supported in part by the National Research Council of Canada.
inferredcites →https://doi.org/10.1063/1.3034322openalex-snapshot
An Introduction to Probability Theory and Its Applications, Vol. 2
inferredcites →https://doi.org/10.1137/0121057openalex-snapshot
Optimal Computer Search Trees and Variable-Length Alphabetical Codes
inferredcites →https://doi.org/10.1145/321105.321108openalex-snapshot
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
inferredcites →https://doi.org/10.1145/321738.321739openalex-snapshot
Upper Bounds for the Total Path Length of Binary Trees
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.1002/spe.3433openalex-snapshot
Practical Adaptive Dynamic Bitvectors
inferred← citeshttps://doi.org/10.1002/spe.4380230403openalex-snapshot
An evaluation of self‐adjusting binary search tree techniques
inferred← citeshttps://doi.org/10.1002/spe.4380231106openalex-snapshot
ISA [k] trees: A class of binary search trees with minimal or near minimal internal path length
inferred← citeshttps://doi.org/10.1006/inco.1999.2811openalex-snapshot
Efficient Splitting and Merging Algorithms for Order Decomposable Problems
inferred← citeshttps://doi.org/10.1006/jagm.1994.1040openalex-snapshot
Dynamic Point Location in General Subdivisions
inferred← citeshttps://doi.org/10.1006/jagm.2000.1107openalex-snapshot
Incremental and Decremental Maintenance of Planar Width
inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot
Deciding Bisimilarity and Similarity for Probabilistic Processes
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-09118-1_9openalex-snapshot
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
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-10828-9_53openalex-snapshot
Trees as data and file structures
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-45749-6_17openalex-snapshot
Two Simplified Algorithms for Maintaining Order in a List
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_6openalex-snapshot
The Complexity of Rebalancing a Binary Search Tree
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_39openalex-snapshot
A New Method for Balancing Binary Search Trees
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-51295-0_123openalex-snapshot
The path length of binary trees
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_33openalex-snapshot
Improving partial rebuilding by using simple balance criteria
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_10openalex-snapshot
Optimal bounds on the dictionary problem
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_42openalex-snapshot
Updating almost complete trees or one level makes all the difference
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_19openalex-snapshot
Paging binary trees with external balancing
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_82openalex-snapshot
Fast updating of well-balanced trees
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_236openalex-snapshot
Balanced search trees made simple
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-58218-5_28openalex-snapshot
Parallel dynamic lowest common ancestors
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/978-1-4471-3054-3_19openalex-snapshot
Loops for Safety Critical Applications
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-030-24766-9_37openalex-snapshot
Splaying Preorders and Postorders
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_2openalex-snapshot
Verified Textbook Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_16openalex-snapshot
Adaptive Dynamic Bitvectors
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_20openalex-snapshot
Agglomerative Clustering of Growing Squares
inferred← citeshttps://doi.org/10.1007/978-3-322-92105-5_4openalex-snapshot
Datentypen zur Darstellung von Mengen
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-45072-6_5openalex-snapshot
Efficient Object-Relational Interval Management and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-73986-9_11openalex-snapshot
Fern: An Updatable Authenticated Dictionary Suitable for Distributed Caching
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-10631-6_84openalex-snapshot
Deletion without Rebalancing in Multiway Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_13openalex-snapshot
Efficient Top-k Queries for Orthogonal Ranges
inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_23openalex-snapshot
Neueintragung in binären Suchbäumen durch Verdrängung
inferred← citeshttps://doi.org/10.1007/978-3-642-95388-0_3openalex-snapshot
Realisierung von operationalen Schnittstellen
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_11openalex-snapshot
Balanced Circle Packings for Planar Graphs
inferred← citeshttps://doi.org/10.1007/bf00263296openalex-snapshot
Improving time and space efficiency in generalized binary search trees
inferred← citeshttps://doi.org/10.1007/bf00269807openalex-snapshot
Binary search trees in secondary memory
inferred← citeshttps://doi.org/10.1007/bf00276022openalex-snapshot
Modeling splits in file structures
inferred← citeshttps://doi.org/10.1007/bf00289018openalex-snapshot
Maintaining range trees in secondary memory
inferred← citeshttps://doi.org/10.1007/bf00289093openalex-snapshot
Dynamic weighted binary search trees
inferred← citeshttps://doi.org/10.1007/bf00289142openalex-snapshot
Maintaining order in a generalized linked list
inferred← citeshttps://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferred← citeshttps://doi.org/10.1007/bf00290147openalex-snapshot
Purely top-down updating algorithms for stratified search trees
inferred← citeshttps://doi.org/10.1007/bf00365315openalex-snapshot
Worst-case space and time complexity of recursive procedures
inferred← citeshttps://doi.org/10.1007/bf00996801openalex-snapshot
A comparative study of 2-3 trees and AVL trees
inferred← citeshttps://doi.org/10.1007/bf00999726openalex-snapshot
A comparison of iterative and defined classes of search trees
inferred← citeshttps://doi.org/10.1007/bf01213861openalex-snapshot
The complexity of on-line simulations between multidimensional turing machines and random access machines
inferred← citeshttps://doi.org/10.1007/bf01237235openalex-snapshot
Binary search trees of almost optimal height
inferred← citeshttps://doi.org/10.1007/bf02254848openalex-snapshot
Aspects of insertion in random trees
inferred← citeshttps://doi.org/10.1007/bfb0009658openalex-snapshot
Maintaining order in a generalized linked list
inferred← citeshttps://doi.org/10.1007/bfb0028570openalex-snapshot
Partially persistent search trees with transcript operations
inferred← citeshttps://doi.org/10.1007/bfb0035827openalex-snapshot
Getting back to the past in the union-find problem
inferred← citeshttps://doi.org/10.1007/bfb0035830openalex-snapshot
Maintaining range trees in secondary memory
inferred← citeshttps://doi.org/10.1007/bfb0036494openalex-snapshot
Maintaining order in a generalized linked list
inferred← citeshttps://doi.org/10.1007/bfb0100976openalex-snapshot
Towards optimal indexing for segment databases
inferred← citeshttps://doi.org/10.1007/pl00013303openalex-snapshot
Relaxed balance for search trees with local rebalancing
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-021-00873-0openalex-snapshot
Agglomerative Clustering of Growing Squares
inferred← citeshttps://doi.org/10.1007/s00453-026-01395-3openalex-snapshot
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments
inferred← citeshttps://doi.org/10.1007/s10994-021-06084-6openalex-snapshot
Maintaining AUC and H-measure over time
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90094-6openalex-snapshot
Implementing dictionaries using binary trees of very small height
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90053-3openalex-snapshot
On the intersection of Orthogonal objects
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90119-3openalex-snapshot
A data structure for dynamic range queries
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90100-1openalex-snapshot
A note on a new data structure for in-the-past queries
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90151-mopenalex-snapshot
Efficient dynamic algorithms for some geometric intersection problems
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90171-sopenalex-snapshot
Dynamic deferred data structuring
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90005-3openalex-snapshot
Height balance distribution of search trees
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90020-5openalex-snapshot
New trie data structures which support very fast search operations
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90034-2openalex-snapshot
Making data structures persistent
inferred← citeshttps://doi.org/10.1016/0096-0551(94)90004-3openalex-snapshot
Discrete loops and worst case performance
inferred← citeshttps://doi.org/10.1016/0196-6774(81)90033-xopenalex-snapshot
Finding intersection of rectangles by range search
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90003-3openalex-snapshot
The analysis of a fringe heuristic for binary search trees
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90024-1openalex-snapshot
Dynamic orthogonal segment intersection search
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90048-4openalex-snapshot
The rotation graph of binary trees is Hamiltonian
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(89)90119-9openalex-snapshot
Worst-case analysis of the set-union problem with extended backtracking
inferred← citeshttps://doi.org/10.1016/0306-4573(94)90013-2openalex-snapshot
Adaptive encoding for numerical data compression
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90053-8openalex-snapshot
The node visit cost of brother trees
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90058-8openalex-snapshot
Maintaining multiple representations of dynamic data structures
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50011-5openalex-snapshot
Geometric Data Structures
inferred← citeshttps://doi.org/10.1016/j.aam.2026.103158openalex-snapshot
A height-based metaconcept for rooted tree balance and its implications for the B1 index
inferred← citeshttps://doi.org/10.1016/j.akcej.2018.01.019openalex-snapshot
Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.02.002openalex-snapshot
Expected time analysis for Delaunay point location
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.12.002openalex-snapshot
A simple, faster method for kinetic proximity problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105990openalex-snapshot
Dynamic planar range skyline queries in log logarithmic expected time
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.09.004openalex-snapshot
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
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.jcss.2021.09.004openalex-snapshot
Intersection joins under updates
inferred← citeshttps://doi.org/10.1016/j.jksuci.2018.03.003openalex-snapshot
Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue
inferred← citeshttps://doi.org/10.1016/j.mbs.2021.108690openalex-snapshot
Measuring tree balance using symmetry nodes — A new balance index and its extremal properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.027openalex-snapshot
Fibonacci BSTs: A new balancing method for binary search trees
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(84)80035-2openalex-snapshot
Fault tolerance and storage reduction in binary search 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/s0065-2458(08)60257-0openalex-snapshot
Multidimensional Data Structures: Review and Outlook
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80204-xopenalex-snapshot
Chapter 7 Fundamental algorithms and data structures
inferred← citeshttps://doi.org/10.1017/s0956796800000885openalex-snapshot
Functional Pearls Efficient sets—a balancing act
inferred← citeshttps://doi.org/10.1051/ita/1981150301831openalex-snapshot
Arbitrary weight changes in dynamic trees
inferred← citeshttps://doi.org/10.1051/ita/1982160100511openalex-snapshot
A new class of balanced search trees : half-balanced binary search tress
inferred← citeshttps://doi.org/10.1051/ita/1994280504311openalex-snapshot
Updating approximately complete trees
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1080/00207160701435219openalex-snapshot
Effective splaying with restricted rotations
inferred← citeshttps://doi.org/10.1080/00207168508803482openalex-snapshot
A worst-case efficient algorithm for hidden-line elimination†
inferred← citeshttps://doi.org/10.1080/00207169108803956openalex-snapshot
Maintaining α-balanced trees by partial rebuilding
inferred← citeshttps://doi.org/10.1080/07468342.1987.11973055openalex-snapshot
Fibonacci Numbers and Computer Algorithms
inferred← citeshttps://doi.org/10.1080/10618600.2026.2675431openalex-snapshot
Efficient Distributional Regression Trees Learning Algorithms for Calibrated Non-Parametric Probabilistic Forecasts
inferred← citeshttps://doi.org/10.1093/comjnl/47.2.259openalex-snapshot
Untangling Binary Trees via Rotations
inferred← citeshttps://doi.org/10.1109/2945.722294openalex-snapshot
Memory-efficient ray classification for visibility operations
inferred← citeshttps://doi.org/10.1109/2945.722297openalex-snapshot
Fast collision detection among multiple moving spheres
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/ca.1997.601033openalex-snapshot
Fast collision detection among multiple moving spheres
inferred← citeshttps://doi.org/10.1109/dcc.1993.253118openalex-snapshot
Application of AVL trees to adaptive compression of numerical data
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00096openalex-snapshot
Online List Labeling: Breaking the log2n Barrier
inferred← citeshttps://doi.org/10.1109/fscs.1990.89528openalex-snapshot
New results on dynamic planar point location
inferred← citeshttps://doi.org/10.1109/iciea54703.2022.10006223openalex-snapshot
An Improved Wild Horse Algorithm to Solve Facility Layout in Horizontal Cylinder Space
inferred← citeshttps://doi.org/10.1109/infocom42981.2021.9488675openalex-snapshot
Robust Service Mapping in Multi-Tenant Clouds
inferred← citeshttps://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferred← citeshttps://doi.org/10.1109/sfcs.1980.6openalex-snapshot
A linear time algorithm for the lowest common ancestors problem
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715940openalex-snapshot
Dynamic Segment Intersection Search With Applications
inferred← citeshttps://doi.org/10.1109/sfcs.1986.28openalex-snapshot
Lower bounds for accessing binary search trees with rotations
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548515openalex-snapshot
Optimal dynamic interval management in external memory
inferred← citeshttps://doi.org/10.1109/tc.1984.1676438openalex-snapshot
Multidimensional Height-Balanced Trees
inferred← citeshttps://doi.org/10.1109/tnet.2021.3133293openalex-snapshot
A Robust Service Mapping Scheme for Multi-Tenant Clouds
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.1134/s1064226921130052openalex-snapshot
Balanced Clustering with a Tree over Clusters
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/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferred← citeshttps://doi.org/10.1137/0218004openalex-snapshot
Lower Bounds for Accessing Binary Search Trees with Rotations
inferred← citeshttps://doi.org/10.1137/0221057openalex-snapshot
New Results on Dynamic Planar Point Location
inferred← citeshttps://doi.org/10.1137/1.9781611976007.13openalex-snapshot
Engineering Top-Down Weight-Balanced Trees
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/22m1534468openalex-snapshot
Online List Labeling: Breaking the \({\log^2 n}\) Barrier
inferred← citeshttps://doi.org/10.1137/s009753970240481xopenalex-snapshot
Optimal External Memory Interval Management
inferred← citeshttps://doi.org/10.1137/s0097539793250329openalex-snapshot
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost
inferred← citeshttps://doi.org/10.1142/s0129054100000296openalex-snapshot
A NEW WEIGHT BALANCED BINARY SEARCH TREE
inferred← citeshttps://doi.org/10.1142/s021946781000369xopenalex-snapshot
A NEW PLOT/CHARACTER-BASED INTERACTIVE SYSTEM FOR STORY-BASED VIRTUAL REALITY APPLICATIONS
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/1233341.1233413openalex-snapshot
Exploring the duality between skip lists and binary search trees
inferred← citeshttps://doi.org/10.1145/1247069.1247131openalex-snapshot
Tight bounds for dynamic convex hull queries (again)
inferred← citeshttps://doi.org/10.1145/1435375.1435379openalex-snapshot
Kinetic and dynamic data structures for closest pair and all nearest neighbors
inferred← citeshttps://doi.org/10.1145/177424.177601openalex-snapshot
Biased finger trees and three-dimensional layers of maxima
inferred← citeshttps://doi.org/10.1145/1810959.1810984openalex-snapshot
Kinetic stable Delaunay graphs
inferred← citeshttps://doi.org/10.1145/2371316.2371320openalex-snapshot
Comparative performance evaluation of the AVL and red-black trees
inferred← citeshttps://doi.org/10.1145/2540068openalex-snapshot
Deletion without rebalancing in multiway search trees
inferred← citeshttps://doi.org/10.1145/262839.263007openalex-snapshot
Fast collision detection among multiple moving spheres
inferred← citeshttps://doi.org/10.1145/2784731.2784734openalex-snapshot
Adaptive lock-free maps: purely-functional to scalable
inferred← citeshttps://doi.org/10.1145/2902251.2902276openalex-snapshot
Anti-Persistence on Persistent Storage
inferred← citeshttps://doi.org/10.1145/2903142openalex-snapshot
Deletion Without Rebalancing in Binary Search Trees
inferred← citeshttps://doi.org/10.1145/2935764.2935768openalex-snapshot
Just Join for Parallel Ordered Sets
inferred← citeshttps://doi.org/10.1145/3085504.3085517openalex-snapshot
Class-based Conditional MaxRS Query in Spatial Data Streams
inferred← citeshttps://doi.org/10.1145/31846.42228openalex-snapshot
Multidimensional search trees that provide new types of memory reductions
inferred← citeshttps://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferred← citeshttps://doi.org/10.1145/327164.327208openalex-snapshot
Fringe analysis of binary search trees with miniml internal path length
inferred← citeshttps://doi.org/10.1145/329.318578openalex-snapshot
Implications of certain assumptions in database performance evauation
inferred← citeshttps://doi.org/10.1145/3409964.3461816openalex-snapshot
The Processing-in-Memory Model
inferred← citeshttps://doi.org/10.1145/3452378openalex-snapshot
Maximum Physically Consistent Trajectories
inferred← citeshttps://doi.org/10.1145/3512769openalex-snapshot
Joinable Parallel Balanced Binary Trees
inferred← citeshttps://doi.org/10.1145/3519939.3523733openalex-snapshot
PaC-trees: supporting parallel and compressed purely-functional collections
inferred← citeshttps://doi.org/10.1145/356631.356634openalex-snapshot
Binary Search Trees and File Organization
inferred← citeshttps://doi.org/10.1145/358476.358509openalex-snapshot
Balancing binary trees by internal path reduction
inferred← citeshttps://doi.org/10.1145/359581.359593openalex-snapshot
A comparison of tree-balancing algorithms
showing the first 200 of 243 · page through all 243
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.