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: STACS 2001
    sub title: 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings
  name:
    name part: Ferreira, Afonso.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Reichel, Horst.
    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: 2001
    edition: 1st ed. 2001.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVI, 580 p. online resource.
  table of contents: Invited Presentations -- Recurrence in Infinite Words -- Generalized Model-Checking Problems for First-Order Logic -- Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra -- Contributions -- 2-Nested Simulation Is Not Finitely Equationally Axiomatizable -- On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems -- Matching Polygonal Curves with Respect to the Fréchet Distance -- On the Class of Languages Recognizable by 1-Way Quantum Finite Automata -- Star-Free Open Languages and Aperiodic Loops -- A 5/2n 2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication -- Evasiveness of Subgraph Containment and Related Properties -- On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs -- On Presburger Liveness of Discrete Timed Automata -- Residual Finite State Automata -- Deterministic Radio Broadcasting at Low Cost -- The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete -- Recursive Randomized Coloring Beats Fair Dice Random Colorings -- Randomness, Computability, and Density -- On Multipartition Communication Complexity -- Scalable Sparse Topologies with Small Spectrum -- Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios -- The UPS Problem -- Gathering of Asynchronous Oblivious Robots with Limited Visibility -- Generalized Langton's Ant: Dynamical Behavior and Complexity -- Optimal and Approximate Station Placement in Networks -- Learning Expressions over Monoids -- Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods -- On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages -- Efficient Minimal Perfect Hashing in Nearly Minimal Space -- Small PCPs with Low Query Complexity -- Space Efficient Algorithms for Series-Parallel Graphs -- A Toolkit for First Order Extensions of Monadic Games -- Polynom…
  note: edited by Afonso Ferreira, Horst Reichel.
  subject:
    topic: Computers
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Optical data processing
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Theory of Computation
  subject:
    topic: Data Structures and Information Theory
  subject:
    topic: Image Processing and Computer Vision
  subject:
    topic: Data Structures
  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, 2010
  identifier: 9783540446934
  identifier: https://doi.org/10.1007/3-540-44693-1
  record info:
    record creation date: 121227
    record change date: 20191022002714.0
    record identifier: 978-3-540-44693-4