Parallel joinable B-trees in the fork-join I/O model

DOI10.4230/LIPICS.ISAAC.2025.37MaRDI QIDQ7364382zbMATH OpenFDO

Authors Michael T. Goodrich, Yan Gu, Ryuto Kitagawa, Yihan Sun

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.37

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• Parallel exact shortest paths in almost linear work and square root depth
• Scheduling multithreaded computations by work stealing
• Thread scheduling for multiprogrammed multiprocessors

This page was built for publication: Parallel joinable B-trees in the fork-join I/O model

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