Pierre Fraigniaud


Ontology type: schema:Person     


Person Info

NAME

Pierre

SURNAME

Fraigniaud

Publications in SciGraph latest 50 shown

  • 2018-08-30 Randomized proof-labeling schemes in DISTRIBUTED COMPUTING
  • 2018-06-06 Noisy rumor spreading and plurality consensus in DISTRIBUTED COMPUTING
  • 2016-04 Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems in ALGORITHMICA
  • 2016 Distributed Testing of Excluded Subgraphs in DISTRIBUTED COMPUTING
  • 2016 Challenges in Fault-Tolerant Distributed Runtime Verification in LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION AND VALIDATION: DISCUSSION, DISSEMINATION, APPLICATIONS
  • 2016 Perfect Failure Detection with Very Few Bits in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2016 Asynchronous Coordination Under Preferences and Constraints in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2016 Locality in Distributed Graph Algorithms in ENCYCLOPEDIA OF ALGORITHMS
  • 2016 Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings in LATIN 2016: THEORETICAL INFORMATICS
  • 2016 Sparsifying Congested Cliques and Core-Periphery Networks in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2015 Node Labels in Local Decision in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2015 Locality in Distributed Graph Algorithms in ENCYCLOPEDIA OF ALGORITHMS
  • 2014-12 Randomized distributed decision in DISTRIBUTED COMPUTING
  • 2014-08 Greedy routing in small-world networks with power-law degrees in DISTRIBUTED COMPUTING
  • 2014 Distributedly Testing Cycle-Freeness in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2014 Automatically Adjusting Concurrency to the Level of Synchrony in DISTRIBUTED COMPUTING
  • 2014 On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems in RUNTIME VERIFICATION
  • 2014 The Opinion Number of Set-Agreement in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2014 On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2013-10 Special issue with selected papers from PODC 2011 in DISTRIBUTED COMPUTING
  • 2013-08 Locality and checkability in wait-free computing in DISTRIBUTED COMPUTING
  • 2013 Rumor Spreading in Random Evolving Graphs in ALGORITHMS – ESA 2013
  • 2013 Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2013 Local Decision and Verification with Bounded-Size Outputs in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2012 Notions of Connectivity in Overlay Networks in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2012 Computing with Large Populations Using Interactions in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012
  • 2012 Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence in DISTRIBUTED COMPUTING
  • 2012 Decidability Classes for Mobile Agents Computing in LATIN 2012: THEORETICAL INFORMATICS
  • 2012 Randomized Distributed Decision in DISTRIBUTED COMPUTING
  • 2012 What Can Be Computed without Communications? in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2012 On the Impact of Identifiers on Local Decision in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2012 The Worst Case Behavior of Randomized Gossip in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2011-09 Parsimonious flooding in dynamic graphs in DISTRIBUTED COMPUTING
  • 2011 Locality and Checkability in Wait-Free Computing in DISTRIBUTED COMPUTING
  • 2010-11 Local MST Computation with Short Advice in THEORY OF COMPUTING SYSTEMS
  • 2010 Informative Labeling Schemes in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2010 Sub-linear Universal Spatial Gossip Protocols in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2010 On the Additive Constant of the k-Server Work Function Algorithm in APPROXIMATION AND ONLINE ALGORITHMS
  • 2009-03 Nondeterministic Graph Searching: From Pathwidth to Treewidth in ALGORITHMICA
  • 2009-03 Distributed computing with advice: information sensitivity of graph coloring in DISTRIBUTED COMPUTING
  • 2009-01 Labeling Schemes for Tree Representation in ALGORITHMICA
  • 2009 Online Computation with Advice in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2008 Networks Become Navigable as Nodes Move and Forget in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2008 Recovering the Long-Range Links in Augmented Graphs in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2008 Deterministic Rendezvous in Trees with Little Memory in DISTRIBUTED COMPUTING
  • 2007-02 Rendezvous and Election of Mobile Agents: Impact of Sense of Direction in THEORY OF COMPUTING SYSTEMS
  • 2007 Distributed Computing with Advice: Information Sensitivity of Graph Coloring in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007 Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation in ALGORITHMS – ESA 2007
  • 2006-09 Deterministic Rendezvous in Graphs in ALGORITHMICA
  • 2006-03 Eclecticism shrinks even small worlds in DISTRIBUTED COMPUTING
  • 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": "Fraigniaud", 
        "givenName": "Pierre", 
        "id": "sg:person.013424402135.28", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013424402135.28"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:51", 
        "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_1624.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.013424402135.28'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

    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.013424402135.28 schema:familyName Fraigniaud
    2 schema:givenName Pierre
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013424402135.28
    4 schema:sdDatePublished 2019-03-07T13:51
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher Nbdc5364ec7354303a440986c909583b5
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 Nbdc5364ec7354303a440986c909583b5 schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization
     




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


    ...