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: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings
  name:
    name part: Díaz, Josep.
    role:
      role term: editor.
  name:
    name part: Karhumäki, Juhani.
    role:
      role term: editor.
  name:
    name part: Lepistö, Arto.
    role:
      role term: editor.
  name:
    name part: Sannella, Donald.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2004
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XXXVIII, 1256 p. online resource.
  table of contents: Invited Talks -- Self-Adjusting Computation -- The Past, Present, and Future of Web Search Engines -- What Do Program Logics and Type Systems Have in Common? -- Feasible Proofs and Computations: Partnership and Fusion -- Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input -- Testing, Optimizaton, and Games -- Contributed Papers -- Deciding Knowledge in Security Protocols Under Equational Theories -- Representing Nested Inductive Types Using W-Types -- Algorithms for Multi-product Pricing -- Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas -- Linear and Branching Metrics for Quantitative Transition Systems -- Learning a Hidden Subgraph -- Optimal Reachability for Weighted Timed Games -- Wavelength Assignment in Optical Networks with Fixed Fiber Capacity -- External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs -- A ?-Calculus for Resource Separation -- The Power of Verification for One-Parameter Agents -- Group Spreading: A Protocol for Provably Secure Distributed Name Service -- Further Improvements in Competitive Guarantees for QoS Buffering -- Competition-Induced Preferential Attachment -- Approximating Longest Directed Paths and Cycles -- Definitions and Bounds for Self-Healing Key Distribution Schemes -- Tree-Walking Automata Cannot Be Determinized -- Projecting Games on Hypercoherences -- An Analog Characterization of Elementarily Computable Functions over the Real Numbers -- Model Checking with Multi-valued Logics -- The Complexity of Partition Functions -- Comparing Recursion, Replication, and Iteration in Process Calculi -- Dynamic Price Sequence and Incentive Compatibility -- The Complexity of Equivariant Unification -- Coordination Mechanisms -- Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help -- Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities -- Coloring Semirandom Graphs Optimally -- Sublinear-Time Approxi…
  note: edited by Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella.
  subject:
    topic: Computer science
  subject:
    topic: Software engineering
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Computers
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Software Engineering/Programming and Operating Systems
  subject:
    topic: Theory of Computation
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Numeric Computing
  subject:
    topic: Data Structures
  classification: QA76.758
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 3142
  identifier: 9783540278368
  identifier: http://dx.doi.org/10.1007/b99859
  record info:
    record creation date: 121227
    record change date: 20151204175904.0
    record identifier: 978-3-540-27836-8