Open Source
Truly Work-efficient Parallel Deterministic $(\Delta+1)$-coloring and Maximal Independent Set
arXiv cs.DC0 views
arXiv:2608.08296v2 Announce Type: replace-cross Abstract: We give deterministic parallel algorithms that compute a $(\Delta+1)$-coloring and a maximal independent set for a simple graph with $n$ vertices and $m$ edges in $O(n+m)$ work and $O(\mathrm{poly}\log n)$ depth.
Source：https://arxiv.org/abs/2608.08296PreviousCertified Split Points for Parallel Lexing: Exact and Modulo Discarded TokensNextDispatch Overhead, Not Kernel Quality: The Performance Bottleneck in Single-Stream WebGPU LLM Inference
Related posts
Karpathy built HackerTube in 2 hours. I rebuilt it in the open and measured it
0dev.to AI
Show HN: Poinky – Claude Code you talk to, that sees your screen
0Hacker News Show
Show HN: DeskAccess – Open-source remote access for Raspberry Pi
0Hacker News Show
Show HN: The Public Eye – Agentic search for congressional bill legibility
0Hacker News Show
NASA’s Perseverance Mars rover breaks historic record after traveling 28 miles
0Science Daily Tech
A fresh wave of cyberattacks has hit Europe’s supermarket refrigerators, destroying food across countries
0TechCrunch