Paola Flocchini mainly focuses on Theoretical computer science, Robot, Mobile robot, Asynchronous communication and Distributed computing. She interconnects Rotation formalisms in three dimensions, Universe and Theory of computation in the investigation of issues within Theoretical computer science. Her Robot study combines topics from a wide range of disciplines, such as Plane and Asynchrony.
Her study with Mobile robot involves better knowledge in Artificial intelligence. The concepts of her Asynchronous communication study are interwoven with issues in Node, Point, Coordinate system and Degree. Paola Flocchini has included themes like Class, Algorithmics and Protocol in her Distributed computing study.
Her primary areas of study are Theoretical computer science, Distributed computing, Robot, Asynchronous communication and Mobile robot. Her studies in Theoretical computer science integrate themes in fields like Search problem, Graph, Computation and Graph. Her Distributed computing research is multidisciplinary, relying on both Network topology and Computer network.
Her Robot research is classified as research in Artificial intelligence. Her research in the fields of Robotics overlaps with other disciplines such as Set. In her study, Discrete mathematics is inextricably linked to Combinatorics, which falls within the broad field of Asynchronous communication.
Robot, Mobile robot, Theoretical computer science, Topology and Distributed computing are her primary areas of study. Her Robot study integrates concerns from other disciplines, such as Point and Asynchronous communication. Her Asynchronous communication study combines topics in areas such as Simple, Human–computer interaction and Combinatorics.
Her Mobile robot research is multidisciplinary, incorporating perspectives in Real-time computing, Finite set and Computation. Her research integrates issues of Current, Type and Turing machine in her study of Theoretical computer science. Her work deals with themes such as State and AISoy1, which intersect with Distributed computing.
Paola Flocchini mainly investigates Topology, Robot, Plane, Distributed algorithm and Programmable matter. The various areas that Paola Flocchini examines in her Robot study include Point and Asynchronous communication. Her studies deal with areas such as Graph, Combinatorics and Security token as well as Asynchronous communication.
Her research in Graph focuses on subjects like Enhanced Data Rates for GSM Evolution, which are connected to Theoretical computer science. Her Mobile robot research incorporates themes from Simple, Coordinate system and Finite set. Her work on AISoy1 is typically connected to Rendezvous problem as part of general Artificial intelligence study, connecting several disciplines of science.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Time-varying graphs and dynamic networks
Arnaud Casteigts;Paola Flocchini;Walter Quattrociocchi;Nicola Santoro.
International Journal of Parallel, Emergent and Distributed Systems (2012)
Gathering of asynchronous robots with limited visibility
Paola Flocchini;Giuseppe Prencipe;Nicola Santoro;Peter Widmayer.
Theoretical Computer Science (2005)
Distributed Computing by Oblivious Mobile Robots
Paola Flocchini;Giuseppe Prencipe;Nicola Santoro.
(2012)
Capture of an intruder by mobile agents
Lali Barrière;Paola Flocchini;Pierre Fraigniaud;Nicola Santoro.
acm symposium on parallel algorithms and architectures (2002)
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Paola Flocchini;Giuseppe Prencipe;Nicola Santoro;Peter Widmayer.
Theoretical Computer Science (2008)
Solving the robots gathering problem
Mark Cieliebak;Paola Flocchini;Giuseppe Prencipe;Nicola Santoro.
international colloquium on automata languages and programming (2003)
Distributed Computing by Mobile Robots: Gathering
Mark Cieliebak;Paola Flocchini;Giuseppe Prencipe;Nicola Santoro.
SIAM Journal on Computing (2012)
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots
Paola Flocchini;Giuseppe Prencipe;Nicola Santoro;Peter Widmayer.
international symposium on algorithms and computation (1999)
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
Paola Flocchini;David Ilcinkas;Andrzej Pelc;Nicola Santoro.
Algorithmica (2013)
Mobile Search for a Black Hole in an Anonymous Ring
Stefan Dobrev;Paola Flocchini;Giuseppe Prencipe;Nicola Santoro.
Algorithmica (2007)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Carleton University
Kyushu University
University of Ottawa
ETH Zurich
Carleton University
Université du Québec en Outaouais
University of Milano-Bicocca
University of Liverpool
Université Paris Cité
Sapienza University of Rome
University of Rochester
Google (United States)
Norwegian University of Science and Technology
Karlsruhe Institute of Technology
Shinshu University
Helicos Biosciences (United States)
Seattle Children's Hospital
Imperial College London
Natural Resources Canada
Russian Academy of Sciences
University of Pennsylvania
Imperial College London
Vanderbilt University
University of Colorado Anschutz Medical Campus
University of Lübeck
University of Kansas