FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science: 23rd Conference, Mumbai India, December 15-17, 2003, Proceedings | SpringerLink
Skip to main content
Springer Nature Link
Log in

FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

23rd Conference, Mumbai India, December 15-17, 2003, Proceedings

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Paritosh K. Pandya

    1. Tata Institute of Fundamental Research, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jaikumar Radhakrishnan

    1. Tata Institute of Fundamental Research, School of Technology and Computer Science, Mumbai, 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 2914)

Included in the following conference series:

Conference proceedings info: FSTTCS 2003.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book JPY 7149
Price includes VAT (Japan)
  • 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

Keywords

Table of contents (38 papers)

  1. Front Matter

    Download chapter PDF

  2. Contributed Papers

    1. A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol

      • Michael Backes, Birgit Pfitzmann
      Pages 1-12

    2. Constructions of Sparse Asymmetric Connectors

      • Andreas Baltz, Gerold Jäger, Anand Srivastav
      Pages 13-22

    3. A Separation Logic for Resource Distribution

      • Nicolas Biri, Didier Galmiche
      Pages 23-37

    4. An Equational Theory for Transactions

      • Andrew P. Black, Vincent Cremet, Rachid Guerraoui, Martin Odersky
      Pages 38-49

    5. Axioms for Regular Words

      • Stephen L. Bloom, Zoltán Ésik
      Pages 50-61

    6. 1-Bounded TWA Cannot Be Determinized

      • Mikołaj Bojañczyk
      Pages 62-73

    7. Reachability Analysis of Process Rewrite Systems

      • Ahmed Bouajjani, Tayssir Touili
      Pages 74-87

    8. Pushdown Games with Unboundedness and Regular Conditions

      • Alexis-Julien Bouquet, Oliver Serre, Igor Walukiewicz
      Pages 88-99

    9. Real-Time Model-Checking: Parameters Everywhere

      • Véronique Bruyère, Jean-François Raskin
      Pages 100-111

    10. The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata

      • Arnaud Carayol, Stefan Wöhrle
      Pages 112-123

    11. Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents

      • Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
      Pages 124-135

    12. Subtyping Constraints in Quasi-lattices

      • Emmanuel Coquery, François Fages
      Pages 136-148

    13. An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case

      • Nikhil R. Devanur, Vijay V. Vazirani
      Pages 149-155

    14. Word Equations over Graph Products

      • Volker Diekert, Markus Lohrey
      Pages 156-167

    15. Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models

      • Devdatt Dubhashi, Luigi Laura, Alessandro Panconesi
      Pages 168-182

    16. Comparing Sequences with Segment Rearrangements

      • Funda Ergun, S. Muthukrishnan, S. Cenk Sahinalp
      Pages 183-194

    17. On Logically Defined Recognizable Tree Languages

      • Zoltán Ésik, Pascal Weil
      Pages 195-207

    18. Randomized Time-Space Tradeoffs for Directed Graph Connectivity

      • Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta
      Pages 208-216

    19. Distance-Preserving Approximations of Polygonal Paths

      • Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
      Pages 217-228
Back to top

Other volumes

  1. FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Editors and Affiliations

  • Tata Institute of Fundamental Research, India

    Paritosh K. Pandya

  • Tata Institute of Fundamental Research, School of Technology and Computer Science, Mumbai, India

    Jaikumar Radhakrishnan

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation