Giuseppe Prencipe

Orcid: 0000-0001-5646-7388

According to our database1, Giuseppe Prencipe authored at least 75 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility.
Distributed Comput., September, 2024

Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs.
J. Comput. Syst. Sci., February, 2024

Black Hole Search by a Set of Scattered Agents in Dynamic Rings.
CoRR, 2024

Pathways to democratized healthcare: Envisioning human-centered AI-as-a-service for customized diagnosis and rehabilitation.
Artif. Intell. Medicine, 2024

2023
Asynchronous Gathering in a Dangerous Ring.
Algorithms, 2023

Black Hole Search in Dynamic Rings: The Scattered Case.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Comparison of Machine Learning Classifiers on Integrated Transcriptomic Data.
Proceedings of the IEEE International Conference on Big Data, 2023

Scattering with Programmable Matter.
Proceedings of the Advanced Information Networking and Applications, 2023

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

Optimal and Heuristic Algorithms for Data Collection by Using an Energy- and Storage-Constrained Drone.
Proceedings of the Algorithmics of Wireless Networks, 2022

2021
Compacting oblivious agents on dynamic rings.
PeerJ Comput. Sci., 2021

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Black Hole Search in Dynamic Rings.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020
Gathering in dynamic rings.
Theor. Comput. Sci., 2020

FUN editorial.
Theor. Comput. Sci., 2020

Linear time distributed swap edge algorithms.
Inf. Process. Lett., 2020

Tight Bounds for Black Hole Search in Dynamic Rings.
CoRR, 2020

Forming Sequences of Patterns With Luminous Robots.
IEEE Access, 2020

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction.
IEEE Access, 2020

Leader Election and Compaction for Asynchronous Silent Programmable Matter.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Pattern Formation.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Moving and Computing Models: Robots.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Compacting and Grouping Mobile Agents on Dynamic Rings.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
Line Recovery by Programmable Particles.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Distributed computing by mobile robots: uniform circle formation.
Distributed Comput., 2017

2016
Autonomous mobile robots with lights.
Theor. Comput. Sci., 2016

A Rupestrian Algorithm.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Getting close without touching: near-gathering for autonomous mobile robots.
Distributed Comput., 2015

2014
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Synchronized Dancing of Oblivious Chameleons.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Linear Time Distributed Swap Edge Algorithms.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Autonomous Mobile Robots: A Distributed Computing Perspective.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Distributed Computing by Oblivious Mobile Robots
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.
IEEE Trans. Computers, 2012

Guest Editors' Introduction: Algorithms and Today's Practitioner.
IEEE Softw., 2012

Distributed Computing by Mobile Robots: Gathering.
SIAM J. Comput., 2012

Getting Close without Touching.
Proceedings of the Structural Information and Communication Complexity, 2012

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits.
Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

2011
Computing by Mobile Robotic Sensors.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

2009
Preface.
Theor. Comput. Sci., 2009

Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots.
Theor. Comput. Sci., 2008

Self-deployment of mobile sensors on a ring.
Theor. Comput. Sci., 2008

Computing all the best swap edges distributively.
J. Parallel Distributed Comput., 2008

2007
Impossibility of gathering by a set of autonomous mobile robots.
Theor. Comput. Sci., 2007

Mobile Search for a Black Hole in an Anonymous Ring.
Algorithmica, 2007

Distributed Computation of All Node Replacements of a Minimum Spanning Tree.
Proceedings of the Euro-Par 2007, 2007

2006
Black hole search in common interconnection networks.
Networks, 2006

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively.
IEICE Trans. Inf. Syst., 2006

Searching for a black hole in arbitrary networks: optimal mobile agents protocols.
Distributed Comput., 2006

Distributed Algorithms for Autonomous Mobile Robots.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Self-deployment Algorithms for Mobile Sensors on a Ring.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005
Gathering of asynchronous robots with limited visibility.
Theor. Comput. Sci., 2005

The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots.
Theory Comput. Syst., 2005

On the Feasibility of Gathering by Autonomous Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2005

Efficient Algorithms for Detecting Regular Point Configurations.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
Coordination without communication: the case of the flocking problem.
Discret. Appl. Math., 2004

Computing All the Best Swap Edges Distributively.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Distributed Computation for Swapping a Failing Edge.
Proceedings of the Distributed Computing, 2004

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Topic 9: Distributed Systems and Algorithms.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
Robotic cops: the intruder problem.
Proceedings of the IEEE International Conference on Systems, 2003

Multiple Agents RendezVous in a Ring in Spite of a Black Hole.
Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

Solving the Robots Gathering Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Gathering Autonomous Mobile Robots.
Proceedings of the SIROCCO 9, 2002

Searching for a black hole in arbitrary networks: optimal mobile agent protocols.
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.
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.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001
Gathering of Asynchronous Oblivious Robots with Limited Visibility.
Proceedings of the STACS 2001, 2001

Pattern Formation by Anonymous Robots Without Chirality.
Proceedings of the SIROCCO 8, 2001

Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999


  Loading...