The following pages link to Giovanni Viglietta (Q489748):
Displayed 42 items.
- (Q248942) (redirect page) (← links)
- Gaming is a hard job, but someone has to do it! (Q489749) (← links)
- Mutual visibility by luminous robots without collisions (Q528203) (← links)
- Getting close without touching: near-gathering for autonomous mobile robots (Q748118) (← links)
- Population protocols with faulty interactions: the impact of a leader (Q1628589) (← links)
- Distributed computing by mobile robots: uniform circle formation (Q1682222) (← links)
- Rendezvous of two robots with visible bits (Q1796443) (← links)
- Constructing self-stabilizing oscillators in population protocols (Q2013587) (← links)
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications (Q2121061) (← links)
- Edge guards for polyhedra in three-space (Q2123291) (← links)
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards (Q2173452) (← links)
- Shape formation by programmable particles (Q2174252) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Fault-tolerant simulation of population protocols (Q2220403) (← links)
- Cyclic shift problems on graphs (Q2232257) (← links)
- Face-guarding polyhedra (Q2248737) (← links)
- Reprint of: Face-guarding polyhedra (Q2341695) (← links)
- Lemmings is PSPACE-complete (Q2347006) (← links)
- Classic Nintendo games are (computationally) hard (Q2347007) (← links)
- Token shifting on graphs (Q2695335) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- Rendezvous of Two Robots with Constant Memory (Q2868644) (← links)
- Algorithms for Designing Pop-Up Cards (Q2957890) (← links)
- Mediated Population Protocols: Leader Election and Applications (Q2988820) (← links)
- Shape formation by programmable particles (Q3300834) (← links)
- (Q5057207) (← links)
- (Q5090910) (← links)
- Constructing Self-stabilizing Oscillators in Population Protocols (Q5207913) (← links)
- Super Mario Bros. Is Harder/Easier than We Thought (Q5282811) (← links)
- A Rupestrian Algorithm. (Q5282812) (← links)
- SEARCHING POLYHEDRA BY ROTATING HALF-PLANES (Q5300000) (← links)
- Oblivious Permutations on the Plane (Q5874257) (← links)
- Gathering in dynamic rings (Q5916005) (← links)
- Gathering in dynamic rings (Q5919424) (← links)
- Rendezvous with constant memory (Q5964022) (← links)
- Minimizing visible edges in polyhedra (Q6083182) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
- (Q6179334) (← links)
- (Q6179342) (← links)
- Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks (Q6202242) (← links)
- Simulating a die roll by flipping two coins (Q6262243) (← links)
- The Shadows of a Cycle Cannot All Be Paths (Q6263432) (← links)