Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.

DOI10.1016/S0304-3975(02)00318-3zbMath1040.68144OpenAlexW1964523914MaRDI QIDQ1874394

Ricardo A. Baeza-Yates, Joaquim Gabarró, Xavier Messeguer

Publication date: 25 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00318-3

zbMATH Keywords

Parallel algorithms2--3 TreesBinomial transformFringe analysis

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.

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

This page was built for publication: Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.