On the public citation graph

Parallel dictionaries on 2–3 trees

https://doi.org/10.1007/bfb0036940
0 signed · 86 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/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1007/bf00289064openalex-snapshot
Concurrent search and insertion in 2?3 trees
inferredcites →https://doi.org/10.1016/0196-6774(83)90033-0openalex-snapshot
Implementation of simultaneous memory address access in models that forbid it
inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot
An 0(n log n) sorting network
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1998.0968openalex-snapshot
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1001openalex-snapshot
Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1432openalex-snapshot
Parallel Dictionaries Using AVL Trees
inferred← citeshttps://doi.org/10.1007/3-540-49543-6_11openalex-snapshot
Fringe analysis of synchronized parallel algorithms on 2–3 trees
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_165openalex-snapshot
A simple optimal parallel algorithm for reporting paths in a tree
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_191openalex-snapshot
Fast and efficient operations on Parallel Priority Queues
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_114openalex-snapshot
Bandwidth efficient parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_21openalex-snapshot
Communication efficient parallel searching
inferred← citeshttps://doi.org/10.1007/978-3-031-41673-6_9openalex-snapshot
Parallel-Batched Interpolation Search Tree
inferred← citeshttps://doi.org/10.1007/bf00128644openalex-snapshot
Parallel heap: An optimal parallel priority queue
inferred← citeshttps://doi.org/10.1007/bf01069988openalex-snapshot
Concurrency methods for the dictionary problem: A survey
inferred← citeshttps://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferred← citeshttps://doi.org/10.1007/bfb0029597openalex-snapshot
Dynamic hashing strategies
inferred← citeshttps://doi.org/10.1007/pl00008261openalex-snapshot
The Complexity of Parallel Multisearch on Coarse-Grained Machines
inferred← citeshttps://doi.org/10.1007/s00224-001-0002-1openalex-snapshot
Blocking in Parallel Multisearch Problems
inferred← citeshttps://doi.org/10.1007/s002240000074openalex-snapshot
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up
inferred← citeshttps://doi.org/10.1007/s002240000094openalex-snapshot
Asynchronous Shared Memory Search Structures
inferred← citeshttps://doi.org/10.1007/s002240000117openalex-snapshot
Pipelining with Futures
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90085-vopenalex-snapshot
Parallel cardinality stacks and an application
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90135-5openalex-snapshot
Analysis of parallel uniform hashing
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00009-3openalex-snapshot
An optimal parallel algorithm for merging using multiselection
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90046-fopenalex-snapshot
An efficient parallel algorithm for the row minima of a totally monotone matrix
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90028-8openalex-snapshot
A parallel-design distributed-implementation (PDDI) general-purpose computer
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50019-xopenalex-snapshot
Parallel Computational Geometry: An Approach using Randomization
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.06.005openalex-snapshot
Deleting keys of B-trees in parallel
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80003-5openalex-snapshot
Dynamic parallel memories
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00142-2openalex-snapshot
Parallel dictionaries with local rules on AVL and brother trees
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00092-1openalex-snapshot
Language and library support for practical PRAM programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00287-5openalex-snapshot
Parallel algorithms for red–black trees
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(98)00020-6openalex-snapshot
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
inferred← citeshttps://doi.org/10.1051/ita/1997310302511openalex-snapshot
Skip trees, an alternative data structure to skip lists in a concurrent approach
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/71.363412openalex-snapshot
Efficient geometric algorithms on the EREW PRAM
inferred← citeshttps://doi.org/10.1109/71.372799openalex-snapshot
Efficient parallel binary search on sorted arrays, with applications
inferred← citeshttps://doi.org/10.1109/hipc.2016.042openalex-snapshot
Fast Parallel Operations on Search Trees
inferred← citeshttps://doi.org/10.1109/hipc53243.2021.00023openalex-snapshot
PPBT: A High Performance Parallel Search Tree
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015581openalex-snapshot
Deleting keys of B-trees in parallel
inferred← citeshttps://doi.org/10.1109/ipps.1994.288203openalex-snapshot
Parallel dictionaries on AVL trees
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.1991.185438openalex-snapshot
Towards a theory of nearly constant time parallel algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365724openalex-snapshot
Parallel algorithms for higher-dimensional convex hulls
inferred← citeshttps://doi.org/10.1109/spdp.1992.242745openalex-snapshot
The p-shovelers problem-computing with time-varying data
inferred← citeshttps://doi.org/10.1109/spdp.1995.530688openalex-snapshot
Parallel search in matrices with sorted columns
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.1137/1.9781611975499.8openalex-snapshot
Batch-Parallel Euler Tour Trees
inferred← citeshttps://doi.org/10.1142/s0129626493000332openalex-snapshot
PRAM MEMORY ALLOCATION AND INITIALIZATION
inferred← citeshttps://doi.org/10.1145/113379.113398openalex-snapshot
Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version)
inferred← citeshttps://doi.org/10.1145/116825.116827openalex-snapshot
An optimal parallel algorithm for the visibility of a simple polygon from a point
inferred← citeshttps://doi.org/10.1145/140901.140915openalex-snapshot
Maintaining dynamic ordered sets on processor networks
inferred← citeshttps://doi.org/10.1145/197912.197992openalex-snapshot
Bandwidth efficient parallel computation
inferred← citeshttps://doi.org/10.1145/215399.215403openalex-snapshot
Provably efficient scheduling for languages with fine-grained parallelism
inferred← citeshttps://doi.org/10.1145/2312005.2312046openalex-snapshot
A parallel buffer tree
inferred← citeshttps://doi.org/10.1145/237502.237545openalex-snapshot
A library of basic PRAM algorithms and its implementation in FORK
inferred← citeshttps://doi.org/10.1145/237502.237562openalex-snapshot
Fully dynamic search trees for an extension of the BSP model
inferred← citeshttps://doi.org/10.1145/258492.258494openalex-snapshot
Space-efficient scheduling of parallelism with synchronization variables
inferred← citeshttps://doi.org/10.1145/258492.258517openalex-snapshot
Pipelining with futures
inferred← citeshttps://doi.org/10.1145/265910.265923openalex-snapshot
Time-work tradeoffs for parallel algorithms
inferred← citeshttps://doi.org/10.1145/277651.277660openalex-snapshot
Fast set operations using treaps
inferred← citeshttps://doi.org/10.1145/277651.277676openalex-snapshot
Blocking in parallel multisearch problems (extended abstract)
inferred← citeshttps://doi.org/10.1145/301970.301974openalex-snapshot
Provably efficient scheduling for languages with fine-grained parallelism
inferred← citeshttps://doi.org/10.1145/3210377.3210390openalex-snapshot
Parallel Working-Set Search Structures
inferred← citeshttps://doi.org/10.1145/3236786openalex-snapshot
Parallel complexity analysis with temporal session types
inferred← citeshttps://doi.org/10.1145/3318.3478openalex-snapshot
Optimal parallel generation of a computation tree form
inferred← citeshttps://doi.org/10.1145/3323165.3323196openalex-snapshot
Parallel Batch-Dynamic Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3350755.3400227openalex-snapshot
Optimal Parallel Algorithms in the Binary-Forking Model
inferred← citeshttps://doi.org/10.1145/3409964.3461816openalex-snapshot
The Processing-in-Memory Model
inferred← citeshttps://doi.org/10.1145/3512769openalex-snapshot
Joinable Parallel Balanced Binary Trees
inferred← citeshttps://doi.org/10.1145/3632895openalex-snapshot
Disentanglement with Futures, State, and Interaction
inferred← citeshttps://doi.org/10.1145/3694906.3743350openalex-snapshot
A Deterministic Work-Depth Tradeoff for Strongly Connected Components
inferred← citeshttps://doi.org/10.1145/72935.72974openalex-snapshot
An optimal parallel dictionary
inferred← citeshttps://doi.org/10.1145/800057.808686openalex-snapshot
Randomized speed-ups in parallel computation
inferred← citeshttps://doi.org/10.1145/872035.872053openalex-snapshot
Peer-to-peer systems for prefix search
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.20openalex-snapshot
Parallel Finger Search Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1905.05254openalex-snapshot
Optimal Multithreaded Batch-Parallel 2-3 Trees
inferred← citeshttps://doi.org/10.5555/127787.127861openalex-snapshot
Time-work tradeoffs for parallel graph algorithms
inferred← citeshttps://doi.org/10.70675/35c0180dzc462z4178z90cez1700a6ba85c5openalex-snapshot
Synchronization costs in parallel programs and concurrent data structures
inferred← citeshttps://doi.org/10.70675/bd48f7ebz9c21z4ac6z9970z7725b0a53beaopenalex-snapshot
Efficient finite-state algorithms for the application of local grammars
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.