| Publication | Date of Publication | Type |
|---|
| Distributed quantum proofs for replicated data | 2026-04-15 | Paper |
| The topology of local computing in networks | 2026-03-18 | Paper |
The computational power of distributed shared-memory models with bounded-size registers
Distributed Computing | 2026-02-25 | Paper |
Distributed model checking on graphs of bounded treedepth
Algorithmica | 2025-12-16 | Paper |
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
Distributed Computing | 2025-10-29 | Paper |
| Local conflict coloring | 2025-08-06 | Paper |
| The computational power of distributed shared-memory models with bounded-size registers | 2025-06-13 | Paper |
| Even-cycle detection in the randomized and quantum CONGEST model | 2025-06-13 | Paper |
| Brief announcement: Distributed model checking on graphs of bounded treedepth | 2025-06-13 | Paper |
| The reduced automata technique for graph exploration space lower bounds | 2025-03-19 | Paper |
Distributed computing in the asynchronous LOCAL model
Theoretical Computer Science | 2024-12-12 | Paper |
The topology of randomized symmetry-breaking distributed computing
Journal of Applied and Computational Topology | 2024-11-29 | Paper |
The topology of local computing in networks
Journal of Applied and Computational Topology | 2024-11-29 | Paper |
| Source-oblivious broadcast | 2024-11-12 | Paper |
| Parameterized Complexity of Broadcasting in Graphs | 2024-05-03 | Paper |
| Synchronous t-resilient consensus in arbitrary graphs | 2024-04-19 | Paper |
Parameterized complexity of broadcasting in graphs
Theoretical Computer Science | 2024-04-16 | Paper |
On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model
Theoretical Computer Science | 2024-04-04 | Paper |
The Topology of Randomized Symmetry-Breaking Distributed Computing
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
A meta-theorem for distributed certification
Algorithmica | 2024-01-25 | Paper |
On the power of threshold-based algorithms for detecting cycles in the CONGEST model
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Energy-efficient distributed algorithms for synchronous networks
Structural Information and Communication Complexity | 2024-01-11 | Paper |
| scientific article; zbMATH DE number 7774298 (Why is no real title available?) | 2023-12-08 | Paper |
| Brief announcement: Distributed quantum proofs for replicated data | 2023-11-02 | Paper |
Synchronous \(t\)-resilient consensus in arbitrary graphs
Information and Computation | 2023-05-19 | Paper |
Decentralized Asynchronous Crash-resilient Runtime Verification
Journal of the ACM | 2023-04-27 | Paper |
| How Do Mobile Agents Benefit from Randomness? | 2023-04-21 | Paper |
| Three notes on distributed property testing | 2023-02-03 | Paper |
| Error-sensitive proof-labeling schemes | 2023-02-03 | Paper |
| Trade-offs in distributed interactive proofs | 2023-02-03 | Paper |
| Certification of compact low-stretch routing schemes | 2023-02-03 | Paper |
Local certification of graphs with bounded genus
Discrete Applied Mathematics | 2022-12-08 | Paper |
A meta-theorem for distributed certification
(available as arXiv preprint) | 2022-11-11 | Paper |
Present-biased optimization
Mathematical Social Sciences | 2022-10-04 | Paper |
Distributed Testing of Distance-k Colorings
Structural Information and Communication Complexity | 2022-09-01 | Paper |
| Redundancy in distributed proofs | 2022-07-21 | Paper |
| Equilibria of Games in Networks for Local Tasks | 2022-07-21 | Paper |
Compact distributed certification of planar graphs
Algorithmica | 2021-06-30 | Paper |
Redundancy in distributed proofs
Distributed Computing | 2021-05-17 | Paper |
Compact Distributed Certification of Planar Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
A hierarchy of local decision
Theoretical Computer Science | 2021-01-19 | Paper |
A topological perspective on distributed network algorithms
Theoretical Computer Science | 2020-12-15 | Paper |
Perfect failure detection with very few bits
Information and Computation | 2020-12-15 | Paper |
Interval routing schemes allow broadcasting with linear message-complexity
Distributed Computing | 2020-12-03 | Paper |
Assigning labels in an unknown anonymous network with a leader
Distributed Computing | 2020-12-03 | Paper |
Universal routing schemes
Distributed Computing | 2020-12-02 | Paper |
Deciding and verifying network properties locally with few output bits
Distributed Computing | 2020-04-23 | Paper |
A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
Journal of Applied and Computational Topology | 2020-03-06 | Paper |
| On distributed Merlin-Arthur decision protocols | 2020-03-03 | Paper |
A topological perspective on distributed network algorithms
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Perfect failure detection with very few bits
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Parallel Bayesian search with no coordination
Journal of the ACM | 2019-11-21 | Paper |
Noisy rumor spreading and plurality consensus
Distributed Computing | 2019-08-13 | Paper |
Randomized proof-labeling schemes
Distributed Computing | 2019-07-11 | Paper |
| Survey of distributed decision | 2019-07-03 | Paper |
Survey of distributed decision
(available as arXiv preprint) | 2019-07-03 | Paper |
Node labels in local decision
Theoretical Computer Science | 2018-11-29 | Paper |
Label-guided graph exploration by a finite automaton
ACM Transactions on Algorithms | 2018-11-05 | Paper |
What can be verified locally?
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Distributed testing of excluded subgraphs
(available as arXiv preprint) | 2018-08-16 | Paper |
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets
Journal of the ACM | 2018-08-02 | Paper |
| What can be verified locally? | 2018-04-19 | Paper |
| Decentralized asynchronous crash-resilient runtime verification | 2018-03-21 | Paper |
scientific article; zbMATH DE number 6820307 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
On the additive constant of the k-server work function algorithm
Information Processing Letters | 2017-11-03 | Paper |
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
A characterization of networks supporting linear interval routing
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Parallel exhaustive search without coordination
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Noisy rumor spreading and plurality consensus (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Brief announcement: Asynchronous coordination with constraints and preferences
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Asynchronous coordination under preferences and constraints
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Sparsifying congested cliques and core-periphery networks
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Hierarchical broadcast networks
Information Processing Letters | 2016-06-09 | Paper |
Shrinking maxima, decreasing costs: new online packing and covering problems
Algorithmica | 2016-05-31 | Paper |
Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Randomized proof-labeling schemes
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Rumor spreading in random evolving graphs
Random Structures & Algorithms | 2016-03-22 | Paper |
Node labels in local decision
Lecture Notes in Computer Science | 2016-01-08 | Paper |
On the complexity of the shortest-path broadcast problem
Discrete Applied Mathematics | 2015-12-10 | Paper |
Distributedly testing cycle-freeness
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
On the Impact of Identifiers on Local Decision
Lecture Notes in Computer Science | 2015-08-05 | Paper |
Eclecticism shrinks even small worlds
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Oracle size, a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
What can be decided locally without identifiers?
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Greedy routing in small-world networks with power-law degrees
Distributed Computing | 2015-02-23 | Paper |
Randomized distributed decision
Distributed Computing | 2015-02-23 | Paper |
Brief announcement: What can be computed without communication?
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Delays induce an exponential memory gap for rendezvous in trees
ACM Transactions on Algorithms | 2014-12-05 | Paper |
The worst case behavior of randomized gossip protocols
Theoretical Computer Science | 2014-12-02 | Paper |
On the searchability of small-world networks with arbitrary underlying structure
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
An optimal ancestry scheme and small universal posets
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Local Distributed Decision
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
The effect of power-law degrees on the navigability of small worlds (extended abstract)
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
| Compact ancestry labeling schemes for XML trees | 2014-05-22 | Paper |
Locality and checkability in wait-free computing
Distributed Computing | 2014-03-25 | Paper |
Towards a complexity theory for local distributed computing
Journal of the ACM | 2014-02-17 | Paper |
Shrinking maxima, decreasing costs: new online packing and covering problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Rumor spreading in random evolving graphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Distributed computing with advice: information sensitivity of graph coloring
Distributed Computing | 2013-06-28 | Paper |
Eclecticism shrinks even small worlds
Distributed Computing | 2013-06-13 | Paper |
Randomized distributed decision
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Connected graph searching
Information and Computation | 2012-11-27 | Paper |
Computing with Large Populations Using Interactions
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
The worst case behavior of randomized gossip
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Decidability classes for mobile agents computing
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Parsimonious flooding in dynamic graphs
Distributed Computing | 2012-02-06 | Paper |
Locality and checkability in wait-free computing
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Online computation with advice
Theoretical Computer Science | 2011-06-07 | Paper |
A lower bound for network navigability
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Local MST computation with short advice
Theory of Computing Systems | 2010-12-17 | Paper |
Communication algorithms with advice
Journal of Computer and System Sciences | 2010-05-25 | Paper |
On the additive constant of the \(k\)-server work function algorithm
Approximation and Online Algorithms | 2010-05-11 | Paper |
Recovering the long-range links in augmented graphs
Theoretical Computer Science | 2010-04-06 | Paper |
Deterministic rendezvous in graphs
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Sub-linear universal spatial gossip protocols
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Lower bounds for oblivious single-packet end-to-end communication
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Searching is not jumping.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Online Computation with Advice
Automata, Languages and Programming | 2009-07-14 | Paper |
Nondeterministic graph searching: from pathwidth to treewidth
Algorithmica | 2009-06-17 | Paper |
Universal augmentation schemes for network navigability
Theoretical Computer Science | 2009-05-28 | Paper |
Labeling schemes for tree representation
Algorithmica | 2009-05-13 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Distributed Chasing of Network Intruders
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Monotony properties of connected visible graph searching
Information and Computation | 2009-02-03 | Paper |
Tree exploration with advice
Information and Computation | 2008-12-03 | Paper |
Deterministic Rendezvous in Trees with Little Memory
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Impact of memory size on graph exploration capability
Discrete Applied Mathematics | 2008-09-29 | Paper |
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Connected Treewidth and Connected Graph Searching
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Monotony Properties of Connected Visible Graph Searching
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Networks Become Navigable as Nodes Move and Forget
Automata, Languages and Programming | 2008-08-28 | Paper |
Recovering the Long-Range Links in Augmented Graphs
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Distributed chasing of network intruders
Theoretical Computer Science | 2008-06-24 | Paper |
A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
Automata, Languages and Programming | 2007-11-28 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Tree Exploration with an Oracle
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Collective tree exploration
Networks | 2007-02-15 | Paper |
Rendezvous and election of mobile agents: Impact of sense of direction
Theory of Computing Systems | 2007-02-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Deterministic rendezvous in graphs
Algorithmica | 2006-10-16 | Paper |
Distributed Computing – IWDC 2005
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks | 2006-06-30 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
D2B: A de Bruijn based content-addressable network
Theoretical Computer Science | 2006-04-28 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Graph exploration by a finite automaton
Theoretical Computer Science | 2005-12-06 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE
International Journal of Foundations of Computer Science | 2005-09-12 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing | 2005-06-01 | Paper |
A note on line broadcast in digraphs under the edge-disjoint paths mode
Discrete Applied Mathematics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2119714 (Why is no real title available?) | 2004-11-29 | Paper |
Tree exploration with little memory
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2086374 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079412 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2006658 (Why is no real title available?) | 2003-11-23 | Paper |
Polynomial-time algorithms for minimum-time broadcast in trees
Theory of Computing Systems | 2003-05-04 | Paper |
| scientific article; zbMATH DE number 1875435 (Why is no real title available?) | 2003-03-02 | Paper |
Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
Networks | 2002-09-19 | Paper |
Recognizing Knödel graphs
Discrete Mathematics | 2002-08-29 | Paper |
Oriented hypercubes
Networks | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1756017 (Why is no real title available?) | 2002-06-16 | Paper |
| scientific article; zbMATH DE number 1532270 (Why is no real title available?) | 2001-11-22 | Paper |
| scientific article; zbMATH DE number 1670648 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1420912 (Why is no real title available?) | 2000-08-03 | Paper |
| scientific article; zbMATH DE number 1305499 (Why is no real title available?) | 1999-01-01 | Paper |
Interval routing schemes
Algorithmica | 1998-10-01 | Paper |
On XRAM and PRAM models, and on data-movement-intensive problems
Theoretical Computer Science | 1998-08-13 | Paper |
Strategies for path-based multicasting in wormhole-routed meshes
Journal of Parallel and Distributed Computing | 1998-01-01 | Paper |
| Minimum gossip bus networks | 1996-11-25 | Paper |
Antepenultimate broadcasting
Networks | 1996-10-07 | Paper |
| scientific article; zbMATH DE number 880381 (Why is no real title available?) | 1996-08-26 | Paper |
Methods and problems of communication in usual networks
Discrete Applied Mathematics | 1995-08-28 | Paper |
Finding a target subnetwork in sparse networks with random faults
Information Processing Letters | 1994-09-25 | Paper |
Broadcasting and Gossiping in de Bruijn Networks
SIAM Journal on Computing | 1994-03-27 | Paper |
Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
Journal of Parallel and Distributed Computing | 1993-01-17 | Paper |
Broadcasting in a hypercube when some calls fail
Information Processing Letters | 1992-06-27 | Paper |
The Durand-Kerner polynomials roots-finding method in case of multiple roots
BIT | 1991-01-01 | Paper |
Finding the roots of a polynomial on an MIMD multicomputer
Parallel Computing | 1990-01-01 | Paper |
Scattering on a ring of processors
Parallel Computing | 1990-01-01 | Paper |
