4 papers · 1 filter
Truly Work-efficient Parallel Deterministic -coloring and Maximal Independent Set
Chase Hutton, Adam Melrod
We give deterministic parallel algorithms that compute a -coloring and a maximal independent set for a simple graph with vertices and edges in work and $O(\…
High Probability Work Efficient Parallel Algorithms
Chase Hutton, Adam Melrod
Randomized parallel algorithms for many fundamental problems achieve optimal linear work in expectation, but upgrading this guarantee to hold with high probability (whp) remains a…
Parallel Batch Dynamic Vertex Coloring in Amortized Update Time
Chase Hutton, Adam Melrod
We present the first parallel batch-dynamic algorithm for maintaining a proper -vertex coloring. Our approach builds on a new sequential dynamic algorithm inspired by the…
Encoding Schemes for Parallel In-Place Algorithms
Chase Hutton, Adam Melrod
Many parallel algorithms which solve basic problems in computer science use auxiliary space linear in the input to facilitate conflict-free computation. There has been significant…