Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
From MaRDI portal
Publication:1874394
DOI10.1016/S0304-3975(02)00318-3zbMath1040.68144MaRDI QIDQ1874394
Joaquim Gabarró, Xavier Messeguer, Ricardo A. Baeza-Yates
Publication date: 25 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68W10: Parallel algorithms in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel dictionaries with local rules on AVL and brother trees
- Parallel dictionaries using AVL trees
- On random 2-3 trees
- Pipelining with futures
- Maintaining \(B\)-trees on an EREW PRAM
- A design of a parallel dictionary using skip lists
- Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
- On the computational power of pushdown automata
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
- The theory of fringe analysis and its application to 23 trees and b-trees
- The binomial transform and its application to the analysis of skip lists