Riccardo Silvestri

Ontology type: schema:Person     

Person Info





Publications in SciGraph latest 50 shown

  • 2017-08 Simple dynamics for plurality consensus in DISTRIBUTED COMPUTING
  • 2015-02 Information spreading in dynamic graphs in DISTRIBUTED COMPUTING
  • 2013-02 Fast flooding over Manhattan in DISTRIBUTED COMPUTING
  • 2013 Distributed Community Detection in Dynamic Graphs in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2013 Randomness and Complexity in THE POWER OF ALGORITHMS
  • 2013 Rumor Spreading in Random Evolving Graphs in ALGORITHMS – ESA 2013
  • 2011 Parsimonious Flooding in Geometric Random-Walks in DISTRIBUTED COMPUTING
  • 2010 Modelling Mobility: A Discrete Revolution in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2009 Pseudonyms in Cost-Sharing Games in INTERNET AND NETWORK ECONOMICS
  • 2009 MANETS: High Mobility Can Make Up for Low Transmission Power in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007 Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007
  • 2007 Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2007 An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2006-02 On the importance of having an identity or, is consensus really universal? in DISTRIBUTED COMPUTING
  • 2006 Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2006 A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2005-06-20 Bounded size dictionary compression: SCk-completeness and NC algorithms in STACS 98
  • 2005-06-17 Parallel approximation of optimization problems in SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL
  • 2005 Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2004-04 On the Power Assignment Problem in Radio Networks in MOBILE NETWORKS AND APPLICATIONS
  • 2004 Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks in STACS 2004
  • 2004 Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms in APPROXIMATION AND ONLINE ALGORITHMS
  • 2003-02-11 The Minimum Range Assignment Problem on Linear Radio Networks in ALGORITHMS - ESA 2000
  • 2003-02 Polynomial Time Introreducibility in THEORY OF COMPUTING SYSTEMS
  • 2002-11-08 Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks in ALGORITHMS AND COMPUTATION
  • 2001 Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks in ALGORITHMS — ESA 2001
  • 2000 On the Importance of Having an Identity or, is Consensus really Universal? in DISTRIBUTED COMPUTING
  • 2000 The Power Range Assignment Problem in Radio Networks on the Plane in STACS 2000
  • 1999 Hardness Results for the Power Range Assignment Problem in Packet Radio Networks in RANDOMIZATION, APPROXIMATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 1998-11 Sperner's lemma and robust machines in COMPUTATIONAL COMPLEXITY
  • 1997-04 Helping by unambiguous computation and probabilistic computation in THEORY OF COMPUTING SYSTEMS
  • 1995 Structure in approximation classes in COMPUTING AND COMBINATORICS
  • 1993 Easily checked self-reducibility in FUNDAMENTALS OF COMPUTATION THEORY
  • 1992 Reductions to sets of low information content in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 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", 
        "familyName": "Silvestri", 
        "givenName": "Riccardo", 
        "id": "sg:person.012430640403.64", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:54", 
        "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_1680.json", 
        "type": "Person"

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


    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.012430640403.64'

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

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

    Turtle is a human-readable linked data format.

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

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

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


    This table displays all metadata directly associated to this object as RDF triples.

    11 TRIPLES      9 PREDICATES      10 URIs      6 LITERALS      1 BLANK NODES

    Subject Predicate Object
    1 sg:person.012430640403.64 schema:familyName Silvestri
    2 schema:givenName Riccardo
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012430640403.64
    4 schema:sdDatePublished 2019-03-07T13:54
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher N1e39107d1f4c43939d90b1d7349e5edf
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 N1e39107d1f4c43939d90b1d7349e5edf schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization

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