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

FST TCS 2000: Foundations of Software Technology and Theoretical Science

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

Editors:

  1. Sanjiv Kapoor

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sanjiva Prasad

    1. Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, New Delhi, 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 1974)

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

  1. Front Matter

    Pages I-XIII
    PDF

  2. Invited Presentations

    1. Model Checking: Theory into Practice

      • E. Allen Emerson
      Pages 1-10

    2. An Algebra for XML Query

      • Mary Fernandez, Jerome Simeon, Philip Wadler
      Pages 11-45

    4. Rewriting Logic as a Metalogical Framework

      • David Basin, Manuel Clavel, José Meseguer
      Pages 55-80

    5. Frequency Assignment in Mobile Phone Systems

      • Martin Grötschel
      Pages 81-86

    6. Data Provenance: Some Basic Issues

      • Peter Buneman, Sanjeev Khanna, Wang-Chiew Tan
      Pages 87-93

  3. Contributions

    2. On-Line Edge-Coloring with a Fixed Number of Colors

      • Lene Monrad Favrholdt, Morten Nyhave Nielsen
      Pages 106-116

    4. Model Checking CTL Properties of Pushdown Systems

      • Igor Walukiewicz
      Pages 127-138

    5. A Decidable Dense Branching-Time Temporal Logic

      • Salvatore La Torre, Margherita Napoli
      Pages 139-150

    6. Fair Equivalence Relations

      • Orna Kupferman, Nir Piterman, Moshe Y. Vardi
      Pages 151-163

    7. Arithmetic Circuits and Polynomial Replacement Systems

      • Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
      Pages 164-175

    8. Depth-3 Arithmetic Circuits for S su2inn (X) and Extensions of the Graham-Pollack Theorem

      • Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
      Pages 176-187

    10. Combining Semantics with Non-standard Interpreter Hierarchies

      • Sergei Abramov, Robert Glück
      Pages 201-213

    11. Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

      • Jan-Georg Smaus, François Fages, Pierre Deransart
      Pages 214-226

    12. Dynamically Ordered Probabilistic Choice Logic Programming

      • Marina De Vos, Dirk Vermeir
      Pages 227-239

    13. Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems

      • Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege
      Pages 240-251
Back to top

Keywords

Back to top

Editors and Affiliations

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

    Sanjiv Kapoor, Sanjiva Prasad

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