Skip to main content
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. Session 6(a)

    1. On Generating Strong Elimination Orderings of Strongly Chordal Graphs

      • N. Kalyana Rama Prasad, P. Sreenivasa Kumar
      Pages 221-232

    2. A Parallel Approximation Algorithm for Minimum Weight Triangulation

      • Joachim Gudmundsson, Christos Levcopoulos
      Pages 233-244

  2. Session 6(b)

    1. The Power of Reachability Testing for Timed Automata

      • Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim G. Larsen
      Pages 245-256

    2. Recursive Mean-Value Calculus

      • Paritosh K. Pandya, Y. S. Ramakrishna
      Pages 257-268

  3. Invited Talk 4

    1. Efficient Formal Verification of Hierarchical Descriptions

      • Rajeev Alur
      Pages 269-269

  4. Invited Talk 5

    1. Proof Rules for Model Checking Systems with Data

      • K. L. McMillan
      Pages 270-270

  5. Session 7

    1. Partial Order Reductions for Bisimulation Checking

      • Michaela Huhn, Peter Niebert, Heike Wehrheim
      Pages 271-282

    2. First-Order-CTL Model Checking

      • Jürgen Bohn, Werner Damm, Orna Grumberg, Hardi Hungar, Karen Laster
      Pages 283-294

  6. Session 8(a)

    1. On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms

      • Antoni Lozano, Vijay Raghavan
      Pages 295-306

    2. Remarks on Graph Complexity

      • Satyanarayana V. Lokam
      Pages 307-318

  7. Session 8(b)

    1. On the Confluence of Trace Rewriting Systems

      • Markus Lohrey
      Pages 319-330

    2. A String-Rewriting Characterization of Muller and Schupp’s Context-Free Graphs

      • Hugues Calbrix, Teodor Knapik
      Pages 331-342

  8. Session 9

    1. Different Types of Monotonicity for Restarting Automata

      • Petr Jančar, František Mráz, Martin Plátek, Jörg Vogel
      Pages 343-354

    2. A Kleene Iteration for Parallelism

      • Kamal Lodaya, Pascal Weil
      Pages 355-366

  9. Invited Talk 6

    1. Quantum Computation and Information

      • Umesh Vazirani
      Pages 367-367

  10. Back Matter

    Download chapter PDF
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