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: 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings
  name:
    name part: Montanari, Ugo.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Rolim, Jose D.P.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Welzl, Emo.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2000
    edition: 1st ed. 2000.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVI, 952 p. online resource.
  abstract: This book constitutes the refereed proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, held in Geneva, Switzerland in July 2000. The 69 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 196 extended abstracts submitted for the two tracks on algorithms, automata, complexity, and games and on logic, semantics, and programming theory. All in all, the volume presents an unique snapshot of the state-of-the-art in theoretical computer science.
  table of contents: Invited Talk -- Game Semantics: Achievements and Prospects -- Clique Is Hard to Approximate within n 1-o(1) -- Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time -- Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming -- A Statically Allocated Parallel Functional Language -- An Optimal Minimum Spanning Tree Algorithm -- Improved Shortest Paths on the Word RAM -- Improved Algorithms for Finding Level Ancestors in Dynamic Trees -- Lax Logical Relations -- Reasoning about Idealized ALGOL Using Regular Languages -- The Measurement Process in Domain Theory -- Invited Talk -- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution -- Monotone Proofs of the Pigeon Hole Principle -- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models -- Algebraic Models for Contextual Nets -- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems -- Measures of Nondeterminism in Finite Automata -- LTL Is Expressively Complete for Mazurkiewicz Traces -- An Automata-Theoretic Completeness Proof for Interval Temporal Logic -- Invited Talk -- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? -- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search -- Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices -- Variable Independence, Quantifier Elimination, and Constraint Representations -- Constraint Satisfaction Problems and Finite Algebras -- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing -- Resource Augmentation for Online Bounded Space Bin Packing -- Optimal Projective Algorithms for the List Update Problem -- Efficient Verification Algorithms for One-Counter Processes -- On the Complexity of Bisimulation Problems for Basic Parallel Processes -- Decidable First-Order Transition Logics for PA-Processes -- Invited Talk -- Non Interference for the…
  note: edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl.
  subject:
    topic: Computers
  subject:
    topic: Software engineering
  subject:
    topic: Computer communication systems
  subject:
    topic: Special purpose computers
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Theory of Computation
  subject:
    topic: Software Engineering/Programming and Operating Systems
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Special Purpose and Application-Based Systems
  subject:
    topic: Mathematics of Computing
  classification: QA75.5-76.95
  classification: QA76.63
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 1853
  identifier: 9783540450221
  identifier: https://doi.org/10.1007/3-540-45022-X
  record info:
    record creation date: 121227
    record change date: 20191024111644.0
    record identifier: 978-3-540-45022-1