| Publication | Date of Publication | Type |
|---|
| Parameterized Complexity of Broadcasting in Graphs | 2024-05-03 | Paper |
| Parameterized complexity of broadcasting in graphs | 2024-04-16 | Paper |
| On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model | 2024-04-04 | Paper |
| The Topology of Randomized Symmetry-Breaking Distributed Computing | 2024-03-26 | Paper |
| A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement | 2024-03-26 | Paper |
| Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle | 2024-03-26 | Paper |
| A meta-theorem for distributed certification | 2024-01-25 | Paper |
| On the power of threshold-based algorithms for detecting cycles in the CONGEST model | 2024-01-11 | Paper |
| Energy-efficient distributed algorithms for synchronous networks | 2024-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083427 | 2023-12-08 | Paper |
| Synchronous \(t\)-resilient consensus in arbitrary graphs | 2023-05-19 | Paper |
| Decentralized Asynchronous Crash-resilient Runtime Verification | 2023-04-27 | Paper |
| How Do Mobile Agents Benefit from Randomness? | 2023-04-21 | Paper |
| Certification of compact low-stretch routing schemes | 2023-02-03 | 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 |
| Local certification of graphs with bounded genus | 2022-12-08 | Paper |
| A meta-theorem for distributed certification | 2022-11-11 | Paper |
| Present-biased optimization | 2022-10-04 | Paper |
| Distributed Testing of Distance-k Colorings | 2022-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090916 | 2022-07-21 | Paper |
| Equilibria of Games in Networks for Local Tasks | 2022-07-21 | Paper |
| Compact distributed certification of planar graphs | 2021-06-30 | Paper |
| Redundancy in distributed proofs | 2021-05-17 | Paper |
| Compact Distributed Certification of Planar Graphs | 2021-03-15 | Paper |
| A hierarchy of local decision | 2021-01-19 | Paper |
| A topological perspective on distributed network algorithms | 2020-12-15 | Paper |
| Perfect failure detection with very few bits | 2020-12-15 | Paper |
| Assigning labels in an unknown anonymous network with a leader | 2020-12-03 | Paper |
| Interval routing schemes allow broadcasting with linear message-complexity | 2020-12-03 | Paper |
| Universal routing schemes | 2020-12-02 | Paper |
| Deciding and verifying network properties locally with few output bits | 2020-04-23 | Paper |
| A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring | 2020-03-06 | Paper |
| A topological perspective on distributed network algorithms | 2020-03-03 | Paper |
| On distributed Merlin-Arthur decision protocols | 2020-03-03 | Paper |
| Perfect failure detection with very few bits | 2019-11-22 | Paper |
| Parallel Bayesian Search with No Coordination | 2019-11-21 | Paper |
| Noisy rumor spreading and plurality consensus | 2019-08-13 | Paper |
| Randomized proof-labeling schemes | 2019-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967211 | 2019-07-03 | Paper |
| Node labels in local decision | 2018-11-29 | Paper |
| Label-guided graph exploration by a finite automaton | 2018-11-05 | Paper |
| What can be verified locally? | 2018-09-07 | Paper |
| Distributed testing of excluded subgraphs | 2018-08-16 | Paper |
| An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636605 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608668 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598260 | 2017-12-19 | Paper |
| On the additive constant of the \(k\)-server work function algorithm | 2017-11-03 | Paper |
| A characterization of networks supporting linear interval routing | 2017-09-29 | Paper |
| Memory requirement for universal routing schemes | 2017-09-29 | Paper |
| Parallel exhaustive search without coordination | 2017-09-29 | Paper |
| Noisy Rumor Spreading and Plurality Consensus | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Asynchronous Coordination Under Preferences and Constraints | 2016-12-01 | Paper |
| Sparsifying Congested Cliques and Core-Periphery Networks | 2016-12-01 | Paper |
| Hierarchical broadcast networks | 2016-06-09 | Paper |
| Shrinking maxima, decreasing costs: new online packing and covering problems | 2016-05-31 | Paper |
| Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings | 2016-05-03 | Paper |
| Randomized Proof-Labeling Schemes | 2016-03-23 | Paper |
| Rumor spreading in random evolving graphs | 2016-03-22 | Paper |
| Node labels in local decision | 2016-01-08 | Paper |
| On the complexity of the shortest-path broadcast problem | 2015-12-10 | Paper |
| Distributedly Testing Cycle-Freeness | 2015-09-09 | Paper |
| On the Impact of Identifiers on Local Decision | 2015-08-05 | Paper |
| Eclecticism shrinks even small worlds | 2015-08-03 | Paper |
| Oracle size | 2015-03-10 | Paper |
| Interval routing schemes allow broadcasting with linear message-complexity (extended abstract) | 2015-03-03 | Paper |
| Assigning labels in unknown anonymous networks (extended abstract) | 2015-03-03 | Paper |
| What can be decided locally without identifiers? | 2015-03-02 | Paper |
| Greedy routing in small-world networks with power-law degrees | 2015-02-23 | Paper |
| Randomized distributed decision | 2015-02-23 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Delays Induce an Exponential Memory Gap for Rendezvous in Trees | 2014-12-05 | Paper |
| The worst case behavior of randomized gossip protocols | 2014-12-02 | Paper |
| On the searchability of small-world networks with arbitrary underlying structure | 2014-08-13 | Paper |
| An optimal ancestry scheme and small universal posets | 2014-08-13 | Paper |
| Local Distributed Decision | 2014-07-30 | Paper |
| The effect of power-law degrees on the navigability of small worlds | 2014-07-23 | Paper |
| Parsimonious flooding in dynamic graphs | 2014-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417638 | 2014-05-22 | Paper |
| Locality and checkability in wait-free computing | 2014-03-25 | Paper |
| Towards a complexity theory for local distributed computing | 2014-02-17 | Paper |
| Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems | 2013-10-04 | Paper |
| Rumor Spreading in Random Evolving Graphs | 2013-09-17 | Paper |
| Distributed computing with advice: information sensitivity of graph coloring | 2013-06-28 | Paper |
| Eclecticism shrinks even small worlds | 2013-06-13 | Paper |
| Randomized distributed decision | 2013-03-13 | Paper |
| Connected graph searching | 2012-11-27 | Paper |
| Computing with Large Populations Using Interactions | 2012-09-25 | Paper |
| The Worst Case Behavior of Randomized Gossip | 2012-07-16 | Paper |
| Decidability Classes for Mobile Agents Computing | 2012-06-29 | Paper |
| Parsimonious flooding in dynamic graphs | 2012-02-06 | Paper |
| Locality and Checkability in Wait-Free Computing | 2011-10-28 | Paper |
| Online computation with advice | 2011-06-07 | Paper |
| A Lower Bound for Network Navigability | 2011-03-15 | Paper |
| Local MST computation with short advice | 2010-12-17 | Paper |
| Communication algorithms with advice | 2010-05-25 | Paper |
| On the Additive Constant of the k-Server Work Function Algorithm | 2010-05-11 | Paper |
| Recovering the long-range links in augmented graphs | 2010-04-06 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Sub-linear Universal Spatial Gossip Protocols | 2010-02-24 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Online Computation with Advice | 2009-07-14 | Paper |
| Nondeterministic graph searching: from pathwidth to treewidth | 2009-06-17 | Paper |
| Universal augmentation schemes for network navigability | 2009-05-28 | Paper |
| Labeling schemes for tree representation | 2009-05-13 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Distributed Chasing of Network Intruders | 2009-03-12 | Paper |
| Monotony properties of connected visible graph searching | 2009-02-03 | Paper |
| Tree exploration with advice | 2008-12-03 | Paper |
| Deterministic Rendezvous in Trees with Little Memory | 2008-11-20 | Paper |
| Impact of memory size on graph exploration capability | 2008-09-29 | Paper |
| Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation | 2008-09-25 | Paper |
| Connected Treewidth and Connected Graph Searching | 2008-09-18 | Paper |
| Monotony Properties of Connected Visible Graph Searching | 2008-09-04 | Paper |
| Networks Become Navigable as Nodes Move and Forget | 2008-08-28 | Paper |
| Recovering the Long-Range Links in Augmented Graphs | 2008-07-10 | Paper |
| Distributed chasing of network intruders | 2008-06-24 | Paper |
| A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability | 2008-03-11 | Paper |
| Distributed Computing with Advice: Information Sensitivity of Graph Coloring | 2007-11-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Tree Exploration with an Oracle | 2007-09-05 | Paper |
| Collective tree exploration | 2007-02-15 | Paper |
| Rendezvous and election of mobile agents: Impact of sense of direction | 2007-02-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Deterministic rendezvous in graphs | 2006-10-16 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Header-size lower bounds for end-to-end communication in memoryless networks | 2006-06-30 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| D2B: A de Bruijn based content-addressable network | 2006-04-28 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Graph exploration by a finite automaton | 2005-12-06 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE | 2005-09-12 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Efficient trigger-broadcasting in heterogeneous clusters | 2005-06-01 | Paper |
| A note on line broadcast in digraphs under the edge-disjoint paths mode | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828987 | 2004-11-29 | Paper |
| Tree exploration with little memory | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736828 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471372 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436057 | 2003-11-23 | Paper |
| Polynomial-time algorithms for minimum-time broadcast in trees | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796194 | 2003-03-02 | Paper |
| Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs | 2002-09-19 | Paper |
| Recognizing Knödel graphs | 2002-08-29 | Paper |
| Oriented hypercubes | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535803 | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517676 | 2001-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753924 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944982 | 2000-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252389 | 1999-01-01 | Paper |
| Interval routing schemes | 1998-10-01 | Paper |
| On XRAM and PRAM models, and on data-movement-intensive problems | 1998-08-13 | Paper |
| Strategies for path-based multicasting in wormhole-routed meshes | 1998-01-01 | Paper |
| Minimum gossip bus networks | 1996-11-25 | Paper |
| Antepenultimate broadcasting | 1996-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4877913 | 1996-08-26 | Paper |
| Methods and problems of communication in usual networks | 1995-08-28 | Paper |
| Finding a target subnetwork in sparse networks with random faults | 1994-09-25 | Paper |
| Broadcasting and Gossiping in de Bruijn Networks | 1994-03-27 | Paper |
| Complexity analysis of broadcasting in hypercubes with restricted communication capabilities | 1993-01-17 | Paper |
| Broadcasting in a hypercube when some calls fail | 1992-06-27 | Paper |
| The Durand-Kerner polynomials roots-finding method in case of multiple roots | 1991-01-01 | Paper |
| Finding the roots of a polynomial on an MIMD multicomputer | 1990-01-01 | Paper |
| Scattering on a ring of processors | 1990-01-01 | Paper |
