Giuseppe Prencipe

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Comparison of Machine Learning Classifiers on Integrated Transcriptomic Data.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Big Data, 2023

Scattering with Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2023

2022

A Systematic Review of Wi-Fi and Machine Learning Integration with Topic Modeling Techniques.

[BibT_eX]

[DOI]

Sensors, 2022

Optimal and Heuristic Algorithms for Data Collection by Using an Energy- and Storage-Constrained Drone.

[BibT_eX]

[DOI]

Francesco Betti Sorbelli

Proceedings of the Algorithmics of Wireless Networks, 2022

2021

Compacting oblivious agents on dynamic rings.

[BibT_eX]

[DOI]

Shantanu Das

Daniele Mazzei

PeerJ Comput. Sci., 2021

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Black Hole Search in Dynamic Rings.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020

Gathering in dynamic rings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

FUN editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Linear time distributed swap edge algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Tight Bounds for Black Hole Search in Dynamic Rings.

[BibT_eX]

[DOI]

CoRR, 2020

Forming Sequences of Patterns With Luminous Robots.

[BibT_eX]

[DOI]

IEEE Access, 2020

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction.

[BibT_eX]

[DOI]

IEEE Access, 2020

Leader Election and Compaction for Asynchronous Silent Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Pattern Formation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

Moving and Computing Models: Robots.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

Compacting and Grouping Mobile Agents on Dynamic Rings.

[BibT_eX]

[DOI]

Shantanu Das

Proceedings of the Theory and Applications of Models of Computation, 2019

2018

Line Recovery by Programmable Particles.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

Distributed computing by mobile robots: uniform circle formation.

[BibT_eX]

[DOI]

Distributed Comput., 2017

2016

Autonomous mobile robots with lights.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

A Rupestrian Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?.

[BibT_eX]

[DOI]

Davide Bacciu

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Getting close without touching: near-gathering for autonomous mobile robots.

[BibT_eX]

[DOI]

Giovanni Viglietta

Distributed Comput., 2015

2014

Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives.

[BibT_eX]

[DOI]

Valerio Volpi

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Synchronized Dancing of Oblivious Chameleons.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Linear Time Distributed Swap Edge Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Autonomous Mobile Robots: A Distributed Computing Perspective.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Distributed Computing by Oblivious Mobile Robots

[BibT_eX]

[DOI]

Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02008-7, 2012

Distributed Minimum Spanning Tree Maintenance for Transient Node Failures.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2012

Guest Editors' Introduction: Algorithms and Today's Practitioner.

[BibT_eX]

[DOI]

IEEE Softw., 2012

Distributed Computing by Mobile Robots: Gathering.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Getting Close without Touching.

[BibT_eX]

[DOI]

Giovanni Viglietta

Proceedings of the Structural Information and Communication Complexity, 2012

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

2011

Computing by Mobile Robotic Sensors.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

2009

Preface.

[BibT_eX]

[DOI]

Shmuel Zaks

Theor. Comput. Sci., 2009

Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008

Arbitrary pattern formation by asynchronous, anonymous, oblivious robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Self-deployment of mobile sensors on a ring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Computing all the best swap edges distributively.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2008

2007

Impossibility of gathering by a set of autonomous mobile robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Mobile Search for a Black Hole in an Anonymous Ring.

[BibT_eX]

[DOI]

Algorithmica, 2007

Distributed Computation of All Node Replacements of a Minimum Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2007, 2007

2006

Black hole search in common interconnection networks.

[BibT_eX]

[DOI]

Networks, 2006

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively.

[BibT_eX]

[DOI]

Antonio Mesa Enriques

IEICE Trans. Inf. Syst., 2006

Searching for a black hole in arbitrary networks: optimal mobile agents protocols.

[BibT_eX]

[DOI]

Distributed Comput., 2006

Distributed Algorithms for Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Self-deployment Algorithms for Mobile Sensors on a Ring.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005

Gathering of asynchronous robots with limited visibility.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

On the Feasibility of Gathering by Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Efficient Algorithms for Detecting Regular Point Configurations.

[BibT_eX]

[DOI]

Luzi Anderegg

Mark Cieliebak

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004

Coordination without communication: the case of the flocking problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Computing All the Best Swap Edges Distributively.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Distributed Computation for Swapping a Failing Edge.

[BibT_eX]

[DOI]

Tranos Zuva

Proceedings of the Distributed Computing, 2004

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.

[BibT_eX]

[DOI]

Antonio Mesa Enriques

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Topic 9: Distributed Systems and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003

Robotic cops: the intruder problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Systems, 2003

Multiple Agents RendezVous in a Ring in Spite of a Black Hole.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

Solving the Robots Gathering Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Gathering Autonomous Mobile Robots.

[BibT_eX]

Mark Cieliebak

Proceedings of the SIROCCO 9, 2002

Searching for a black hole in arbitrary networks: optimal mobile agent protocols.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Black Hole Search by Mobile Agents in Hypercubes and Related Networks.

[BibT_eX]

Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

Distribution Sweeping on Clustered Machines with Hierarchical Memories.

[BibT_eX]

[DOI]

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001

Gathering of Asynchronous Oblivious Robots with Limited Visibility.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Pattern Formation by Anonymous Robots Without Chirality.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots.

[BibT_eX]

[DOI]