research
∙
01/19/2023
Efficient Computation in Congested Anonymous Dynamic Networks
An "anonymous dynamic network" is a network of indistinguishable process...
share
research
∙
08/20/2022
Minimizing Visible Edges in Polyhedra
We prove that, given a polyhedron 𝒫 in ℝ^3, every point in ℝ^3 that does...
research
∙
07/17/2022
Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks
We give a simple and complete characterization of which functions can be...
research
∙
04/05/2022
Computing in Anonymous Dynamic Networks Is Linear
We give the first linear-time counting algorithm for processes in anonym...
research
∙
02/24/2022
Pushing Blocks by Sweeping Lines
We investigate the reconfiguration of n blocks, or "tokens", in the squa...
research
∙
07/13/2021
A Theory of Spherical Diagrams
We introduce the axiomatic theory of Spherical Occlusion Diagrams as a t...
research
∙
03/17/2021
Chasing Puppies: Mobile Beacon Routing on Closed Curves
We solve an open problem posed by Michael Biro at CCCG 2013 that was ins...
research
∙
09/23/2020
Cyclic Shift Problems on Graphs
We study a new reconfiguration problem inspired by classic mechanical pu...
research
∙
05/16/2020
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
A swarm of anonymous oblivious mobile robots, operating in deterministic...
research
∙
02/09/2020
Mobile RAM and Shape Formation by Programmable Particles
We investigate computational issues in the distributed model Amoebots of...
research
∙
11/13/2019
Oblivious Permutations on the Plane
We consider a distributed system of n identical mobile robots operating ...
research
∙
09/26/2017
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications
In this paper we investigate the computational power of a set of mobile ...
research
∙
08/18/2017
Optimally Guarding 2-Reflex Orthogonal Polyhedra by Reflex Edge Guards
We study the problem of guarding an orthogonal polyhedron having reflex ...
research
∙
07/09/2015