Table of contents

  1. Front Matter
  2. Grammati Pantziou, Paul Spirakis, Christos Zaroliagis
    Pages 20-29
  3. P. Sreenivasa Kumar, C. E. Veni Madhavan
    Pages 30-43
  4. A. Srinivasa Rao, C. Pandu Rangan
    Pages 44-55
  5. Phan Minh Dung, Kanchana Kanchanasut
    Pages 78-88
  6. Gadi Taubenfeld, Shumel Katz, Shlomo Moran
    Pages 109-120
  7. F. Bonomi, P. J. Fleming, P. Steinberg
    Pages 121-130
  8. Madhavan Mukund, P. S. Thiagarajan
    Pages 143-160
  9. Jeremy Gunawardena
    Pages 161-170
  10. Viktor N. Kasyanov
    Pages 171-180
  11. Hartmut Ehrig, Werner Fey, Horst Hansen, Michael Löwe, Dean Jacobs
    Pages 181-192
  12. Lane A. Hemachandra, Sanjay Jain
    Pages 193-203

About these proceedings

Introduction

The papers in this volume accepted for the conference on foundations of software technology and theoretical computer science project research results in - Algorithmics: design and analysis of graph, geometric, algebraic and VLSI algorithms; data structures; average analysis; complexity theory; parallel parsing. - Concurrency: algebraic semantics, event structures. - Logic programming: algebraic properties, semantics. - Software technology: program transformations, algebraic methods. These results together with the formal techniques employed to present them reflect current trends pursued by leading research groups around the world. The papers treat their topics in depth by carefully reviewing existing results, developing and demonstrating new techniques and suggesting further directions for research.

Keywords

algorithm algorithms complexity complexity theory data structure data structures logic programming semantics

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-52048-1
  • Copyright Information Springer-Verlag 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-52048-1
  • Online ISBN 978-3-540-46872-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book