Photo

Conference talks

Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
PODC 2023, Orlando, USA, June 2023
Computing in Anonymous Dynamic Networks Is Linear
FOCS 2022, Denver, USA, November 2022
A Theory of Spherical Diagrams
CCCG 2022, Toronto, Canada, August 2022
Pushing Blocks by Sweeping Lines [Video]
FUN 2020-2022, Favignana, Italy, June 2022
Minimizing Visible Edges in Polyhedra
TJCDCGGG 2020+1, Chiang Mai, Thailand, September 2021
Cyclic Shift Problems on Graphs
WALCOM 2021, Yangon, Myanmar, March 2021
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
DISC 2020, Freiburg im Breisgau, Germany, October 2020
Mobile RAM and Shape Formation by Programmable Particles
Euro-Par 2020, Warsaw, Poland, August 2020
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications
DISC 2018, New Orleans, USA, October 2018
Brief Announcement: Shape Formation by Programmable Particles
DISC 2017, Vienna, Austria, October 2017
Meeting in a Polygon by Anonymous Oblivious Searchers
DISC 2017, Vienna, Austria, October 2017
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols
ICDCS 2017, Atlanta, USA, June 2017
Mediated Population Protocols: Leader Election and Applications
TAMC 2017, Bern, Switzerland, April 2017
Square Formation by Asynchronous Oblivious Robots
CCCG 2016, Vancouver, Canada, August 2016
Universal Systems of Oblivious Mobile Robots
SIROCCO 2016, Helsinki, Finland, July 2016
Super Mario Bros. Is Harder/Easier than We Thought [Video]
FUN 2016, La Maddalena, Italy, June 2016
A Rupestrian Algorithm
FUN 2016, La Maddalena, Italy, June 2016
The Shadows of a Cycle Cannot All Be Paths
CCCG 2015, Kingston, Canada, August 2015
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem
OPODIS 2014, Cortina d'Ampezzo, Italy, December 2014
The Mutual Visibility Problem for Oblivious Robots
CCCG 2014, Halifax, Canada, August 2014
Lemmings Is PSPACE-Complete
FUN 2014, Lipari Island, Italy, July 2014
Nintendo Games Are (Computationally) Hard
FUN 2014, Lipari Island, Italy, July 2014
Rendezvous of Two Robots with Visible Bits
ALGOSENSORS 2013, Sophia Antipolis, France, September 2013
Face-Guarding Polyhedra
CCCG 2013, Waterloo, Canada, August 2013
Partial Searchlight Scheduling Is Strongly PSPACE-Complete
CCCG 2013, Waterloo, Canada, August 2013
Rendezvous of Two Robots with Constant Memory
SIROCCO 2013, Ischia, Italy, July 2013
Getting Close without Touching
SIROCCO 2012, Reykjavik, Iceland, July 2012
Gaming Is a Hard Job, but Someone Has to Do It!
FUN 2012, Venice, Italy, June 2012
Hardness of Mastermind
FUN 2012, Venice, Italy, June 2012
Partial Searchlight Scheduling Is Strongly PSPACE-Complete
EuroCG 2012, Assisi, Italy, March 2012
Edge-Guarding Orthogonal Polyhedra
CCCG 2011, Toronto, Canada, August 2011
The 3-Dimensional Searchlight Scheduling Problem
CCCG 2010, Winnipeg, Canada, August 2010

Seminars and invited lectures

History Trees and Their Applications
SIROCCO 2024, Vietri sul Mare, Italy, May 2024
Invited keynote speech
Mobile Robots: Square Formation and Meeting
Seminar on Distributed Computing in Anonymous Dynamic Systems, Sapienza University of Rome, Italy, March 2024
Mobile Robots: Gathering and Pattern Formation
Seminar on Distributed Computing in Anonymous Dynamic Systems, Sapienza University of Rome, Italy, March 2024
Population Protocols: General Computation and Leader Election
Seminar on Distributed Computing in Anonymous Dynamic Systems, Sapienza University of Rome, Italy, March 2024
Anonymous Networks: Advanced Computation Techniques
Seminar on Distributed Computing in Anonymous Dynamic Systems, Sapienza University of Rome, Italy, March 2024
Anonymous Networks: Optimal Computation with a Leader
Seminar on Distributed Computing in Anonymous Dynamic Systems, Sapienza University of Rome, Italy, March 2024
Anonymous Networks: History Trees and Applications
Seminar on Distributed Computing in Anonymous Dynamic Systems, Sapienza University of Rome, Italy, March 2024
Anonymous Networks: Introduction and Basic Techniques
Seminar on Distributed Computing in Anonymous Dynamic Systems, Sapienza University of Rome, Italy, March 2024
One Cycle to Rule Them All
Mathematical Puzzles and Games in Theoretical Computer Science, ICIAM 2023, Tokyo, Japan, August 2023
Programmable Matter: From Fractal Formation to Genetic-Programming Solutions
Dagstuhl Seminar 23091, Schloss Dagstuhl, Wadern, Germany, March 2023
Group Theory Through Permutation Puzzles
Special lecture, University of Aizu, Japan, November 2022
Congested Anonymous Dynamic Networks
JAIST Uehara-lab Seminars, Nomi, Japan, November 2022
Simply Connected Monohedral Polyhedra
JAIST Uehara-lab Seminars, Nomi, Japan, October 2022
Optimal Computation in Anonymous Dynamic Networks
MAC 2022 workshop, Pisa, Italy, September 2022
Advances in Anonymous Dynamic Networks
JAIST Uehara-lab Seminars, Nomi, Japan, June 2022
Genetic Algorithms for Programmable Matter [Video]
JAIST Uehara-lab Seminars, Nomi, Japan, April 2022
Compaction and Gravity Puzzles
JAIST Uehara-lab Seminars, Nomi, Japan, February 2022
Optimal Terminating Computation in Anonymous Dynamic Networks with a Leader
JAIST Uehara-lab Seminars, Nomi, Japan, December 2021
Linear-Time Computation in Anonymous Dynamic Networks with a Leader
JAIST Uehara-lab Seminars, Nomi, Japan, November 2021
Counting in Dynamic Anonymous Networks
JAIST Uehara-lab Seminars, Nomi, Japan, October 2021
Compaction Puzzles and Games
JAIST Uehara-lab Seminars, Nomi, Japan, June 2021
Minimizing Visible Edges in Polyhedra
JAIST Uehara-lab Seminars, Nomi, Japan, April 2021
Chasing Puppies: Mobile Beacon Routing on Closed Curves
JAIST Uehara-lab Seminars, Nomi, Japan, February 2021
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
JAIST Uehara-lab Seminars, Nomi, Japan, December 2020
Group Theory Applied to Cyclic-Shift Puzzles
JAIST Uehara-lab Seminars, Nomi, Japan, November 2020
A Theory of Spherical Diagrams
JAIST Uehara-lab Seminars, Nomi, Japan, July 2020
Complexity of Critter Crunch
JAIST Uehara-lab Seminars, Nomi, Japan, January 2020
Going Viral with the Subscription Business Model: Influence Spreading in Social Networks
JAIST Uehara-lab Seminars, Nomi, Japan, September 2019
Drawing 3D Fractals in Real Time: An Introduction to Distance Estimators
JAIST Uehara-lab Seminars, Nomi, Japan, March 2019
Introduction to Mobile Robots: Abstract Model and Classical Problems
JAIST Uehara-lab Seminars, Nomi, Japan, November 2018
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility
WSSR 2018, Tokyo, Japan, November 2018
Shape Formation by Programmable Particles
WTCS 2018, Iizuka, Japan, September 2018
The Bellows Theorem (Proof)
JAIST Uehara-lab Seminars, Nomi, Japan, July 2018
The Bellows Theorem (Introduction)
JAIST Uehara-lab Seminars, Nomi, Japan, June 2018
Three Problems in Discrete Geometry
JAIST Uehara-lab Seminars, Nomi, Japan, April 2018
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem
GRASTA-MAC 2015 workshop, Montreal, Canada, October 2015
Video Games Are Hard!
Special lecture for 7606 Computation Theory, Nagoya University, Japan, October 2014
Theorems with Balls
Carleton Algorithms Seminars, Ottawa, Canada, May 2014
Designing Pop-up Cards
Carleton Algorithms Seminars, Ottawa, Canada, November 2013
The Art Gallery Problem for Polyhedra
Carleton Algorithms Seminars, Ottawa, Canada, February 2013
Edge-Guarding Orthogonal Polyhedra
AlgoDEEP project, Rome, Italy, July 2011
Hardness of Mastermind
Followup to WSOFTgalileo workshop, Pisa, Italy, January 2011
Guarding and Searching Polyhedral Environments
AlgoDEEP project, Bertinoro (FC), Italy, April 2010