| Publication | Date of Publication | Type |
|---|
Gathering on a circle with limited visibility by anonymous oblivious robots
Theoretical Computer Science | 2024-12-12 | Paper |
| Pushing blocks by sweeping lines | 2024-05-16 | Paper |
Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Computational complexity of jumping block puzzles
Theoretical Computer Science | 2024-01-05 | Paper |
A theory of spherical diagrams
(available as arXiv preprint) | 2023-12-16 | Paper |
scientific article; zbMATH DE number 7779759 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-16 | Paper |
| Gathering on a circle with limited visibility by anonymous oblivious robots | 2023-11-02 | Paper |
Minimizing visible edges in polyhedra
Graphs and Combinatorics | 2023-10-31 | Paper |
| Token shifting on graphs | 2023-03-30 | 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 |
scientific article; zbMATH DE number 7633284 (Why is no real title available?)
(available as arXiv preprint) | 2022-12-15 | Paper |
| TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications | 2022-07-21 | Paper |
Edge guards for polyhedra in three-space
Computational Geometry | 2022-04-08 | 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 |
Cyclic shift problems on graphs
(available as arXiv preprint) | 2021-10-04 | 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 |
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 |
Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
Computational Geometry | 2020-04-22 | 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 |
Constructing Self-stabilizing Oscillators in Population Protocols
Lecture Notes in Computer Science | 2020-01-14 | Paper |
Population protocols with faulty interactions: the impact of a leader
Theoretical Computer Science | 2018-12-04 | Paper |
Rendezvous of two robots with visible bits
(available as arXiv preprint) | 2018-10-17 | 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 |
Constructing self-stabilizing oscillators in population protocols
Information and Computation | 2017-08-08 | Paper |
Population protocols with faulty interactions: the impact of a leader
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| Super Mario Bros. is harder/easier than we thought | 2017-07-17 | Paper |
| A rupestrian algorithm | 2017-07-17 | 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 |
| Algorithms for designing pop-up cards | 2017-01-30 | Paper |
Universal systems of oblivious mobile robots
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Rendezvous with constant memory
Theoretical Computer Science | 2016-02-26 | Paper |
Getting close without touching: near-gathering for autonomous mobile robots
Distributed Computing | 2015-10-20 | Paper |
| The Shadows of a Cycle Cannot All Be Paths | 2015-07-08 | Paper |
| Simulating a die roll by flipping two coins | 2015-05-30 | Paper |
Classic Nintendo games are (computationally) hard
Theoretical Computer Science | 2015-05-26 | Paper |
Lemmings is PSPACE-complete
Theoretical Computer Science | 2015-05-26 | Paper |
Reprint of: Face-guarding polyhedra
Computational Geometry | 2015-04-27 | Paper |
Gaming is a hard job, but someone has to do it!
Theory of Computing Systems | 2015-01-21 | Paper |
Face-guarding polyhedra
Computational Geometry | 2014-06-27 | Paper |
Rendezvous of two robots with constant memory
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Searching polyhedra by rotating half-planes
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Minimal Arrangements of Spherical Geodesics
(available as arXiv preprint) | N/A | Paper |
