rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Automata, Languages and Programming
    sub title: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II
  name:
    name part: Abramsky, Samson.
    role:
      role term: editor.
  name:
    name part: Gavoille, Cyril.
    role:
      role term: editor.
  name:
    name part: Kirchner, Claude.
    role:
      role term: editor.
  name:
    name part: Meyer auf der Heide, Friedhelm.
    role:
      role term: editor.
  name:
    name part: Spirakis, Paul G.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2010
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XXIV, 614 p. 78 illus. online resource.
  table of contents: Invited Talks -- Informative Labeling Schemes -- Noetherian Spaces in Verification -- Towards a Theory of Time-Bounded Verification -- Physical Algorithms -- Session 1-Track B. Automata -- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata -- Pumping and Counting on the Regular Post Embedding Problem -- Alternation Removal in Büchi Automata -- Linear Orders in the Pushdown Hierarchy -- Session 1-Track C. Communication in Networks -- The Serializability of Network Codes -- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) -- Efficient Information Exchange in the Random Phone-Call Model -- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines -- Session 2-Track B. Formal Languages -- A Topological Approach to Recognition -- On LR(k)-Parsers of Polynomial Size -- On Erasing Productions in Random Context Grammars -- Session 4-Track B. Semantics -- Game Semantics for Call-by-Value Polymorphism -- What Is a Pure Functional? -- Example-Guided Abstraction Simplification -- Compositional Closure for Bayes Risk in Probabilistic Noninterference -- Session 4-Track C. Fault Tolerance, Ranking -- Asynchronous Throughput-Optimal Routing in Malicious Networks -- Improved Fault Tolerance and Secure Computation on Sparse Networks -- Sparse Reliable Graph Backbones -- Approximation Algorithms for Diversified Search Ranking -- Session 5-Track B. Graphs, Categories and Quantum Information -- Rewriting Measurement-Based Quantum Computations with Generalised Flow -- The Compositional Structure of Multipartite Quantum Entanglement -- Compositionality in Graph Transformation -- Session 6-Track B. Best Paper Award -- On p-Optimal Proof Systems and Logics for PTIME -- Session 6-Track C. Best Paper Award -- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests -- Session 7-Track B. Logic -- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals -- B and D Are Enough…
  note: edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Software engineering
  subject:
    topic: Computer programming
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer Science
  subject:
    topic: Programming Techniques
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Software Engineering/Programming and Operating Systems
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Software Engineering
  classification: QA76.6-76.66
  classification: 005.11
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 6199
  identifier: 9783642141621
  identifier: http://dx.doi.org/10.1007/978-3-642-14162-1
  record info:
    record creation date: 100705
    record change date: 20151204150838.0
    record identifier: 978-3-642-14162-1