scientific article; zbMATH DE number 7651141
From MaRDI portal
Publication:5874462
DOI10.4230/LIPICS.ESA.2020.2MaRDI QIDQ5874462FDOQ5874462
Authors:
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2002.05129
Title of this publication is not available (Why is that?)
Cites Work
- A data structure for dynamic trees
- Title not available (Why is that?)
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Self-adjusting top trees
- Maintaining information in fully dynamic trees with top trees
- Dynamizing static algorithms, with applications to dynamic trees and history independence
- Parallel Tree Contraction Part 2: Further Applications
- Minimum cuts in near-linear time
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Adaptive functional programming
- Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
- On parallel hashing and integer sorting
- Work-efficient parallel union-find with applications to incremental graph connectivity
- Title not available (Why is that?)
- Batch-parallel Euler tour trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874462)
