Alessandro Panconesi


Ontology type: schema:Person     


Person Info

NAME

Alessandro

SURNAME

Panconesi

Publications in SciGraph latest 50 shown

  • 2015-02 Special issue with selected papers from PODC 2012 in DISTRIBUTED COMPUTING
  • 2013 Rumor Spreading in Random Evolving Graphs in ALGORITHMS – ESA 2013
  • 2013 The One Million Dollars Problem in THE POWER OF ALGORITHMS
  • 2010-05 Fast primal-dual distributed algorithms for scheduling and matching problems in DISTRIBUTED COMPUTING
  • 2009 On Active Attacks on Sensor Network Key Distribution Schemes in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2009 Rumor Spreading in Social Networks in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007-12 Localized Techniques for Broadcasting in Wireless Sensor Networks in ALGORITHMICA
  • 2007-03 Foreword in ALGORITHMICA
  • 2007-02 Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks in WIRELESS NETWORKS
  • 2007 Fast Distributed Algorithms Via Primal-Dual (Extended Abstract) in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2007 Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation in ALGORITHMS – ESA 2007
  • 2006-02 On the importance of having an identity or, is consensus really universal? in DISTRIBUTED COMPUTING
  • 2006 Robustness of the Internet at the Topology and Routing Level in DEPENDABLE SYSTEMS: SOFTWARE, COMPUTING, NETWORKS
  • 2005 Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing in COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING
  • 2005 Distributed Weighted Vertex Cover via Maximal Matchings in COMPUTING AND COMBINATORICS
  • 2004 Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction in ALGORITHMS IN BIOINFORMATICS
  • 2003 Ancestral Maximum Likelihood of Evolutionary Trees Is Hard in ALGORITHMS IN BIOINFORMATICS
  • 2003 Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models in FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 2001-04 Some simple distributed algorithms for sparse networks in DISTRIBUTED COMPUTING
  • 2001 Packing Cycles and Cuts in Undirected Graphs in ALGORITHMS — ESA 2001
  • 2000 Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem in APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION
  • 2000 On the Importance of Having an Identity or, is Consensus really Universal? in DISTRIBUTED COMPUTING
  • 1998-08 Randomized naming using wait-free shared variables in DISTRIBUTED COMPUTING
  • 1997 On the hardness of allocating frequencies for hybrid networks in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1995-06 The local nature of Δ-coloring and its algorithmic applications in COMBINATORICA
  • 1995 Near-optimal distributed edge coloring in ALGORITHMS — ESA '95
  • 1994 Randomized wait-free naming in ALGORITHMS AND COMPUTATION
  • 1989 Completeness in approximation classes in FUNDAMENTALS OF COMPUTATION THEORY
  • 1988 Predicting deadlock in store-and-forward networks in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 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.5395.a", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.7841.a", 
            "type": "Organization"
          }
        ], 
        "familyName": "Panconesi", 
        "givenName": "Alessandro", 
        "id": "sg:person.012766154071.70", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012766154071.70"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:41", 
        "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_1470.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.012766154071.70'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...