Paola Flocchini


Ontology type: schema:Person     


Person Info

NAME

Paola

SURNAME

Flocchini

Publications in SciGraph latest 50 shown

  • 2019 Moving and Computing Models: Robots in DISTRIBUTED COMPUTING BY MOBILE ENTITIES
  • 2018-08-20 Distributed exploration of dynamic rings in DISTRIBUTED COMPUTING
  • 2017-12 Computation and analysis of temporal betweenness in a knowledge mobilization network in COMPUTATIONAL SOCIAL NETWORKS
  • 2017-12 Distributed computing by mobile robots: uniform circle formation in DISTRIBUTED COMPUTING
  • 2017-10-07 Fault-Induced Dynamics of Oblivious Robots on a Line in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2017 Gathering in Dynamic Rings in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2017 Population Protocols with Faulty Interactions: The Impact of a Leader in ALGORITHMS AND COMPLEXITY
  • 2017 Mediated Population Protocols: Leader Election and Applications in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2016 Universal Systems of Oblivious Mobile Robots in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2016 Memoryless Gathering of Mobile Robotic Sensors in ENCYCLOPEDIA OF ALGORITHMS
  • 2015-04 Forming sequences of geometric patterns with oblivious mobile robots in DISTRIBUTED COMPUTING
  • 2015 Black Virus Decontamination in Arbitrary Networks in NEW CONTRIBUTIONS IN INFORMATION SYSTEMS AND TECHNOLOGIES
  • 2015 Computations by Luminous Robots in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2014 Distributed Barrier Coverage with Relocatable Sensors in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2014 Synchronized Dancing of Oblivious Chameleons in FUN WITH ALGORITHMS
  • 2014 Robots with Lights: Overcoming Obstructed Visibility Without Colliding in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2014 Uniform Covering of Rings and Lines by Memoryless Mobile Sensors in ENCYCLOPEDIA OF ALGORITHMS
  • 2014 Memoryless Gathering of Mobile Robotic Sensors in ENCYCLOPEDIA OF ALGORITHMS
  • 2014 Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2013-09 Solving the parity problem in one-dimensional cellular automata in NATURAL COMPUTING
  • 2013-03 Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots in ALGORITHMICA
  • 2013 Expressivity of Time-Varying Graphs in FUNDAMENTALS OF COMPUTATION THEORY
  • 2013 Rendezvous of Two Robots with Constant Memory in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2013 Optimal Network Decontamination with Threshold Immunity in ALGORITHMS AND COMPLEXITY
  • 2012-04 Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles in ALGORITHMICA
  • 2012 Finding Good Coffee in Paris in FUN WITH ALGORITHMS
  • 2012-01 Searching for Black Holes in Subways in THEORY OF COMPUTING SYSTEMS
  • 2012 Distributed Algorithms by Forgetful Mobile Robots in FUN WITH ALGORITHMS
  • 2012 Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2012 Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2011 Time-Varying Graphs and Dynamic Networks in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2011 Improving the Optimal Bounds for Black Hole Search in Rings in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2010-11-08 Computing by Mobile Robotic Sensors in THEORETICAL ASPECTS OF DISTRIBUTED COMPUTING IN SENSOR NETWORKS
  • 2010 Mapping an Unfriendly Subway System in FUN WITH ALGORITHMS
  • 2010 Network Decontamination with Temporal Immunity by Cellular Automata in CELLULAR AUTOMATA
  • 2010 Network Exploration by Silent and Oblivious Robots in GRAPH THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2010 Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility in THEORETICAL COMPUTER SCIENCE
  • 2010 Time Optimal Algorithms for Black Hole Search in Rings in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2009-06 Fault-Tolerant Sequential Scan in THEORY OF COMPUTING SYSTEMS
  • 2009 Exploration of Periodically Varying Graphs in ALGORITHMS AND COMPUTATION
  • 2008 Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2008 Tree Decontamination with Temporary Immunity in ALGORITHMS AND COMPUTATION
  • 2008 Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens in DISTRIBUTED COMPUTING
  • 2007-05 Mobile Search for a Black Hole in an Anonymous Ring in ALGORITHMICA
  • 2007-02 Rendezvous and Election of Mobile Agents: Impact of Sense of Direction in THEORY OF COMPUTING SYSTEMS
  • 2007 Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2007 A Decentralized Solution for Locating Mobile Agents in EURO-PAR 2007 PARALLEL PROCESSING
  • 2007 Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2007 Distributed Computation of All Node Replacements of a Minimum Spanning Tree in EURO-PAR 2007 PARALLEL PROCESSING
  • 2006-09 Searching for a black hole in arbitrary networks: optimal mobile agents protocols in DISTRIBUTED COMPUTING
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.28046.38", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.14848.31", 
            "type": "Organization"
          }
        ], 
        "familyName": "Flocchini", 
        "givenName": "Paola", 
        "id": "sg:person.011601470625.25", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011601470625.25"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:47", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1563.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.011601470625.25'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.011601470625.25'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.011601470625.25'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.011601470625.25'


     




    Preview window. Press ESC to close (or click here)


    ...