| Publication | Date of Publication | Type |
|---|
Locality in online, dynamic, sequential, and distributed graph algorithms
| 2024-11-14 | Paper |
Changing lanes on a highway
| 2024-08-27 | Paper |
Sinkless orientation made simple
| 2024-05-14 | Paper |
Locally checkable problems in rooted trees
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Distributed half-integral matching and beyond
Theoretical Computer Science | 2024-02-23 | Paper |
Distributed half-integral matching and beyond
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Locally checkable labelings with small messages
| 2023-12-08 | Paper |
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model
| 2023-12-08 | Paper |
Classification of distributed binary labeling problems
| 2023-11-02 | Paper |
Landscape of Locality (Invited Talk).
| 2023-11-02 | Paper |
Brief announcement: Efficient load-balancing through distributed token dropping
| 2023-11-02 | Paper |
Brief announcement: Distributed graph problems through an automata-theoretic lens
| 2023-11-02 | Paper |
Locally checkable problems in rooted trees
Distributed Computing | 2023-09-11 | Paper |
Distributed graph problems through an automata-theoretic lens
Theoretical Computer Science | 2023-03-10 | Paper |
Improved distributed degree splitting and edge coloring
| 2023-02-03 | Paper |
Lower Bounds for Maximal Matchings and Maximal Independent Sets
Journal of the ACM | 2022-12-08 | Paper |
Local mending
| 2022-11-11 | Paper |
Distributed recoloring
| 2022-07-21 | Paper |
Almost global problems in the LOCAL model
| 2022-07-21 | Paper |
Distributed graph problems through an automata-theoretic Lens
| 2022-03-22 | Paper |
Almost global problems in the LOCAL model
Distributed Computing | 2021-09-06 | Paper |
How much does randomness help with locally checkable problems?
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Brief Announcement: Classification of Distributed Binary Labeling Problems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Hardness of Minimal Symmetry Breaking in Distributed Computing
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Constant space and non-constant time in distributed computing
| 2020-07-30 | Paper |
Improved distributed degree splitting and edge coloring
Distributed Computing | 2020-06-15 | Paper |
Locality of not-so-weak coloring
| 2020-03-03 | Paper |
Algebraic methods in the congested clique
Distributed Computing | 2019-11-27 | Paper |
New classes of distributed time complexity
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Local coordination and symmetry breaking
| 2019-07-03 | Paper |
Node labels in local decision
Theoretical Computer Science | 2018-11-29 | Paper |
Improved approximation algorithms for relay placement
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Locally optimal load balancing
| 2018-08-24 | Paper |
Non-local probes do not help with many graph problems
| 2018-08-16 | Paper |
Linear-in-\(\varDelta \) lower bounds in the LOCAL model
Distributed Computing | 2018-01-17 | Paper |
Large cuts with local algorithms on triangle-free graphs
The Electronic Journal of Combinatorics | 2017-10-24 | Paper |
Randomized algorithms for finding a majority element
| 2017-10-17 | Paper |
LCL problems on grids
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
A lower bound for the distributed Lovász local lemma
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Efficient counting with optimal resilience
SIAM Journal on Computing | 2017-09-25 | Paper |
Locally checkable proofs in distributed computing
Theory of Computing | 2016-12-21 | Paper |
Towards optimal synchronous counting
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Algebraic methods in the congested clique
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Exact bounds for distributed graph colouring
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Node labels in local decision
Lecture Notes in Computer Science | 2016-01-08 | Paper |
Synchronous counting and computational algorithm design
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Deterministic local algorithms, unique identifiers, and fractional graph colouring
Theoretical Computer Science | 2015-12-10 | Paper |
The minimum backlog problem
Theoretical Computer Science | 2015-10-30 | Paper |
Locally checkable proofs
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Linear-in-\(\Delta\) lower bounds in the LOCAL model
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Weak models of distributed computing, with connections to modal logic
Distributed Computing | 2015-03-25 | Paper |
Distributed algorithms for \textsc{Edge Dominating Sets}
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
What can be decided locally without identifiers?
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
No sublogarithmic-time approximation scheme for bipartite vertex cover
Distributed Computing | 2015-02-23 | Paper |
Distributed maximal matching, greedy is optimal
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Weak models of distributed computing, with connections to modal logic
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Lower bounds for local approximation
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Survey of local algorithms
ACM Computing Surveys | 2014-08-13 | Paper |
Lower bounds for local approximation
Journal of the ACM | 2014-02-17 | Paper |
No sublogarithmic-time approximation scheme for bipartite vertex cover
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Local approximability of max-min and min-max linear programs
Theory of Computing Systems | 2012-12-10 | Paper |
Deterministic local algorithms, unique identifiers, and fractional graph colouring
Structural Information and Communication Complexity | 2012-09-26 | Paper |
Analysing local algorithms in location-aware quasi-unit-disk graphs
Discrete Applied Mathematics | 2011-10-27 | Paper |
Planar subgraphs without low-degree nodes
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Almost stable matchings by truncating the Gale-Shapley algorithm
Algorithmica | 2010-10-07 | Paper |
A simple local 3-approximation algorithm for vertex cover
Information Processing Letters | 2010-08-16 | Paper |
Approximability of identifying codes and locating-dominating codes
Information Processing Letters | 2010-03-24 | Paper |
A Local 2-Approximation Algorithm for the Vertex Cover Problem
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Improved approximation algorithms for relay placement
Lecture Notes in Computer Science | 2008-11-25 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Online Locality Meets Distributed Quantum Computing
| N/A | Paper |
