Skip to main content
SpringerLink
Log in

Foundations of Software Technology and Theoretical Computer Science

12th Conference, New Delhi, India, December 18-20, 1992. Proceedings

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Rudrapatna Shyamasundar
    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 652)

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (31 papers)

  1. Fast sequential and randomised parallel algorithms for rigidity and approximate min k-cut

    • Sachin Patkar, H. Narayanan
    Pages 265-278

  2. Approximation through local optimality: Designing networks with small degree

    • R. Ravi, B. Raghavachari, P. Klein
    Pages 279-290

  3. Games and full Completeness for multiplicative Linear Logic

    • Samson Abramsky, Radha Jagadeesan
    Pages 291-301

  4. Real-time calculi and expansion theorems

    • Jens Chr. Godskesen, Kim G. Larsen
    Pages 302-315

  5. Branching bisimulation for context-free processes

    • Didier Caucal
    Pages 316-327

  6. CCS, locations and asynchronous transition systems

    • Madhavan Mukund, Mogens Nielsen
    Pages 328-341

  7. Reasoning about safety and liveness properties for probabilistic processes

    • Linda Christoff, Ivan Christoff
    Pages 342-355

  8. String matching under a general matching relation

    • S. Muthukrishnan, H. Ramesh
    Pages 356-367

  9. On the complexity of Certified Write All Algorithms

    • Charles Martel, Ramesh Subramonian
    Pages 368-379

  10. Selection from read-only memory and sorting with optimum data movement

    • J. Ian Munro, Venkatesh Raman
    Pages 380-391

  11. Some observations on 2-way probabilistic finite automata

    • B. Ravikumar
    Pages 392-403

  12. Recent developments in algorithms for the maximum-flow problem

    • Kurt Mehlhorn
    Pages 404-404

  13. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

For more than a decade, Foundations of Software Technology and Theoretical Computer Science Conferences have been providing an annual academic computerscience forum for the presentation of new results in the topics of current research in India and abroad. This year, there was a total of 125 papers from 14 countries. Each paper was reviewed by at least three reviewers; based on these reviews, the programme committee selected 28 papers at a meeting held in July 1992 at the Tata Institute of Fundamental Research, Bombay. The selected papers are included in this volume, together with three invited papers: "Games and full completeness for multiplicative linear logic" by S. Abramsky, "Recent developments inalgorithms for the maximum-flow problem" by K. Melhorn, and "System specification and refinement in temporal logic" by A. Pnueli.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation