scientific article; zbMATH DE number 7651141

DOI10.4230/LIPIcs.ESA.2020.2MaRDI QIDQ5874462

No author found.

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2002.05129

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parallel algorithmsgraph algorithmsdynamic algorithmsdynamic trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Work-efficient parallel union-find with applications to incremental graph connectivity
• A data structure for dynamic trees
• Maintaining information in fully dynamic trees with top trees
• Randomized fully dynamic graph algorithms with polylogarithmic time per operation
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Parallel Tree Contraction Part 2: Further Applications
• On parallel hashing and integer sorting
• Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
• Adaptive functional programming
• Batch-Parallel Euler Tour Trees
• Minimum cuts in near-linear time

This page was built for publication: