Skip to main content
SpringerLink
Log in

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science

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

  • Conference proceedings
  • © 2007

Access provided by Autonomous University of Puebla

Download book PDF

Overview

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)

Included in the following conference series:

Conference proceedings info: FSTTCS 2007.

Buy print copy

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

Keywords

Table of contents (45 papers)

  1. Front Matter

    Download chapter PDF

  3. Contributed Papers

    1. The Priority k-Median Problem

      • Amit Kumar, Yogish Sabharwal
      Pages 71-83
      Download chapter PDF

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

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

    3. Order Scheduling Models: Hardness and Algorithms

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

    4. On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography

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

    5. Key Substitution in the Symbolic Analysis of Cryptographic Protocols

      • Yannick Chevalier, Mounira Kourjieh
      Pages 121-132
      Download chapter PDF

    6. Symbolic Bisimulation for the Applied Pi Calculus

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

    7. Non-mitotic Sets

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

    8. Reductions to Graph Isomorphism

      • Jacobo Torán
      Pages 158-167
      Download chapter PDF

    9. Strong Reductions and Isomorphism of Complete Sets

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

    10. Probabilistic and Topological Semantics for Timed Automata

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

    11. A Theory for Game Theories

      • Michel Hirschowitz, André Hirschowitz, Tom Hirschowitz
      Pages 192-203
      Download chapter PDF

    12. An Incremental Bisimulation Algorithm

      • Diptikalyan Saha
      Pages 204-215
      Download chapter PDF

    13. Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs

      • Andreas Jakoby, Till Tantau
      Pages 216-227
      Download chapter PDF

    14. Communication Lower Bounds Via the Chromatic Number

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

Other volumes

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

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation