FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

24th International Conference, Chennai, India, December 16-18, 2004. Proceedings

Editors:

ISBN: 978-3-540-24058-7 (Print) 978-3-540-30538-5 (Online)

Table of contents (43 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Papers

    1. No Access

      Book Chapter

      Pages 1-15

      Genome Halving Problem Revisited

    2. No Access

      Book Chapter

      Pages 16-31

      Verifying Probabilistic Procedural Programs

    3. No Access

      Book Chapter

      Pages 32-34

      Streaming Algorithms for Geometric Problems

    4. No Access

      Book Chapter

      Pages 35-48

      Toward a Grainless Semantics for Shared-Variable Concurrency

    5. No Access

      Book Chapter

      Pages 49-57

      Regular Languages, Unambiguous Concatenation and Computational Complexity

  3. Contributed Papers

    1. No Access

      Book Chapter

      Pages 58-70

      Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets

    2. No Access

      Book Chapter

      Pages 71-83

      On the Urgency Expressiveness

    3. No Access

      Book Chapter

      Pages 84-96

      Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages

    4. No Access

      Book Chapter

      Pages 97-109

      A Decidable Fragment of Separation Logic

    5. No Access

      Book Chapter

      Pages 110-121

      Approximate Range Searching Using Binary Space Partitions

    6. No Access

      Book Chapter

      Pages 122-134

      Representable Disjoint NP-Pairs

    7. No Access

      Book Chapter

      Pages 135-147

      Symbolic Reachability Analysis of Higher-Order Context-Free Processes

    8. No Access

      Book Chapter

      Pages 148-160

      Optimal Strategies in Priced Timed Game Automata

    9. No Access

      Book Chapter

      Pages 161-173

      A Calculus for Trust Management

    10. No Access

      Book Chapter

      Pages 174-185

      Short-Cuts on Star, Source and Planar Unfoldings

    11. No Access

      Book Chapter

      Pages 186-197

      Subdividing Alpha Complex

    12. No Access

      Book Chapter

      Pages 198-210

      Real-Counter Automata and Their Decision Problems

    13. No Access

      Book Chapter

      Pages 211-223

      Adjunct Elimination Through Games in Static Ambient Logic

    14. No Access

      Book Chapter

      Pages 224-236

      On the Bisimulation Invariant Fragment of Monadic Σ1 in the Finite

    15. No Access

      Book Chapter

      Pages 237-249

      On the Complexity of Hilbert’s 17th Problem

previous Page of 3