#### Filter Results:

- Full text PDF available (37)

#### Publication Year

1974

2018

- This year (11)
- Last 5 years (35)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Giovanni Viglietta
- Theory of Computing Systems
- 2012

We establish some general schemes relating the computational complexity of a video game to the presence of certain common elements or mechanics, such as destroyable paths, collectible items, doorsâ€¦ (More)

We prove NP-hardness results for five of Nintendoâ€™s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and PokÃ©mon. Our results apply to generalized versions of Super Marioâ€¦ (More)

Consider a finite set of identical computational entities that can move freely in the Euclidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity p at time t; entityâ€¦ (More)

Robots with lights is a model of autonomous mobile computational entties operating in the plane in Look-Compute-Move cycles: each agent has an externally visible light which can assume colors from aâ€¦ (More)

- Giovanni Viglietta
- ALGOSENSORS
- 2013

We study the rendezvous problem for two robots moving in the plane (or on a line). Robots are autonomous, anonymous, oblivious, and carry colored lights that are visible to both. We considerâ€¦ (More)

- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
- OPODIS
- 2014

Consider a set of n simple autonomous mobile robots (asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, non-rigid,â€¦ (More)

Consider a finite set of identical entities, called robots, which can move freely in the Euclidean plane. Let p(t) denote the location of robot p at time t; a robot p can see robot q at time t if atâ€¦ (More)

- Marcello Mamino, Giovanni Viglietta
- CCCG
- 2016

A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a givenâ€¦ (More)

- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
- Distributed Computing
- 2016

Consider a set of n finite set of simple autonomous mobile robots (asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past,â€¦ (More)

- Alberto Bandettini, Fabio Luporini, Giovanni Viglietta
- ArXiv
- 2011

Gathering mobile robots is a widely studied problem in robotic research. This survey first introduces the related work, summarizing models and results. Then, the focus shifts on the open problem ofâ€¦ (More)