|
|
Brief Announcement: Sinkless Orientation Made TrivialPODC 2026 - ACM Symposium on Principles of Distributed Computing, Jul 2026, Egham, United Kingdom. pp.333 - 336, ⟨10.1145/3796701.3815953⟩ |
|
|
Brief Announcement: Toward Uniform Content-Oblivious Leader Election on General GraphsPODC 2026 - ACM Symposium on Principles of Distributed Computing, Jul 2026, Egham, United Kingdom. pp.235-238, ⟨10.1145/3796701.3815949⟩ |
|
|
Optimal deterministic rendezvous in labeled linesSTACS 2026 - 43rd International Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2026, Grenoble, France. pp.18:1--18:20, ⟨10.4230/LIPIcs.STACS.2026.18⟩ |
|
|
Brief Announcement: Fast Deterministic Distributed Degree SplittingPODC 2026 - ACM Symposium on Principles of Distributed Computing, Jul 2026, Egham, United Kingdom. pp.329-332, ⟨10.1145/3796701.3815955⟩ |
|
|
Faster Distributed ∆-Coloring via a Reduction to MIS2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2026), Jan 2026, Vancouver (BC), Canada. pp.4481-4500, ⟨10.1137/1.9781611978971.162⟩ |
|
|
The Communication Complexity of Functions with Large OutputsStructural Information and Communication Complexity (SIROCCO 2023), Jun 2023, Alcala de Henares, Spain. pp.427-458, ⟨10.1007/978-3-031-32733-9_19⟩ |
|
|
Content-oblivious leader election on ringsDistributed Computing, 2026, 39 (2), pp.12. ⟨10.1007/s00446-025-00491-x⟩ |
|
|
Efficient and practical tree preconditioning for solving Laplacian systems2015 |
