| Publication | Date of Publication | Type |
|---|
Approximation hardness of domination problems on generalized convex graphs
Theoretical Computer Science | 2025-01-16 | Paper |
A nearly linear-time distributed algorithm for exact maximum matching
| 2024-11-28 | Paper |
Logarithmic expected-time leader election in population protocol model
| 2024-04-19 | Paper |
Deterministic Fault-Tolerant Connectivity Labeling Scheme
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7774291 (Why is no real title available?)
| 2023-12-08 | Paper |
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching
| 2023-11-07 | Paper |
Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications
| 2023-04-21 | Paper |
scientific article; zbMATH DE number 7650908 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650882 (Why is no real title available?)
| 2023-02-07 | Paper |
Low-congestion shortcut and graph parameters
| 2023-02-03 | Paper |
Message reduction in the LOCAL model is a free lunch
| 2023-02-03 | Paper |
Loosely-stabilizing maximal independent set algorithms with unreliable communications
Theoretical Computer Science | 2022-10-24 | Paper |
Low-congestion shortcut and graph parameters
Distributed Computing | 2021-11-08 | Paper |
Low-congestion shortcuts without embedding
Distributed Computing | 2021-03-12 | Paper |
Fault-tolerant simulation of population protocols
Distributed Computing | 2021-01-22 | Paper |
Logarithmic Expected-Time Leader Election in Population Protocol Model
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Message Reduction in the LOCAL Model is a Free Lunch
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Distributed Minimum Degree Spanning Trees
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Distributed graph algorithms and their complexity: an introduction
Interdisciplinary Information Sciences | 2020-11-19 | Paper |
Uniform distribution for Pachinko
Theoretical Computer Science | 2020-09-03 | Paper |
Uniform distribution on Pachinko
| 2020-08-11 | Paper |
Flocking with oblivious robots
| 2019-11-22 | Paper |
Population protocols with faulty interactions: the impact of a leader
Theoretical Computer Science | 2018-12-04 | Paper |
Near-optimal low-congestion shortcuts on bounded parameter graphs
| 2018-08-16 | Paper |
On time complexity for connectivity-preserving scattering of mobile robots
Theoretical Computer Science | 2018-06-18 | Paper |
Triangle Finding and Listing in CONGEST Networks
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Low-congestion shortcuts without embedding
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Population protocols with faulty interactions: the impact of a leader
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Improving the lower bound on opaque sets for equilateral triangle
Discrete Applied Mathematics | 2016-09-12 | Paper |
Listing center strings under the edit distance metric
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
On space and time complexity of loosely-stabilizing leader election
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Depth-First Search Using $$O(n)$$ Bits
Algorithms and Computation | 2015-09-11 | Paper |
Approximability of minimum certificate dispersal with tree structures
Theoretical Computer Science | 2015-07-13 | Paper |
Filling logarithmic gaps in distributed complexity for global problems
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances
Theoretical Computer Science | 2014-12-02 | Paper |
Space-efficient self-stabilizing counting population protocols on mobile sensor networks
Theoretical Computer Science | 2014-09-10 | Paper |
Randomized Lower Bound for Distributed Spanning-Tree Verification
Structural Information and Communication Complexity | 2014-08-07 | Paper |
ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS
Parallel Processing Letters | 2012-12-12 | Paper |
The price of multi-organization constraint in unrelated parallel machine scheduling
Parallel Processing Letters | 2012-12-12 | Paper |
How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
Theory of Computing Systems | 2012-12-06 | Paper |
The optimal tolerance of uniform observation error for mobile robot convergence
Theoretical Computer Science | 2012-08-10 | Paper |
Minimum certificate dispersal with tree structures
Lecture Notes in Computer Science | 2012-07-16 | Paper |
On the approximability and hardness of minimum topic connected overlay and its special instances
Theoretical Computer Science | 2012-05-30 | Paper |
The gathering problem for two oblivious robots with unreliable compasses
SIAM Journal on Computing | 2012-05-30 | Paper |
The cost of probabilistic agreement in oblivious robot networks
Information Processing Letters | 2012-01-18 | Paper |
Physical expander in virtual tree overlay
Lecture Notes in Computer Science | 2011-10-28 | Paper |
On the approximability of minimum topic connected overlay and its special instances
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Oracle-based flocking of mobile robots in crash-recovery model
Theoretical Computer Science | 2011-07-22 | Paper |
A crash-tolerant consensus algorithm in presence of probabilistic message omission
| 2011-03-25 | Paper |
Approximability and inapproximability of the minimum certificate dispersal problem
Theoretical Computer Science | 2010-07-07 | Paper |
Mobile robots gathering algorithm with local weak multiplicity in rings
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
Structural Information and Communication Complexity | 2010-02-24 | Paper |
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Information Processing Letters | 2010-01-29 | Paper |
Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem
Lecture Notes in Computer Science | 2009-07-23 | Paper |
One-Step Consensus Solvability
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Move-optimal gossiping among mobile agents
Theoretical Computer Science | 2008-04-15 | Paper |
Optimal Moves for Gossiping Among Mobile Agents
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing | 2007-06-04 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Synchronous Condition-Based Consensus Adapting to Input-Vector Legality
Lecture Notes in Computer Science | 2005-08-17 | Paper |
