Vincenzo Bonifaci


Ontology type: schema:Person     


Person Info

NAME

Vincenzo

SURNAME

Bonifaci

Publications in SciGraph latest 50 shown

  • 2018-12-13 ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors in JOURNAL OF SCHEDULING
  • 2017-02 A revised model of fluid transport optimization in Physarum polycephalum in JOURNAL OF MATHEMATICAL BIOLOGY
  • 2016-01 On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm in REAL-TIME SYSTEMS
  • 2013-03 Partitioned EDF scheduling on a few types of unrelated multiprocessors in REAL-TIME SYSTEMS
  • 2013-03 Andrew Adamatzky: Physarum Machines: Computers from Slime Mould in GENETIC PROGRAMMING AND EVOLVABLE MACHINES
  • 2013 Algorithms for Auctions and Games in THE POWER OF ALGORITHMS
  • 2013 Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2012-08 Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems in ALGORITHMICA
  • 2012-04 A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling in ALGORITHMICA
  • 2011-06 Budgeted matching and budgeted matroid intersection via the gasoline puzzle in MATHEMATICAL PROGRAMMING
  • 2011 Efficiency of Restricted Tolls in Non-atomic Network Routing Games in ALGORITHMIC GAME THEORY
  • 2011 Mixed-Criticality Scheduling of Sporadic Task Systems in ALGORITHMS – ESA 2011
  • 2010-09 Improved multiprocessor global schedulability analysis in REAL-TIME SYSTEMS
  • 2010 Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems in ALGORITHMS – ESA 2010
  • 2010 Scheduling Real-Time Mixed-Criticality Jobs in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010
  • 2009-11-09 Data Gathering in Wireless Networks in GRAPHS AND ALGORITHMS IN COMMUNICATION NETWORKS
  • 2009-10 Online k-Server Routing Problems in THEORY OF COMPUTING SYSTEMS
  • 2008 Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle in INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
  • 2008 Minimizing Average Flow Time in Sensor Data Gathering in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2008 The Distributed Wireless Gathering Problem in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2008 A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling in ALGORITHMS - ESA 2008
  • 2008 Stackelberg Routing in Arbitrary Networks in INTERNET AND NETWORK ECONOMICS
  • 2007 Online k-Server Routing Problems in APPROXIMATION AND ONLINE ALGORITHMS
  • 2006 An Approximation Algorithm for the Wireless Gathering Problem in ALGORITHM THEORY – SWAT 2006
  • 2006 On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2005 New Results on the Complexity of Uniformly Mixed Nash Equilibria in INTERNET AND NETWORK ECONOMICS
  • 2005 The On-line Asymmetric Traveling Salesman Problem in ALGORITHMS AND DATA STRUCTURES
  • 2005 Game-Theoretic Analysis of Internet Switching with Selfish Users in INTERNET AND NETWORK ECONOMICS
  • 2005 Portraying Algorithms with Leonardo Web in WEB INFORMATION SYSTEMS ENGINEERING – WISE 2005 WORKSHOPS
  • 2005 On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems in FUNDAMENTALS OF COMPUTATION THEORY
  • 2002-07-23 S.P.Q.R. Legged Team in ROBOCUP 2001: ROBOT SOCCER WORLD CUP V
  • 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.419461.f", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Bonifaci", 
        "givenName": "Vincenzo", 
        "id": "sg:person.013326621163.01", 
        "identifier": {
          "name": "orcid_id", 
          "type": "PropertyValue", 
          "value": [
            "0000-0001-9038-6901"
          ]
        }, 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013326621163.01", 
          "https://orcid.org/0000-0001-9038-6901"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:52", 
        "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_1644.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.013326621163.01'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...