On the public citation graph
Concurrent search and insertion in 2?3 trees
0 signed · 87 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/bf00263762openalex-snapshot
Concurrency of operations on B-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/cpe.2995openalex-snapshot
A concurrent van Emde Boas array as a fast and simple concurrent dynamic set alternative
inferred← citeshttps://doi.org/10.1006/jcph.2002.7073openalex-snapshot
A Multiple-Heaps Algorithm for Parallel Simulation of Collision Systems
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0003openalex-snapshot
Scalable Concurrent B-Trees Using Multi-Version Memory
inferred← citeshttps://doi.org/10.1006/jsco.1996.0032openalex-snapshot
Shared Memory Implementation of the Gamma-Operation
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_15openalex-snapshot
Concurrent operations in large ordered indexes
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_6openalex-snapshot
Distributed data structures: A complexity-oriented view
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_119openalex-snapshot
Concurrent data structures for hypercube machine
inferred← citeshttps://doi.org/10.1007/3-540-56869-7_9openalex-snapshot
Concurrent accesses to R-trees
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_6openalex-snapshot
Concurrency in an O (log log N) priority queue
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_72openalex-snapshot
Relaxed balanced red-black trees
inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_12openalex-snapshot
Concurrency Issues in Access Methods
inferred← citeshttps://doi.org/10.1007/978-1-4613-1989-4_2openalex-snapshot
Parallel Computing Using Multilisp
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_13openalex-snapshot
Relaxed Balancing in Search Trees
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_7openalex-snapshot
Concurrent Data Structures for Tree Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-82937-6_6openalex-snapshot
Massive Parallel Database Computer MPDC and Its Control Schemes for Massively Parallel Processing
inferred← citeshttps://doi.org/10.1007/bf00289586openalex-snapshot
A characterization of database graphs admitting a simple locking protocol
inferred← citeshttps://doi.org/10.1007/bf00881946openalex-snapshot
METEOR: Exploring model elimination theorem proving
inferred← citeshttps://doi.org/10.1007/bf01069988openalex-snapshot
Concurrency methods for the dictionary problem: A survey
inferred← citeshttps://doi.org/10.1007/bf01407909openalex-snapshot
Algorithms for parallel memory allocation
inferred← citeshttps://doi.org/10.1007/bf02946622openalex-snapshot
Concurrent manipulation of expanded AVL trees
inferred← citeshttps://doi.org/10.1007/bfb0022520openalex-snapshot
Approaches to concurrency in B-trees
inferred← citeshttps://doi.org/10.1007/bfb0027123openalex-snapshot
Building a parallel branch and bound library
inferred← citeshttps://doi.org/10.1007/bfb0036940openalex-snapshot
Parallel dictionaries on 2–3 trees
inferred← citeshttps://doi.org/10.1007/s00446-002-0073-5openalex-snapshot
Compact and localized distributed data structures
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90100-xopenalex-snapshot
Insertion-safeness in balanced trees
inferred← citeshttps://doi.org/10.1016/0020-0255(89)90035-2openalex-snapshot
Operation-specific locking in balanced structures
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90021-8openalex-snapshot
Concurrent operations on B∗-trees with overtaking
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90030-9openalex-snapshot
Transaction synchronisation in object bases
inferred← citeshttps://doi.org/10.1016/0306-4379(88)90030-0openalex-snapshot
Concurrency in extendible hashing
inferred← citeshttps://doi.org/10.1016/0743-7315(89)90020-8openalex-snapshot
A concurrent search structure
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90100-4openalex-snapshot
On the performance of concurrent tree algorithms
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90036-9openalex-snapshot
The group lock and its applications
inferred← citeshttps://doi.org/10.1016/j.ins.2003.09.019openalex-snapshot
Global parallel index for multi-processors database systems
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00219-8openalex-snapshot
A study of concurrent operations on R-trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00312-7openalex-snapshot
Public data structures: counters as a special case
inferred← citeshttps://doi.org/10.1023/a:1015682215394openalex-snapshot
A Taxonomy of Indexing Schemes for Parallel Database Systems
inferred← citeshttps://doi.org/10.1023/a:1026458902456openalex-snapshot
Intensive Data Management in Parallel Systems: A Survey
inferred← citeshttps://doi.org/10.1051/ita/1983170403971openalex-snapshot
Parallel computation on 2-3-trees
inferred← citeshttps://doi.org/10.1109/32.238568openalex-snapshot
Data structures for parallel resource management
inferred← citeshttps://doi.org/10.1109/69.553166openalex-snapshot
Concurrency control in B-trees with batch updates
inferred← citeshttps://doi.org/10.1109/71.89061openalex-snapshot
A generalized simultaneous access dictionary machine
inferred← citeshttps://doi.org/10.1109/cmpsac.1978.810565openalex-snapshot
Software control and program design issues for alterable architectures
inferred← citeshttps://doi.org/10.1109/gcc.2007.105openalex-snapshot
Research and Realization of Transaction Concurrency Control in Grid Database
inferred← citeshttps://doi.org/10.1109/hicss.1990.205170openalex-snapshot
R-trees for large geographic information systems in a multi-user environment
inferred← citeshttps://doi.org/10.1109/icpp.1993.50openalex-snapshot
Automatically Mapping Sequential Objects to Concurrent Objects: The Mutual Exclusion Problem
inferred← citeshttps://doi.org/10.1109/istcs.1995.377041openalex-snapshot
Public data structures: counters as a special case
inferred← citeshttps://doi.org/10.1109/sccc.1997.636933openalex-snapshot
A unified approach to concurrent and parallel algorithms on balanced data structures
inferred← citeshttps://doi.org/10.1109/sfcs.1979.12openalex-snapshot
Controlling concurrency using locking protocols
inferred← citeshttps://doi.org/10.1109/spdp.1996.570359openalex-snapshot
B/sup mad/-tree: an efficient data structure for parallel processing
inferred← citeshttps://doi.org/10.1109/tc.1980.1675680openalex-snapshot
Concurrent Search and Insertion in AVL Trees
inferred← citeshttps://doi.org/10.1109/tse.1982.235251openalex-snapshot
A New Method for Concurrency in B-Trees
inferred← citeshttps://doi.org/10.1109/tse.1984.5010306openalex-snapshot
Concurrent Maintenance of Binary Search Trees
inferred← citeshttps://doi.org/10.1145/113413.113430openalex-snapshot
Uncoupling updating and rebalancing in chromatic binary search trees
inferred← citeshttps://doi.org/10.1145/1270.318576openalex-snapshot
Concurrency control in a dynamic search structure
inferred← citeshttps://doi.org/10.1145/161468.161469openalex-snapshot
A methodology for implementing highly concurrent data objects
inferred← citeshttps://doi.org/10.1145/2007183.2007187openalex-snapshot
On the performance of distributed lock-based synchronization?
inferred← citeshttps://doi.org/10.1145/267825.267838openalex-snapshot
Transaction synchronization in structures for point data
inferred← citeshttps://doi.org/10.1145/28659.28676openalex-snapshot
Operation specific locking in B-trees
inferred← citeshttps://doi.org/10.1145/298514.298580openalex-snapshot
A framework for the performance analysis of concurrent B-tree algorithms
inferred← citeshttps://doi.org/10.1145/29903.29920openalex-snapshot
Predicting performance of concurrency control designs
inferred← citeshttps://doi.org/10.1145/29904.29920openalex-snapshot
Predicting performance of concurrency control designs
inferred← citeshttps://doi.org/10.1145/308386.308442openalex-snapshot
Concurrent set manipulation without locking
inferred← citeshttps://doi.org/10.1145/319566.319567openalex-snapshot
On optimistic methods for concurrency control
inferred← citeshttps://doi.org/10.1145/319628.319663openalex-snapshot
Efficient locking for concurrent operations on B-trees
inferred← citeshttps://doi.org/10.1145/320613.320619openalex-snapshot
Concurrent manipulation of binary search trees
inferred← citeshttps://doi.org/10.1145/325405.325409openalex-snapshot
Concurrent operations on B-trees with overtaking
inferred← citeshttps://doi.org/10.1145/3318.3319openalex-snapshot
Implementation of resilient, atomic data types
inferred← citeshttps://doi.org/10.1145/588011.588020openalex-snapshot
Concurrency control mechanisms and the serializability of concurrent tree algorithms
inferred← citeshttps://doi.org/10.1145/588058.588072openalex-snapshot
Extendible hashing for concurrent operations and distributed data
inferred← citeshttps://doi.org/10.1145/588068.588072openalex-snapshot
Extendible hashing for concurrent operations and distributed data
inferred← citeshttps://doi.org/10.1145/588111.588156openalex-snapshot
Concurrency control in a dynamic search structure
inferred← citeshttps://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferred← citeshttps://doi.org/10.1145/800226.806851openalex-snapshot
Specification and implementation of resilient, atomic data types
inferred← citeshttps://doi.org/10.1145/872728.806851openalex-snapshot
Specification and implementation of resilient, atomic data types
inferred← citeshttps://doi.org/10.1145/99163.99185openalex-snapshot
A methodology for implementing highly concurrent data structures
inferred← citeshttps://doi.org/10.1145/99164.99185openalex-snapshot
A methodology for implementing highly concurrent data structures
inferred← citeshttps://doi.org/10.1184/r1/6591374openalex-snapshot
A simulator for concurrent objects
inferred← citeshttps://doi.org/10.15242/ijccie.u0616013openalex-snapshot
Comparison of Skip List Algorithms to Alternative Data Structures
inferred← citeshttps://doi.org/10.2172/6163935openalex-snapshot
Scoping persistent name spaces in ADAMS
inferred← citeshttps://doi.org/10.54254/2753-8818/18/20230348openalex-snapshot
Concurrency control in tree data structures
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.