| Publication | Date of Publication | Type |
|---|
Secured distributed algorithms without hardness assumptions
| 2026-03-31 | Paper |
Distributed backup placement in one round and its applications to maximum matching approximation and self-stabilization
| 2024-05-14 | Paper |
scientific article; zbMATH DE number 7774261 (Why is no real title available?)
| 2023-12-08 | Paper |
Distributed backup placement
Distributed Computing | 2022-10-14 | Paper |
Locally-iterative Distributed (Δ + 1)-coloring and Applications
Journal of the ACM | 2022-03-31 | Paper |
Simple distributed spanners in dense congest networks
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Locally-iterative distributed \((\Delta+1)\)-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
A fast network-decomposition algorithm and its applications to constant-time distributed computation
Theoretical Computer Science | 2018-11-29 | Paper |
Distributed symmetry-breaking algorithms for congested cliques
| 2018-11-28 | Paper |
Deterministic \((\Delta+1)\)-coloring in sublinear (in \(\Delta\)) time in static, dynamic, and faulty networks
Journal of the ACM | 2018-08-02 | Paper |
Deterministic distributed \((\Delta + o(\Delta))\)-edge-coloring, and vertex-coloring of graphs with bounded diversity
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Deterministic \(({\delta} + 1)\)-coloring in sublinear (in \({\delta}\)) time in static, dynamic and faulty networks
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
A fast network-decomposition algorithm and its applications to constant-time distributed computation (extended abstract)
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Nearly optimal local broadcasting in the SINR model with feedback
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Distributed deterministic edge coloring using bounded neighborhood independence
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Distributed \(({\Delta}+1)\)-coloring in linear (in \({\Delta})\) time
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Sublogarithmic distributed \textsc{MIS} algorithm for sparse graphs using Nash-Williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Combinatorial algorithms for distributed graph coloring
Distributed Computing | 2014-07-11 | Paper |
Distributed Graph Coloring: Fundamentals and Recent Developments
Synthesis Lectures on Distributed Computing Theory | 2014-06-20 | Paper |
Distributed \((\Delta+1)\)-coloring in linear (in \(\Delta\)) time
SIAM Journal on Computing | 2014-06-04 | Paper |
Distributed deterministic edge coloring using bounded neighborhood independence
Distributed Computing | 2014-03-28 | Paper |
Deterministic distributed vertex coloring in polylogarithmic time
Journal of the ACM | 2014-02-17 | Paper |
On the locality of some NP-complete problems
Automata, Languages, and Programming | 2012-11-01 | Paper |
Deterministic and energy-optimal wireless synchronization
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Combinatorial algorithms for distributed graph coloring
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
Distributed Computing | 2010-09-09 | Paper |
