ResearchTrend.AI
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span

Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span

Daniel Anderson
G. Blelloch
ArXiv (abs)PDFHTML

Papers citing "Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span"

1 / 1 papers shown
Title
Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
Parallel kk-Core Decomposition with Batched Updates and Asynchronous Reads
Quanquan C. Liu
Julian Shun
Igor Zablotchi
26
4
0
15 Jan 2024