Andrea Clementi


Ontology type: schema:Person     


Person Info

NAME

Andrea

SURNAME

Clementi

Publications in SciGraph latest 50 shown

  • 2019-02 Self-stabilizing repeated balls-into-bins in DISTRIBUTED COMPUTING
  • 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 Rumor Spreading in Random Evolving Graphs in ALGORITHMS – ESA 2013
  • 2011 Parsimonious Flooding in Geometric Random-Walks in DISTRIBUTED COMPUTING
  • 2010-11-08 Information Spreading in Dynamic Networks: An Analytical Approach in THEORETICAL ASPECTS OF DISTRIBUTED COMPUTING IN SENSOR NETWORKS
  • 2010 Modelling Mobility: A Discrete Revolution in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 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
  • 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-17 Parallel approximation of optimization problems in SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL
  • 2005-06-09 The parallel complexity of approximating the High Degree Subgraph problem in ALGORITHMS AND COMPUTATIONS
  • 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
  • 2002-11-08 Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks in ALGORITHMS AND COMPUTATION
  • 2002-04-12 Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines in STACS 99
  • 2002-01-18 Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2001 On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs in STACS 2001
  • 2001 Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks in ALGORITHMS — ESA 2001
  • 2001 On Computing Ad-hoc Selective Families in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES
  • 2000 The Power Range Assignment Problem in Radio Networks on the Plane in STACS 2000
  • 1999 On the Complexity of Approximating Colored-Graph Problems Extended Abstract in COMPUTING AND COMBINATORICS
  • 1999 Hardness Results for the Power Range Assignment Problem in Packet Radio Networks in RANDOMIZATION, APPROXIMATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 1997 Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1997 Efficient constructions of Hitting Sets for systems of linear functions in STACS 97
  • 1996 Hitting sets derandomize BPP in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1996 Randomized parallel algorithms in SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL
  • 1996 Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness in STACS 96
  • 1996 Improved non-approximability results for vertex cover with density constraints in COMPUTING AND COMBINATORICS
  • 1995 A Randomized Parallel Search Strategy in PARALLEL ALGORITHMS FOR IRREGULAR PROBLEMS: STATE OF THE ART
  • 1994 Graph theory and interactive protocols for Reachability Problems on finite Cellular automata in ALGORITHMS AND COMPLEXITY
  • 1993 The class of refractory neural nets in ARTIFICIAL NEURAL NETS AND GENETIC ALGORITHMS
  • 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.158820.6", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.6530.0", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.5326.2", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.8591.5", 
            "type": "Organization"
          }
        ], 
        "familyName": "Clementi", 
        "givenName": "Andrea", 
        "id": "sg:person.011027660123.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011027660123.21"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:42", 
        "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_1479.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.011027660123.21'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...