( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Super Mario Bros. is Harder/Easier Than We Thought.

, , и . FUN, том 49 из LIPIcs, стр. 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Giovanni Natale

Giovanni Bacigalupo

Giovanni Lamura

Giovanni Falcone

Giovanni Caselotti

 

Другие публикации лиц с тем же именем

Gaming Is a Hard Job, But Someone Has to Do It!. FUN, том 7288 из Lecture Notes in Computer Science, стр. 357-367. Springer, (2012)Brief Announcement: Shape Formation by Programmable Particles., , , , и . DISC, том 91 из LIPIcs, стр. 48:1-48:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Mutual Visibility Problem for Oblivious Robots., , , , и . CCCG, Carleton University, Ottawa, Canada, (2014)Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks., и . CoRR, (2022)Rendezvous of Two Robots with Visible Bits.. ALGOSENSORS, том 8243 из Lecture Notes in Computer Science, стр. 291-306. Springer, (2013)TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications., , , и . CoRR, (2017)Optimally Guarding 2-Reflex Orthogonal Polyhedra by Reflex Edge Guards.. CoRR, (2017)Constructing self-stabilizing oscillators in population protocols., , , , и . Inf. Comput., (2017)Oblivious Permutations on the Plane., , , , , и . OPODIS, том 153 из LIPIcs, стр. 24:1-24:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Chasing Puppies: Mobile Beacon Routing on Closed Curves., , , , , , , и . SoCG, том 189 из LIPIcs, стр. 5:1-5:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)