Automata, Languages and Programming

31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings

ISBN: 978-3-540-22849-3 (Print) 978-3-540-27836-8 (Online)

Table of contents (102 chapters)

previous Page of 6
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-2

      Self-Adjusting Computation

    2. No Access

      Book Chapter

      Pages 3-3

      The Past, Present, and Future of Web Search Engines

    3. No Access

      Book Chapter

      Pages 4-7

      What Do Program Logics and Type Systems Have in Common?

    4. No Access

      Book Chapter

      Pages 8-14

      Feasible Proofs and Computations: Partnership and Fusion

    5. No Access

      Book Chapter

      Pages 15-27

      Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input

    6. No Access

      Book Chapter

      Pages 28-45

      Testing, Optimizaton, and Games

  3. Contributed Papers

    1. No Access

      Book Chapter

      Pages 46-58

      Deciding Knowledge in Security Protocols Under Equational Theories

    2. No Access

      Book Chapter

      Pages 59-71

      Representing Nested Inductive Types Using W-Types

    3. No Access

      Book Chapter

      Pages 72-83

      Algorithms for Multi-product Pricing

    4. No Access

      Book Chapter

      Pages 84-96

      Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

    5. No Access

      Book Chapter

      Pages 97-109

      Linear and Branching Metrics for Quantitative Transition Systems

    6. No Access

      Book Chapter

      Pages 110-121

      Learning a Hidden Subgraph

    7. No Access

      Book Chapter

      Pages 122-133

      Optimal Reachability for Weighted Timed Games

    8. No Access

      Book Chapter

      Pages 134-145

      Wavelength Assignment in Optical Networks with Fixed Fiber Capacity

    9. No Access

      Book Chapter

      Pages 146-157

      External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs

    10. No Access

      Book Chapter

      Pages 158-170

      A λ-Calculus for Resource Separation

    11. No Access

      Book Chapter

      Pages 171-182

      The Power of Verification for One-Parameter Agents

    12. No Access

      Book Chapter

      Pages 183-195

      Group Spreading: A Protocol for Provably Secure Distributed Name Service

    13. No Access

      Book Chapter

      Pages 196-207

      Further Improvements in Competitive Guarantees for QoS Buffering

    14. No Access

      Book Chapter

      Pages 208-221

      Competition-Induced Preferential Attachment

previous Page of 6