| Publication | Date of Publication | Type |
|---|
Universal pattern formation by oblivious robots under sequential schedulers
Distributed Computing | 2026-05-13 | Paper |
| COP numbers of periodic graphs | 2026-04-29 | Paper |
Cops \& Robber on periodic temporal graphs
Discrete Applied Mathematics | 2025-12-11 | Paper |
| Keynote: Time is not a healer: before and after | 2025-06-13 | Paper |
On the computational power of energy-constrained mobile robots
Information and Computation | 2025-02-28 | Paper |
| The minimum algorithm size of k-grouping by silent oblivious robots | 2025-02-28 | Paper |
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
Distributed Computing | 2024-09-10 | Paper |
Separating Bounded and Unbounded Asynchrony for Autonomous Robots
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
(Time × space)-efficient implementations of hlerarchical conceptual models
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Cops \& robber on periodic temporal graphs: characterization and improved bounds
Structural Information and Communication Complexity | 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 |
| scientific article; zbMATH DE number 7650875 (Why is no real title available?) | 2023-02-07 | Paper |
Oblivious Permutations on the Plane
(available as arXiv preprint) | 2023-02-07 | Paper |
| Meeting in a polygon by anonymous oblivious robots | 2023-02-03 | Paper |
| Gathering and Election by Mobile Robots in a Continuous Cycle. | 2023-02-03 | Paper |
Time is not a healer (preliminary version)
STACS 89 | 2022-08-16 | Paper |
Time vs bits
STACS 89 | 2022-08-16 | Paper |
| TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications | 2022-07-21 | Paper |
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
Distributed Computing | 2022-04-01 | Paper |
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
Distributed Computing | 2022-04-01 | Paper |
On synchronization and orientation in distributed barrier coverage with relocatable sensors
Theoretical Computer Science | 2021-09-27 | Paper |
Exploration of dynamic networks: tight bounds on the number of agents
Journal of Computer and System Sciences | 2021-09-17 | Paper |
| Line reconfiguration by programmable particles maintaining connectivity | 2021-07-06 | Paper |
Fault-tolerant simulation of population protocols
Distributed Computing | 2021-01-22 | Paper |
Fault-tolerant simulation of population protocols
Distributed Computing | 2021-01-22 | Paper |
Distributed computing on oriented anonymous hypercubes with faulty components
Distributed Computing | 2020-12-03 | Paper |
Meeting in a polygon by anonymous oblivious robots
Distributed Computing | 2020-10-16 | Paper |
Meeting in a polygon by anonymous oblivious robots
Distributed Computing | 2020-10-16 | Paper |
Shape formation by programmable particles
(available as arXiv preprint) | 2020-07-30 | Paper |
Distributed exploration of dynamic rings
Distributed Computing | 2020-04-21 | Paper |
Shape formation by programmable particles
Distributed Computing | 2020-04-21 | Paper |
Shape formation by programmable particles
Distributed Computing | 2020-04-21 | Paper |
Gathering in dynamic rings
Theoretical Computer Science | 2020-02-13 | Paper |
Population protocols with faulty interactions: the impact of a leader
Theoretical Computer Science | 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
Emergent Computation | 2018-10-04 | Paper |
Optimal elections in faulty loop networks and applications
IEEE Transactions on Computers | 2018-07-09 | Paper |
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
Automata, Languages and Programming | 2018-07-04 | Paper |
Gathering in dynamic rings
Structural Information and Communication Complexity | 2018-04-12 | Paper |
Distributed computing by mobile robots: uniform circle formation
Distributed Computing | 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
IEEE Transactions on Computers | 2017-08-08 | Paper |
Efficient, Decentralized Computation of the Topology of Spatial Regions
IEEE Transactions on Computers | 2017-07-27 | Paper |
Population protocols with faulty interactions: the impact of a leader
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| A rupestrian algorithm | 2017-07-17 | Paper |
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures
IEEE Transactions on Computers | 2017-07-12 | Paper |
Measuring Temporal Lags in Delay-Tolerant Networks
IEEE Transactions on Computers | 2017-06-20 | Paper |
Mediated population protocols: leader election and applications
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Mutual visibility by luminous robots without collisions
Information and Computation | 2017-05-12 | Paper |
Universal systems of oblivious mobile robots
Structural Information and Communication Complexity | 2016-12-01 | Paper |
An improved testing scheme for catastrophic fault patterns
Information Processing Letters | 2016-06-16 | Paper |
On the impact of sense of direction on message complexity
Information Processing Letters | 2016-05-26 | Paper |
Rendezvous with constant memory
Theoretical Computer Science | 2016-02-26 | Paper |
Network decontamination under m-immunity
Discrete Applied Mathematics | 2016-02-04 | Paper |
Exploring an unknown dangerous graph with a constant number of tokens
Theoretical Computer Science | 2015-12-10 | Paper |
Autonomous mobile robots with lights
Theoretical Computer Science | 2015-12-08 | Paper |
Shortest, fastest, and foremost broadcast in dynamic networks
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
Backward consistency and sense of direction in advanced distributed systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
Forming sequences of geometric patterns with oblivious mobile robots
Distributed Computing | 2015-07-08 | Paper |
On the expressivity of time-varying graphs
Theoretical Computer Science | 2015-06-10 | Paper |
TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
On the computational power of oblivious robots
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Brief announcement: Waiting in dynamic networks
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Distributed barrier coverage with relocatable sensors
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Searching for a black hole in arbitrary networks, optimal mobile agent protocols
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Rendezvous of two robots with constant memory
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Expressivity of Time-Varying Graphs
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Computing without communicating: ring exploration by asynchronous oblivious robots
Algorithmica | 2013-08-05 | Paper |
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
Distributed Computing | 2013-06-20 | Paper |
Optimal network decontamination with threshold immunity
Lecture Notes in Computer Science | 2013-06-07 | Paper |
How many oblivious robots can explore a line
Information Processing Letters | 2013-04-04 | Paper |
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science | 2013-03-04 | Paper |
On the exploration of time-varying networks
Theoretical Computer Science | 2013-02-19 | Paper |
Searching for black holes in subways
Theory of Computing Systems | 2012-12-06 | Paper |
Distributed computing by mobile robots: gathering
SIAM Journal on Computing | 2012-11-29 | Paper |
Connected graph searching
Information and Computation | 2012-11-27 | Paper |
Time optimal algorithms for black hole search in rings
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
Computing all the best swap edges distributively
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
Ping pong in dangerous graphs: optimal black hole search with pebbles
Algorithmica | 2012-04-26 | Paper |
Uniform scattering of autonomous mobile robots in a grid
International Journal of Foundations of Computer Science | 2011-05-10 | Paper |
Computing by mobile robotic sensors
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Time optimal algorithms for black hole search in rings
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Network exploration by silent and oblivious robots
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Deterministic computations in time-varying graphs: broadcasting under unstructured mobility
IFIP Advances in Information and Communication Technology | 2010-10-27 | Paper |
Remembering without memory: tree exploration by asynchronous oblivious robots
Theoretical Computer Science | 2010-04-06 | Paper |
Searching is not jumping.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Exploration of periodically varying graphs
Algorithms and Computation | 2009-12-17 | Paper |
Fault-tolerant sequential scan
Theory of Computing Systems | 2009-09-18 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
On Fractional Dynamic Faults with Threshold
Structural Information and Communication Complexity | 2009-03-12 | Paper |
USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
International Journal of Foundations of Computer Science | 2009-02-26 | Paper |
Tree Decontamination with Temporary Immunity
Algorithms and Computation | 2009-01-29 | Paper |
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
1522.68593 | 2009-01-22 | Paper |
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science | 2008-11-18 | Paper |
Groupings and Pairings in Anonymous Networks
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
Lecture Notes in Computer Science | 2008-09-02 | Paper |
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Self-deployment of mobile sensors on a ring
Theoretical Computer Science | 2008-08-14 | Paper |
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Structural Information and Communication Complexity | 2008-07-10 | Paper |
On fractional dynamic faults with thresholds
Theoretical Computer Science | 2008-06-24 | Paper |
Effective Elections for Anonymous Mobile Agents
Algorithms and Computation | 2008-04-24 | Paper |
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Map construction of unknown graphs by multiple agents
Theoretical Computer Science | 2007-10-18 | Paper |
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science | 2007-10-02 | Paper |
Mobile search for a black hole in an anonymous ring
Algorithmica | 2007-07-19 | Paper |
NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
International Journal of Foundations of Computer Science | 2007-06-05 | Paper |
Rendezvous and election of mobile agents: Impact of sense of direction
Theory of Computing Systems | 2007-02-14 | Paper |
| Design and Analysis of Distributed Algorithms | 2007-01-15 | Paper |
Efficient token-based control in rings.
Information Processing Letters | 2006-01-17 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Preface: Fun with algorithms
Discrete Applied Mathematics | 2005-09-27 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2163017 (Why is no real title available?) | 2005-04-29 | Paper |
On time versus size for monotone dynamic monopolies in regular topologies
Journal of Discrete Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080911 (Why is no real title available?) | 2004-08-04 | Paper |
Dynamic monopolies in tori.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Sorting and election in anonymous asynchronous rings.
Journal of Parallel and Distributed Computing | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038783 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2006651 (Why is no real title available?) | 2003-11-23 | Paper |
| scientific article; zbMATH DE number 1969695 (Why is no real title available?) | 2003-08-24 | Paper |
Computing on anonymous networks with sense of direction
Theoretical Computer Science | 2003-07-30 | Paper |
Tight bounds for synchronous communication of information using bits and silence
Discrete Applied Mathematics | 2003-07-30 | Paper |
Backward Consistency and Sense of Direction in Advanced Distributed Systems
SIAM Journal on Computing | 2003-06-19 | Paper |
Sense of direction in distributed computing
Theoretical Computer Science | 2003-05-14 | Paper |
| Sense of direction: Definitions, properties, and classes | 2002-07-21 | Paper |
Optimal irreversible dynamos in chordal rings
Discrete Applied Mathematics | 2002-01-16 | Paper |
| scientific article; zbMATH DE number 1688369 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1629980 (Why is no real title available?) | 2001-10-23 | Paper |
Convergence and aperiodicity in fuzzy cellular automata: Revisiting rule 90
Complexity International | 2001-10-21 | Paper |
Convergence and aperiodicity in fuzzy cellular automata: Revisiting rule 90
Physica D | 2000-11-22 | Paper |
| scientific article; zbMATH DE number 1420911 (Why is no real title available?) | 2000-03-22 | Paper |
Cellular automata in fuzzy backgrounds
Physica D | 2000-01-24 | Paper |
| scientific article; zbMATH DE number 1185591 (Why is no real title available?) | 1998-11-26 | Paper |
Symmetries and sense of direction in labeled graphs
Discrete Applied Mathematics | 1998-11-03 | Paper |
| scientific article; zbMATH DE number 1151833 (Why is no real title available?) | 1998-10-05 | Paper |
| scientific article; zbMATH DE number 1140070 (Why is no real title available?) | 1998-04-13 | Paper |
Improved bounds for electing a leader in a synchronous ring
Algorithmica | 1997-05-28 | Paper |
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy
Integration | 1997-02-27 | Paper |
Finding the extrema of a distributed multiset
Journal of Parallel and Distributed Computing | 1996-01-01 | Paper |
| scientific article; zbMATH DE number 720183 (Why is no real title available?) | 1995-03-20 | Paper |
| scientific article; zbMATH DE number 278850 (Why is no real title available?) | 1994-10-31 | Paper |
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays
Integration | 1994-10-04 | Paper |
| scientific article; zbMATH DE number 512940 (Why is no real title available?) | 1994-09-26 | Paper |
Guarding rectangular art galleries
Discrete Applied Mathematics | 1994-08-21 | Paper |
| scientific article; zbMATH DE number 434680 (Why is no real title available?) | 1994-01-02 | Paper |
| scientific article; zbMATH DE number 219237 (Why is no real title available?) | 1993-06-29 | Paper |
A distributed selection algorithm and its expected communication complexity
Theoretical Computer Science | 1992-09-27 | Paper |
Computational geometry algorithms for the systolic screen
Algorithmica | 1992-06-25 | Paper |
Sums of lexicographically ordered sets
Discrete Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4115981 (Why is no real title available?) | 1989-01-01 | Paper |
Efficient elections in chordal ring networks
Algorithmica | 1989-01-01 | Paper |
Geometric Containment and Partial Orders
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4050999 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060215 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4068275 (Why is no real title available?) | 1988-01-01 | Paper |
A practical algorithm for Boolean matrix multiplication
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4049013 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4050993 (Why is no real title available?) | 1987-01-01 | Paper |
Angle orders, regular n-gon orders and the crossing number
Order | 1987-01-01 | Paper |
Geometric containment and vector dominance
Theoretical Computer Science | 1987-01-01 | Paper |
Shout echo selection in distributed files
Networks | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3967924 (Why is no real title available?) | 1986-01-01 | Paper |
Min-max heaps and generalized priority queues
Communications of the ACM | 1986-01-01 | Paper |
An improved algorithm for Boolean matrix multiplication
Computing | 1986-01-01 | Paper |
Uniquely colourable m-dichromatic oriented graphs
Discrete Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3905341 (Why is no real title available?) | 1985-01-01 | Paper |
Labelling and Implicit Routing in Networks
The Computer Journal | 1985-01-01 | Paper |
Interpolation-binary search
Information Processing Letters | 1985-01-01 | Paper |
Distributed Sorting
IEEE Transactions on Computers | 1985-01-01 | Paper |
Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems | 1984-01-01 | Paper |
On the message complexity of distributed problems
International Journal of Computer & Information Sciences | 1984-01-01 | Paper |
Distributed election in a circle without a global sense of orientation
International Journal of Computer Mathematics | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3864485 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3893909 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3876583 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3763288 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3850459 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3800917 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3800924 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3706363 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3684892 (Why is no real title available?) | 1980-01-01 | Paper |
Extending the four Russians' bound to general matrix multiplication
Information Processing Letters | 1980-01-01 | Paper |
On hash techniques in a paged environment
Calcolo | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3738927 (Why is no real title available?) | 1978-01-01 | Paper |
Full table search by polynomial functions
Information Processing Letters | 1976-01-01 | Paper |
Operations on permutations and representation in graph form
Calcolo | 1976-01-01 | Paper |
