Skip to main content
  • Conference proceedings
  • © 2000

FST TCS 2000: Foundations of Software Technology and Theoretical Science

20th Conference, New Delhi, India, December13-15, 2000 Proceedings

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

Buy it now

Buying options

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 (42 papers)

  1. Contributions

    1. Planar Graph Blocking for External Searching

      • Surender Baswana, Sandeep Sen
      Pages 252-263
    2. A Complete Axiomatisation for Timed Automata

      • Huimin Lin, Wang Yi
      Pages 277-289
    3. Text Sparsification via Local Maxima

      • Pilu Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
      Pages 290-301
    4. Approximate Swapped Matching

      • Amihood Amir, Moshe Lewenstein, Ely Porat
      Pages 302-311
    5. A Semantic Theory for Heterogeneous System Design

      • Rance Cleaveland, Gerald Lüttgen
      Pages 312-324
    6. Formal Verification of the Ricart-Agrawala Algorithm

      • Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ari
      Pages 325-335
    7. Θ in2 sup -Completeness: A Classical Approach for New Results

      • Holger Spakowski, Jörg Vogel
      Pages 348-360
    8. Is the Standard Proof System for SAT P-Optimal?

      • Johannes Köbler, Jochen Messner
      Pages 361-372
    9. A General Framework for Types in Graph Rewriting

      • Barbara König
      Pages 373-384
    10. The Ground Congruence for Chi Calculus

      • Yuxi Fu, Zhenrong Yang
      Pages 385-396
    11. Inheritance in the Join Calculus

      • Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy
      Pages 397-408
    12. Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints

      • Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti
      Pages 409-420
    13. Dynamic Spectrum Allocation: The Impotency of Duration Notification

      • Bala Kalyanasundaram, Kirk Pruhs
      Pages 421-428
    14. The Fine Structure of Game Lambda Models

      • Pietro Di Gianantonio, Gianluca Franco
      Pages 429-441
    15. Scheduling to Minimize the Average Completion Time of Dedicated Tasks

      • Foto Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon
      Pages 454-464
    16. Hunting for Functionally Analogous Genes

      • Michael T. Hallett, Jens Lagergren
      Pages 465-476
    17. Keeping Track of the Latest Gossip in Shared Memory Systems

      • Bharat Adsul, Aranyak Mehta, Milind Sohoni
      Pages 477-488

Editors and Affiliations

  • Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, New Delhi, India

    Sanjiv Kapoor, Sanjiva Prasad

Bibliographic Information

Buy it now

Buying options

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