Vincenzo Auletta


Ontology type: schema:Person     


Person Info

NAME

Vincenzo

SURNAME

Auletta

Publications in SciGraph latest 50 shown

  • 2018-11 Metastability of Logit Dynamics for Coordination Games in ALGORITHMICA
  • 2017 Logit Dynamics with Concurrent Updates for Local Interaction Games in EXTENDED ABSTRACTS SUMMER 2015
  • 2017 Information Retention in Heterogeneous Majority Dynamics in WEB AND INTERNET ECONOMICS
  • 2016-09 Convergence to Equilibrium of Logit Dynamics for Strategic Games in ALGORITHMICA
  • 2015-11 Logit Dynamics with Concurrent Updates for Local Interaction Potential Games in ALGORITHMICA
  • 2015-10 Mechanisms for Scheduling with Single-Bit Private Values in THEORY OF COMPUTING SYSTEMS
  • 2015 Minority Becomes Majority in Social Networks in WEB AND INTERNET ECONOMICS
  • 2013-07 Mixing Time and Stationary Expected Social Welfare of Logit Dynamics in THEORY OF COMPUTING SYSTEMS
  • 2013 Logit Dynamics with Concurrent Updates for Local Interaction Games in ALGORITHMS – ESA 2013
  • 2012 Mechanisms for Scheduling with Single-Bit Private Values in ALGORITHMIC GAME THEORY
  • 2011-01 Alternatives to truthfulness are hard to recognize in AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
  • 2011-01 A response to “Mechanism Design with Partial Verification and Revelation Principle” in AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
  • 2010 Mixing Time and Stationary Expected Social Welfare of Logit Dynamics in ALGORITHMIC GAME THEORY
  • 2010 Increasing Privacy Threats in the Cyberspace: The Case of Italian E-Passports in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2009 Private Capacities in Mechanism Design in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009
  • 2008 Interference Games in Wireless Networks in INTERNET AND NETWORK ECONOMICS
  • 2008 Alternatives to Truthfulness Are Hard to Recognize in ALGORITHMIC GAME THEORY
  • 2007 Authenticated Web Services: A WS-Security Based Implementation* in NEW TECHNOLOGIES, MOBILITY AND SECURITY
  • 2006 New Constructions of Mechanisms with Verification in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2005 A WEB SERVICE FOR CERTIFIED EMAIL in CERTIFICATION AND SECURITY IN INTER-ORGANIZATIONAL E-SERVICE
  • 2005 On Designing Truthful Mechanisms for Online Scheduling in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2005 Deterministic Monotone Algorithms for Scheduling on Related Machines in APPROXIMATION AND ONLINE ALGORITHMS
  • 2004 Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines in STACS 2004
  • 2004 The Power of Verification for One-Parameter Agents in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2000 Randomized Path Coloring on Binary Trees in APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION
  • 1999-03 A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees in ALGORITHMICA
  • 1998 On the complexity of wavelength converters in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998
  • 1997 Better algorithms for minimum weight vertex-connectivity problems in STACS 97
  • 1996 A new approach to optimal planning of robot motion on a tree with obstacles in ALGORITHMS — ESA '96
  • 1996 A linear time algorithm for the feasibility of pebble motion on trees in ALGORITHM THEORY — SWAT'96
  • 1995 Fast execution of irregularly structured programs with low communication frequency on the hypercube in PARALLEL ALGORITHMS FOR IRREGULARLY STRUCTURED PROBLEMS
  • 1995 Placing resources in a tree: Dynamic and static algorithms in AUTOMATA, LANGUAGES AND PROGRAMMING
  • Affiliations

    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.5326.2", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Auletta", 
        "givenName": "Vincenzo", 
        "id": "sg:person.016327521101.60", 
        "identifier": {
          "name": "orcid_id", 
          "type": "PropertyValue", 
          "value": [
            "0000-0002-7875-3366"
          ]
        }, 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016327521101.60", 
          "https://orcid.org/0000-0002-7875-3366"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:58", 
        "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_1737.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.016327521101.60'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...