Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2007

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science

27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings

Editors:

  1. V. Arvind
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sanjiva Prasad
    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 4855)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): FSTTCS: International Conference on Foundations of Software Technology and Theoretical Computer Science

Conference proceedings info: FSTTCS 2007.

Sections

Buy it now

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

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

Table of contents (45 papers)

  1. Front Matter

    PDF

  2. Invited Papers

    1. The Multicore Revolution

      • Maurice Herlihy
      Pages 1-8

    3. Adventures in Bidirectional Programming

      • Benjamin C. Pierce
      Pages 21-22

    4. Program Analysis Using Weighted Pushdown Systems

      • Thomas Reps, Akash Lal, Nick Kidd
      Pages 23-51

    5. The Complexity of Zero Knowledge

      • Salil Vadhan
      Pages 52-70

  3. Contributed Papers

    1. The Priority k-Median Problem

      • Amit Kumar, Yogish Sabharwal
      Pages 71-83

    2. “Rent-or-Buy” Scheduling and Cost Coloring Problems

      • Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
      Pages 84-95

    3. Order Scheduling Models: Hardness and Algorithms

      • Naveen Garg, Amit Kumar, Vinayaka Pandit
      Pages 96-107

    4. On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography

      • Michael Backes, Markus Dürmuth, Ralf Küsters
      Pages 108-120

    5. Key Substitution in the Symbolic Analysis of Cryptographic Protocols

      • Yannick Chevalier, Mounira Kourjieh
      Pages 121-132

    6. Symbolic Bisimulation for the Applied Pi Calculus

      • Stéphanie Delaune, Steve Kremer, Mark Ryan
      Pages 133-145

    7. Non-mitotic Sets

      • Christian Glaßer, Alan L. Selman, Stephen Travers, Liyu Zhang
      Pages 146-157

    8. Reductions to Graph Isomorphism

      • Jacobo Torán
      Pages 158-167

    9. Strong Reductions and Isomorphism of Complete Sets

      • Ryan C. Harkins, John M. Hitchcock, A. Pavan
      Pages 168-178

    10. Probabilistic and Topological Semantics for Timed Automata

      • Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer
      Pages 179-191

    11. A Theory for Game Theories

      • Michel Hirschowitz, André Hirschowitz, Tom Hirschowitz
      Pages 192-203

    12. An Incremental Bisimulation Algorithm

      • Diptikalyan Saha
      Pages 204-215

    14. Communication Lower Bounds Via the Chromatic Number

      • Ravi Kumar, D. Sivakumar
      Pages 228-240
Back to top

Other Volumes

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

Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation