Andrzej Pelc


Ontology type: schema:Person     


Person Info

NAME

Andrzej

SURNAME

Pelc

Publications in SciGraph latest 50 shown

  • 2016-06 Rendezvous in networks in spite of delay faults in DISTRIBUTED COMPUTING
  • 2016-02 Time versus cost tradeoffs for deterministic rendezvous in networks in DISTRIBUTED COMPUTING
  • 2016-02 Anonymous Meeting in Networks in ALGORITHMICA
  • 2016-01 Convergecast and Broadcast by Power-Aware Mobile Agents in ALGORITHMICA
  • 2016 Deterministic Meeting of Sniffing Agents in the Plane in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2016 Asynchronous Broadcasting with Bivalent Beeps in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2015 Deterministic Rendezvous with Detection Using Beeps in ALGORITHMS FOR SENSOR SYSTEMS
  • 2014-04 Time versus space trade-offs for rendezvous in trees in DISTRIBUTED COMPUTING
  • 2014 Fault-Tolerant Rendezvous in Networks in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2013-03 Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots in ALGORITHMICA
  • 2013 Deterministic Polynomial Approach in the Plane in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2013 Learning a Ring Cheaply and Fast in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2012 Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2012 Knowledge, Level of Symmetry, and Time of Leader Election in ALGORITHMS – ESA 2012
  • 2012 Decidability Classes for Mobile Agents Computing in LATIN 2012: THEORETICAL INFORMATICS
  • 2012 Electing a Leader in Multi-hop Radio Networks in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2012 Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2011-08 Trade-offs Between the Size of Advice and Broadcasting Time in Trees in ALGORITHMICA
  • 2011 Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2011 DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results in DISTRIBUTED COMPUTING
  • 2010 Asynchronous Deterministic Rendezvous in Bounded Terrains in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2010 Drawing Maps with Advice in DISTRIBUTED COMPUTING
  • 2009-03 Distributed computing with advice: information sensitivity of graph coloring in DISTRIBUTED COMPUTING
  • 2009-02 Broadcasting in UDG radio networks with unknown topology in DISTRIBUTED COMPUTING
  • 2009 Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2008 Fast Radio Broadcasting with Advice in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2008 Broadcasting in UDG Radio Networks with Missing and Inaccurate Information in DISTRIBUTED COMPUTING
  • 2007 Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2007 Communication in Networks with Random Dependent Faults in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007
  • 2007 Distributed Computing with Advice: Information Sensitivity of Graph Coloring in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2006-09 Deterministic Rendezvous in Graphs in ALGORITHMICA
  • 2005 Systolic Communication in DISSEMINATION OF INFORMATION IN COMMUNICATION NETWORKS
  • 2005 Broadcast on Distributed Networks in DISSEMINATION OF INFORMATION IN COMMUNICATION NETWORKS
  • 2005 Fault-Tolerant Broadcast in Distributed Networks in DISSEMINATION OF INFORMATION IN COMMUNICATION NETWORKS
  • 2005 Fundamentals in DISSEMINATION OF INFORMATION IN COMMUNICATION NETWORKS
  • 2005 Searching for a Black Hole in Tree Networks in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2004 Polynomial Deterministic Rendezvous in Arbitrary Graphs in ALGORITHMS AND COMPUTATION
  • 2004 Collective Tree Exploration in LATIN 2004: THEORETICAL INFORMATICS
  • 2002-07-18 Efficient Communication in Unknown Networks in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2002-03-15 Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract) in ALGORITHMS — ESA’ 98
  • 2002-01-29 Deterministic Broadcasting Time with Partial Knowledge of the Network in ALGORITHMS AND COMPUTATION
  • 2002 Transducers with Set Output in COMPUTING AND COMBINATORICS
  • 2002 Optimal Graph Exploration without Good Maps in ALGORITHMS — ESA 2002
  • 2001 Deterministic Radio Broadcasting at Low Cost in STACS 2001
  • 2000-09 Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes in ALGORITHMICA
  • 1993 Sparse networks supporting efficient reliable broadcasting in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1990 Unfolding Weighted Consensus Orders into Consistent Numerical Scales in TOPICS IN COMBINATORICS AND GRAPH THEORY
  • 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.265705.3", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Pelc", 
        "givenName": "Andrzej", 
        "id": "sg:person.013306156242.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013306156242.32"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:08", 
        "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_1899.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.013306156242.32'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...