Skip to main content
  • Conference proceedings
  • © 2005

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings

Conference proceedings info: FSTTCS 2005.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

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

Table of contents (45 papers)

  1. Front Matter

  2. Invited Papers

    1. Semiperfect-Information Games

      • Krishnendu Chatterjee, Thomas A. Henzinger
      Pages 1-18
    2. Computational Complexity Since 1980

      • Russell Impagliazzo
      Pages 19-47
    3. Inference Systems for Logical Algorithms

      • Natarajan Shankar
      Pages 60-78
    4. From Logic to Games

      • Igor Walukiewicz
      Pages 79-91
    5. Erdős Magic

      • Joel Spencer
      Pages 106-106
  3. Contributed Papers

    1. No Coreset, No Cry: II

      • Michael Edwards, Kasturi Varadarajan
      Pages 107-115
    2. On the Bisimulation Congruence in χ-Calculus

      • Taolue Chen, Tingting Han, Jian Lu
      Pages 128-139
    3. Approximation Algorithms for Wavelength Assignment

      • Vijay Kumar, Atri Rudra
      Pages 152-163
    4. The Set Cover with Pairs Problem

      • Refael Hassin, Danny Segev
      Pages 164-176
    5. Non-disclosure for Distributed Mobile Code

      • Ana Almeida Matos
      Pages 177-188
    6. Quantitative Models and Implicit Complexity

      • Ugo Dal Lago, Martin Hofmann
      Pages 189-200
    7. The MSO Theory of Connectedly Communicating Processes

      • P. Madhusudan, P. S. Thiagarajan, Shaofa Yang
      Pages 201-212
    8. Reachability of Hennessy-Milner Properties for Weakly Extended PRS

      • Mojmír Křetínský, Vojtěch Řehák, Jan Strejček
      Pages 213-224
    9. Decision Procedures for Queues with Integer Constraints

      • Ting Zhang, Henny B. Sipma, Zohar Manna
      Pages 225-237
    10. The Directed Planar Reachability Problem

      • Eric Allender, Samir Datta, Sambuddha Roy
      Pages 238-249

Other Volumes

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

Editors and Affiliations

  • National Institute of Advanced Studies, Indian Institute of Science Campus, Bangalore, India

    Sundar Sarukkai

  • Department of Comp. Sc. & Engg., Indian Institute of Technology Delhi, New Delhi, India

    Sandeep Sen

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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