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

DOI10.1016/S0304-3975(02)00318-3MaRDI QIDQ1874394zbMATH OpenOpenAlexFDO

Authors Ricardo 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

2--3 TreesBinomial transformFringe analysisParallel algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• The theory of fringe analysis and its application to 23 trees and b-trees
• Expected behaviour of \(B^+\)-trees under random insertions
• scientific article; zbMATH DE number 4008411
• scientific article; zbMATH DE number 3856447
• scientific article; zbMATH DE number 3843145

Cites work

• A design of a parallel dictionary using skip lists
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
• scientific article; zbMATH DE number 3825195 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 890206 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Maintaining \(B\)-trees on an EREW PRAM
• On random 2-3 trees
• On the computational power of pushdown automata
• Parallel dictionaries using AVL trees
• Parallel dictionaries with local rules on AVL and brother trees
• Pipelining with futures
• The binomial transform and its application to the analysis of skip lists
• The theory of fringe analysis and its application to 23 trees and b-trees
• Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains

Cited in

(4)

• Expected behaviour of \(B^+\)-trees under random insertions
• Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
• scientific article; zbMATH DE number 4008411 (Why is no real title available?)
• The theory of fringe analysis and its application to 23 trees and b-trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874394)