Skip to main content
SpringerLink
Log in
Book cover

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Kamal Lodaya

    1. The Institute of Mathematical Sciences, Chennai, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Meena Mahajan

    1. The Institute of Mathematical Sciences, Chennai, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3328)

Included in the following conference series:

Conference proceedings info: FSTTCS 2004.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (43 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Papers

    1. Genome Halving Problem Revisited

      • Max A. Alekseyev, Pavel A. Pevzner
      Pages 1-15

    2. Verifying Probabilistic Procedural Programs

      • Javier Esparza, Kousha Etessami
      Pages 16-31

    3. Streaming Algorithms for Geometric Problems

      • Piotr Indyk
      Pages 32-34

    4. Toward a Grainless Semantics for Shared-Variable Concurrency

      • John C. Reynolds
      Pages 35-48

    5. Regular Languages, Unambiguous Concatenation and Computational Complexity

      • Denis Thérien
      Pages 49-57

  3. Contributed Papers

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

      • Parosh Abdulla, Pritha Mahata, Richard Mayr
      Pages 58-70

    2. On the Urgency Expressiveness

      • Michaël Adélaïde, Claire Pagetti
      Pages 71-83

    3. Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages

      • Bharat Adsul, Milind Sohoni
      Pages 84-96

    4. A Decidable Fragment of Separation Logic

      • Josh Berdine, Cristiano Calcagno, Peter W. O’Hearn
      Pages 97-109

    5. Approximate Range Searching Using Binary Space Partitions

      • Mark de Berg, Micha Streppel
      Pages 110-121

    6. Representable Disjoint NP-Pairs

      • Olaf Beyersdorff
      Pages 122-134

    7. Symbolic Reachability Analysis of Higher-Order Context-Free Processes

      • Ahmed Bouajjani, Antoine Meyer
      Pages 135-147

    8. Optimal Strategies in Priced Timed Game Automata

      • Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim G. Larsen
      Pages 148-160

    9. A Calculus for Trust Management

      • Marco Carbone, Mogens Nielsen, Vladimiro Sassone
      Pages 161-173

    10. Short-Cuts on Star, Source and Planar Unfoldings

      • Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar
      Pages 174-185

    11. Subdividing Alpha Complex

      • Ho-lun Cheng, Tony Tan
      Pages 186-197

    12. Real-Counter Automata and Their Decision Problems

      • Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
      Pages 198-210

    13. Adjunct Elimination Through Games in Static Ambient Logic

      • Anuj Dawar, Philippa Gardner, Giorgio Ghelli
      Pages 211-223

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

      • Anuj Dawar, David Janin
      Pages 224-236
Back to top

Other volumes

  1. FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Keywords

Editors and Affiliations

  • The Institute of Mathematical Sciences, Chennai, India

    Kamal Lodaya, Meena Mahajan

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation