| Publication | Date of Publication | Type |
|---|
Polylogarithmic time algorithms for shortest path forests in programmable matter
Distributed Computing | 2026-06-02 | Paper |
| Simple routing strategies for adversarial systems | 2026-05-08 | Paper |
| Fast hybrid network algorithms for shortest paths in sparse graphs | 2026-03-31 | Paper |
Efficient shape formation by 3D hybrid programmable matter: an algorithm for low diameter intermediate structures
Theoretical Computer Science | 2025-11-21 | Paper |
| Polylogarithmic time algorithms for shortest path forests in programmable matter | 2025-06-13 | Paper |
| Communication in parallel systems | 2024-06-21 | Paper |
| A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory | 2024-04-19 | Paper |
scientific article; zbMATH DE number 7832752 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-15 | Paper |
Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Time-optimal construction of overlay networks
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Forming tile shapes with simple robots
Natural Computing | 2024-02-09 | Paper |
Routing schemes for hybrid communication networks
Lecture Notes in Computer Science | 2024-01-11 | Paper |
Routing schemes for hybrid communication networks
Theoretical Computer Science | 2024-01-08 | Paper |
| The canonical amoebot model: algorithms and concurrency control | 2023-12-08 | Paper |
On the runtime of universal coating for programmable matter
Natural Computing | 2023-11-30 | Paper |
Competitive routing in hybrid communication networks
Algorithms for Sensor Systems | 2023-10-20 | Paper |
Time-optimal construction of overlay networks
Distributed Computing | 2023-09-11 | Paper |
Relays: a new approach for the finite departure problem in overlay networks
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Self-stabilizing overlays for high-dimensional monotonic searchability
Lecture Notes in Computer Science | 2023-08-02 | Paper |
On underlay-aware self-stabilizing overlay networks
Lecture Notes in Computer Science | 2023-08-02 | Paper |
A self-stabilizing hashed Patricia trie
Lecture Notes in Computer Science | 2023-08-02 | Paper |
The canonical amoebot model: algorithms and concurrency control
Distributed Computing | 2023-06-19 | Paper |
Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Beep-and-sleep: message and energy efficient set cover
Theoretical Computer Science | 2023-03-17 | Paper |
| Fast distributed algorithms for LP-type problems of low dimension | 2023-02-03 | Paper |
Improved Leader Election for Self-organizing Programmable Matter
Algorithms for Sensor Systems | 2022-12-09 | Paper |
A self-stabilizing general de Bruijn graph
Lecture Notes in Computer Science | 2022-11-04 | Paper |
On the Complexity of Local Graph Transformations
(available as arXiv preprint) | 2022-07-21 | Paper |
Beep-and-sleep: message and energy efficient set cover
Algorithms for Sensor Systems | 2022-06-24 | Paper |
A self-stabilizing hashed Patricia trie
Information and Computation | 2022-05-17 | Paper |
| Shape recognition by a finite automaton robot | 2021-08-04 | Paper |
Shortest Paths in a Hybrid Network Model
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Distributed monitoring of network properties: the power of hybrid networks | 2020-05-27 | Paper |
| Faster construction of overlay networks | 2020-03-03 | Paper |
A bounding box overlay for competitive routing in hybrid communication networks
(available as arXiv preprint) | 2020-03-03 | Paper |
Towards a universal approach for the finite departure problem in overlay networks
Lecture Notes in Computer Science | 2020-01-14 | Paper |
Self-stabilizing metric graphs
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Linearization: locally self-stabilizing sorting in graphs
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Self-stabilizing metric graphs
Theory of Computing Systems | 2019-06-21 | Paper |
| Approximate duality of multicommodity multiroute flows and cuts: single source case | 2019-05-10 | Paper |
| Forming tile shapes with simple robots | 2018-11-08 | Paper |
Principles of robust medium access and an application to leader election
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Towards a universal approach for monotonic searchability in self-stabilizing overlay networks
(available as arXiv preprint) | 2018-08-16 | Paper |
Sade: competitive MAC under adversarial SINR
Distributed Computing | 2018-06-01 | Paper |
Towards establishing monotonic searchability in self-stabilizing data structures
(available as arXiv preprint) | 2017-09-29 | Paper |
Towards a universal approach for the finite departure problem in overlay networks
Information and Computation | 2017-08-08 | Paper |
Universal coating for programmable matter
Theoretical Computer Science | 2017-05-18 | Paper |
On the runtime of universal coating for programmable matter
Lecture Notes in Computer Science | 2016-11-30 | Paper |
From static to dynamic routing: efficient transformations of store-and-forward protocols
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Minimum Linear Arrangement of Series-Parallel Graphs
Approximation and Online Algorithms | 2015-11-20 | Paper |
Leader election and shape formation with self-organizing programmable matter
Lecture Notes in Computer Science | 2015-09-30 | Paper |
On Stabilizing Departures in Overlay Networks
1521.68014 | 2015-09-18 | Paper |
Peer-to-peer systems for prefix search
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
\(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
Journal of the ACM | 2015-08-14 | Paper |
| The hyperring: a low-congestion deterministic data structure for distributed environments | 2015-08-03 | Paper |
A deterministic worst-case message complexity optimal solution for resource discovery
Theoretical Computer Science | 2015-05-22 | Paper |
A note on the parallel runtime of self-stabilizing graph linearization
Theory of Computing Systems | 2015-02-05 | Paper |
Re-Chord: a self-stabilizing chord overlay network
Theory of Computing Systems | 2015-01-19 | Paper |
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Competitive and fair throughput for co-existing networks under adversarial interference
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms | 2014-09-09 | Paper |
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
A denial-of-service resistant DHT
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Programming for Distributed Computing: From Physical to Logical Networks
Computer Science | 2014-02-21 | Paper |
Corona: a stabilizing deterministic message-passing skip list
Theoretical Computer Science | 2014-01-13 | Paper |
A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
Theory of Computing Systems | 2013-10-21 | Paper |
Competitive throughput in multi-hop wireless networks despite adaptive jamming
Distributed Computing | 2013-08-26 | Paper |
Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
Theoretical Computer Science | 2012-10-11 | Paper |
Tiara: a self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science | 2012-05-30 | Paper |
| Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing | 2012-01-23 | Paper |
Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
A jamming-resistant MAC protocol for multi-hop wireless networks
Lecture Notes in Computer Science | 2010-09-10 | Paper |
How to spread adversarial nodes?
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764840 (Why is no real title available?) | 2010-08-06 | Paper |
Perfectly balanced allocation
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Time complexity of distributed topological self-stabilization: the case of graph linearization
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
A self-stabilizing and local Delaunay graph construction
Algorithms and Computation | 2009-12-17 | Paper |
Towards a scalable and robust DHT
Theory of Computing Systems | 2009-10-19 | Paper |
| Algorithms for overlay networks. | 2009-09-19 | Paper |
A Distributed and Oblivious Heap
Automata, Languages and Programming | 2009-07-14 | Paper |
Robust random number generation for peer-to-peer systems
Theoretical Computer Science | 2009-03-02 | Paper |
A Denial-of-Service Resistant DHT
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
| Overlay networks for wireless ad hoc networks | 2007-11-05 | Paper |
Deterministic routing with bounded buffers: turning offline into online protocols
Combinatorica | 2007-03-29 | Paper |
The effect of faults on network expansion
Theory of Computing Systems | 2007-01-25 | Paper |
Improved bounds for the unsplittable flow problem
Journal of Algorithms | 2006-12-07 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Simple on-line algorithms for the maximum disjoint paths problem
Algorithmica | 2004-12-13 | Paper |
| scientific article; zbMATH DE number 2119660 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2086372 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2038781 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1775452 (Why is no real title available?) | 2002-09-17 | Paper |
| Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma | 2001-07-08 | Paper |
Efficient communication strategies for ad hoc wireless networks
Theory of Computing Systems | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1445282 (Why is no real title available?) | 2001-02-05 | Paper |
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1256753 (Why is no real title available?) | 1999-10-04 | Paper |
Simple, efficient routing schemes for all-optical networks
Theory of Computing Systems | 1999-06-29 | Paper |
| scientific article; zbMATH DE number 1305398 (Why is no real title available?) | 1999-06-17 | Paper |
Universal continuous routing strategies
Theory of Computing Systems | 1998-09-27 | Paper |
| scientific article; zbMATH DE number 1173684 (Why is no real title available?) | 1998-07-12 | Paper |
Exploiting storage redundancy to speed up randomized shared memory simulations
Theoretical Computer Science | 1997-09-10 | Paper |
