| Publication | Date of Publication | Type |
|---|
| On the power of bounded asynchrony: convergence by autonomous robots with limited visibility | 2024-09-10 | Paper |
| Separating Bounded and Unbounded Asynchrony for Autonomous Robots | 2024-03-26 | Paper |
| (Time × space)-efficient implementations of hlerarchical conceptual models | 2024-02-28 | Paper |
| Cops \& robber on periodic temporal graphs: characterization and improved bounds | 2024-01-11 | Paper |
| Copnumbers of periodic graphs | 2023-10-20 | Paper |
| On the complexity of testing for catastrophic faults | 2023-03-21 | Paper |
| Tight bounds on distributed exploration of temporal graphs | 2023-02-07 | Paper |
| Oblivious Permutations on the Plane | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874258 | 2023-02-07 | Paper |
| Gathering and Election by Mobile Robots in a Continuous Cycle. | 2023-02-03 | Paper |
| Meeting in a polygon by anonymous oblivious robots | 2023-02-03 | Paper |
| Time vs bits | 2022-08-16 | Paper |
| Time is not a healer | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090910 | 2022-07-21 | Paper |
| TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications | 2022-04-01 | Paper |
| On synchronization and orientation in distributed barrier coverage with relocatable sensors | 2021-09-27 | Paper |
| Exploration of dynamic networks: tight bounds on the number of agents | 2021-09-17 | Paper |
| Line reconfiguration by programmable particles maintaining connectivity | 2021-07-06 | Paper |
| Fault-tolerant simulation of population protocols | 2021-01-22 | Paper |
| Distributed computing on oriented anonymous hypercubes with faulty components | 2020-12-03 | Paper |
| Meeting in a polygon by anonymous oblivious robots | 2020-10-16 | Paper |
| Shape formation by programmable particles | 2020-07-30 | Paper |
| Distributed exploration of dynamic rings | 2020-04-21 | Paper |
| Shape formation by programmable particles | 2020-04-21 | Paper |
| Gathering in dynamic rings | 2020-02-13 | Paper |
| Population protocols with faulty interactions: the impact of a leader | 2018-12-04 | Paper |
| Uniform dispersal of asynchronous finite-state mobile robots in presence of holes | 2018-10-17 | Paper |
| On the Microscopic View of Time and Messages | 2018-10-04 | Paper |
| Optimal elections in faulty loop networks and applications | 2018-07-09 | Paper |
| Efficient parallel graph algorithms for coarse grained multicomputers and BSP | 2018-07-04 | Paper |
| Gathering in dynamic rings | 2018-04-12 | Paper |
| Distributed computing by mobile robots: uniform circle formation | 2017-11-29 | Paper |
| Time to Change: On Distributed Computing in Dynamic Networks (Keynote) | 2017-09-29 | Paper |
| Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks | 2017-08-08 | Paper |
| Efficient, Decentralized Computation of the Topology of Spatial Regions | 2017-07-27 | Paper |
| Population protocols with faulty interactions: the impact of a leader | 2017-07-21 | Paper |
| A Rupestrian Algorithm. | 2017-07-17 | Paper |
| Distributed Minimum Spanning Tree Maintenance for Transient Node Failures | 2017-07-12 | Paper |
| Measuring Temporal Lags in Delay-Tolerant Networks | 2017-06-20 | Paper |
| Mediated Population Protocols: Leader Election and Applications | 2017-05-19 | Paper |
| Mutual visibility by luminous robots without collisions | 2017-05-12 | Paper |
| Universal Systems of Oblivious Mobile Robots | 2016-12-01 | Paper |
| On the impact of sense of direction on message complexity | 2016-05-26 | Paper |
| Rendezvous with constant memory | 2016-02-26 | Paper |
| Network decontamination under \(m\)-immunity | 2016-02-04 | Paper |
| Exploring an unknown dangerous graph with a constant number of tokens | 2015-12-10 | Paper |
| Autonomous mobile robots with lights | 2015-12-08 | Paper |
| Shortest, Fastest, and Foremost Broadcast in Dynamic Networks | 2015-09-29 | Paper |
| Backward consistency and sense of direction in advanced distributed systems | 2015-09-11 | Paper |
| Forming sequences of geometric patterns with oblivious mobile robots | 2015-07-08 | Paper |
| On the expressivity of time-varying graphs | 2015-06-10 | Paper |
| TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION | 2015-04-29 | Paper |
| On the computational power of oblivious robots | 2015-03-02 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Distributed Barrier Coverage with Relocatable Sensors | 2014-08-07 | Paper |
| Searching for a black hole in arbitrary networks | 2014-07-25 | Paper |
| Rendezvous of Two Robots with Constant Memory | 2013-12-17 | Paper |
| Expressivity of Time-Varying Graphs | 2013-08-16 | Paper |
| Computing without communicating: ring exploration by asynchronous oblivious robots | 2013-08-05 | Paper |
| Searching for a black hole in arbitrary networks: optimal mobile agents protocols | 2013-06-20 | Paper |
| Optimal Network Decontamination with Threshold Immunity | 2013-06-07 | Paper |
| How many oblivious robots can explore a line | 2013-04-04 | Paper |
| Exploring an unknown dangerous graph using tokens | 2013-03-04 | Paper |
| On the exploration of time-varying networks | 2013-02-19 | Paper |
| Searching for black holes in subways | 2012-12-06 | Paper |
| Distributed Computing by Mobile Robots: Gathering | 2012-11-29 | Paper |
| Connected graph searching | 2012-11-27 | Paper |
| TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS | 2012-08-27 | Paper |
| Computing all the best swap edges distributively | 2012-07-26 | Paper |
| Ping pong in dangerous graphs: optimal black hole search with pebbles | 2012-04-26 | Paper |
| UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID | 2011-05-10 | Paper |
| Computing by Mobile Robotic Sensors | 2011-04-05 | Paper |
| Time Optimal Algorithms for Black Hole Search in Rings | 2011-01-10 | Paper |
| Network Exploration by Silent and Oblivious Robots | 2010-11-16 | Paper |
| Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility | 2010-10-27 | Paper |
| Remembering without memory: tree exploration by asynchronous oblivious robots | 2010-04-06 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Exploration of Periodically Varying Graphs | 2009-12-17 | Paper |
| Fault-tolerant sequential scan | 2009-09-18 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| On Fractional Dynamic Faults with Threshold | 2009-03-12 | Paper |
| USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS | 2009-02-26 | Paper |
| Tree Decontamination with Temporary Immunity | 2009-01-29 | Paper |
| Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments | 2009-01-22 | Paper |
| Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens | 2008-11-20 | Paper |
| Arbitrary pattern formation by asynchronous, anonymous, oblivious robots | 2008-11-18 | Paper |
| Groupings and Pairings in Anonymous Networks | 2008-09-09 | Paper |
| Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links | 2008-09-02 | Paper |
| A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree | 2008-09-02 | Paper |
| Self-deployment of mobile sensors on a ring | 2008-08-14 | Paper |
| Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots | 2008-07-10 | Paper |
| On fractional dynamic faults with thresholds | 2008-06-24 | Paper |
| Effective Elections for Anonymous Mobile Agents | 2008-04-24 | Paper |
| Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents | 2007-11-15 | Paper |
| Map construction of unknown graphs by multiple agents | 2007-10-18 | Paper |
| Agreement in synchronous networks with ubiquitous faults | 2007-10-02 | Paper |
| Mobile search for a black hole in an anonymous ring | 2007-07-19 | Paper |
| NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY | 2007-06-05 | Paper |
| Rendezvous and election of mobile agents: Impact of sense of direction | 2007-02-14 | Paper |
| Design and Analysis of Distributed Algorithms | 2007-01-15 | Paper |
| Efficient token-based control in rings. | 2006-01-17 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Preface: Fun with algorithms | 2005-09-27 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Principles of Distributed Systems | 2005-08-24 | Paper |
| Gathering of asynchronous robots with limited visibility | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673402 | 2005-04-29 | Paper |
| On time versus size for monotone dynamic monopolies in regular topologies | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473976 | 2004-08-04 | Paper |
| Dynamic monopolies in tori. | 2004-03-14 | Paper |
| Sorting and election in anonymous asynchronous rings. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449250 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436049 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422977 | 2003-08-24 | Paper |
| Tight bounds for synchronous communication of information using bits and silence | 2003-07-30 | Paper |
| Computing on anonymous networks with sense of direction | 2003-07-30 | Paper |
| Backward Consistency and Sense of Direction in Advanced Distributed Systems | 2003-06-19 | Paper |
| Sense of direction in distributed computing | 2003-05-14 | Paper |
| Sense of direction: Definitions, properties, and classes | 2002-07-21 | Paper |
| Optimal irreversible dynamos in chordal rings | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762510 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729100 | 2001-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751456 | 2001-10-21 | Paper |
| Convergence and aperiodicity in fuzzy cellular automata: Revisiting rule 90 | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944981 | 2000-03-22 | Paper |
| Cellular automata in fuzzy backgrounds | 2000-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838397 | 1998-11-26 | Paper |
| Symmetries and sense of direction in labeled graphs | 1998-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387732 | 1998-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385172 | 1998-04-13 | Paper |
| Improved bounds for electing a leader in a synchronous ring | 1997-05-28 | Paper |
| On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy | 1997-02-27 | Paper |
| Finding the extrema of a distributed multiset | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4322074 | 1995-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289074 | 1994-10-31 | Paper |
| Efficient construction of catastrophic patterns for VLSI reconfigurable arrays | 1994-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281655 | 1994-09-26 | Paper |
| Guarding rectangular art galleries | 1994-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139515 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694723 | 1993-06-29 | Paper |
| A distributed selection algorithm and its expected communication complexity | 1992-09-27 | Paper |
| Computational geometry algorithms for the systolic screen | 1992-06-25 | Paper |
| Sums of lexicographically ordered sets | 1990-01-01 | Paper |
| Efficient elections in chordal ring networks | 1989-01-01 | Paper |
| Geometric Containment and Partial Orders | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730787 | 1989-01-01 | Paper |
| A practical algorithm for Boolean matrix multiplication | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787488 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794820 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801068 | 1988-01-01 | Paper |
| Geometric containment and vector dominance | 1987-01-01 | Paper |
| Angle orders, regular n-gon orders and the crossing number | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785907 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787482 | 1987-01-01 | Paper |
| An improved algorithm for Boolean matrix multiplication | 1986-01-01 | Paper |
| Uniquely colourable m-dichromatic oriented graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735086 | 1986-01-01 | Paper |
| Shout echo selection in distributed files | 1986-01-01 | Paper |
| Min-max heaps and generalized priority queues | 1986-01-01 | Paper |
| Interpolation-binary search | 1985-01-01 | Paper |
| Distributed Sorting | 1985-01-01 | Paper |
| Labelling and Implicit Routing in Networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683099 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332237 | 1984-01-01 | Paper |
| Distributed algorithms for finding centers and medians in networks | 1984-01-01 | Paper |
| Distributed election in a circle without a global sense of orientation | 1984-01-01 | Paper |
| On the message complexity of distributed problems | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5186269 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341890 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3319762 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945584 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745251 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745257 | 1981-01-01 | Paper |
| Extending the four Russians' bound to general matrix multiplication | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3880280 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3898427 | 1980-01-01 | Paper |
| On hash techniques in a paged environment | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3926049 | 1978-01-01 | Paper |
| Full table search by polynomial functions | 1976-01-01 | Paper |
| Operations on permutations and representation in graph form | 1976-01-01 | Paper |
