Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Foundations of Software Technology and Theoretical Computer Science

18th Conference, Chennai, India, December 17-19, 1998, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Vikraman Arvind

    1. The Institute of Mathematical Sciences, Chennai, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sundar Ramanujam

    1. National Institute of Advanced Studies, Indian Institute of Science Campus, Bangalore, 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 1530)

Included in the following conference series:

Conference proceedings info: FSTTCS 1998.

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

Access this book

Log in via an institution
eBook USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (34 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talk 1

    1. Descriptive Complexity and Model Checking

      • Neil Immerman
      Pages 1-4

  3. Session 1(a)

    1. Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem

      • Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
      Pages 6-17

    2. A Hamiltonian Approach to the Assignment of Non-reusable Frequencies

      • Dimitris A. Fotakis, Paul G. Spirakis
      Pages 18-29

  4. Session 1(b)

    1. Deadlock Sensitive Types for Lambda Calculus with Resources

      • Carolina Lavatelli
      Pages 30-41

    2. On encoding pπ in mπ

      • Paola Quaglia, David Walker
      Pages 42-53

  6. Session 2(b)

    1. A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems

      • Jean-Pierre Talpin, David Nowak
      Pages 78-89

    2. Testing Theories for Asynchronous Languages

      • Ilaria Castellani, Matthew Hennessy
      Pages 90-101

  8. Session 3

    1. Optimal Regular Tree Pattern Matching Using Pushdown Automata

      • Maya Madhavan, Priti Shankar
      Pages 122-133

    2. Locating Matches of Tree Patterns in Forests

      • Andreas Neumann, Helmut Seidl
      Pages 134-145

  9. Session 4

    1. Benefits of Tree Transducers for Optimizing Functional Programs

      • Armin Kühnemann
      Pages 146-157

    2. Implementable Failure Detectors in Asynchronous Systems

      • Vijay K. Garg, J. Roger Mitchell
      Pages 158-169

  10. Invited Talk 3

    1. BRICS and Quantum Information Processing

      • Erik Meineche Schmidt
      Pages 170-173

  11. Session 5(a)

    1. Martingales and Locality in Distributed Computing

      • Devdatt P. Dubhashi
      Pages 174-185

    2. Space Efficient Suffix Trees

      • Ian Munro, Venkatesh Raman, S. Srinivasa Rao
      Pages 186-196

  12. Session 5(b)

    1. Formal Verification of an O.S. Submodule

      • N. S. Pendharkar, K. Gopinath
      Pages 197-208

    2. Infinite Probabilistic and Nonprobabilistic Testing

      • K. Narayan Kumar, Rance Cleaveland, Scott A. Smolka
      Pages 209-220
Back to top

Other volumes

  1. Foundations of Software Technology and Theoretical Computer Science

Keywords

Editors and Affiliations

  • The Institute of Mathematical Sciences, Chennai, India

    Vikraman Arvind

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

    Sundar Ramanujam

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation