Table of contents

  1. Front Matter
  2. Mike Paterson, Shlomit Tassa, Uri Zwick
    Pages 1-10
  3. Sanjay Jain
    Pages 11-21
  4. Pallab Dasgupta, P. P. Chakrabarti, S. C. DeSarkar
    Pages 22-36
  5. Abhik Roychoudhury, Susmita Sur-Kolay
    Pages 37-51
  6. Luigi Petrone
    Pages 111-123
  7. Jacques Garrigue
    Pages 151-165
  8. Alexander I. Tomlinson, Vijay K. Garg
    Pages 195-209
  9. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitris M. Thilikos
    Pages 210-224
  10. Deepak Kapur, G. Sivakumar
    Pages 225-239
  11. S. Ravikumar, D. Sivakumar
    Pages 248-262
  12. Mogens Nielsen, Allan Cheng
    Pages 263-278
  13. Paul Caspi, Jean -Claude Fernandez, Alain Girault
    Pages 279-293
  14. Michele Boreale, Luca Trevisan
    Pages 294-308
  15. Ashvin Dsouza, Bard Bloom
    Pages 309-323
  16. Martin Odersky
    Pages 324-337
  17. R. Balasubramanian, Venkatesh Raman
    Pages 338-348
  18. S. Rao Kosaraju
    Pages 349-362
  19. Srinivasa R. Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
    Pages 363-376
  20. Sandip K. Biswas, Sampath Kannan
    Pages 377-390
  21. Herbert Edelsbrunner
    Pages 391-412
  22. Christos Levcopoulos, Andrzej Lingas, Cao Wang
    Pages 413-427
  23. Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel Smid, Christian Thiel
    Pages 428-442
  24. Nils Klarlund, Madhavan Mukund, Milind Sohoni
    Pages 456-470
  25. I. A. Browne, Z. Manna, H. B. Sipma
    Pages 484-498
  26. Andrea Bianco, Luca de Alfaro
    Pages 499-513
  27. Back Matter

About these proceedings


This book constitutes the refereed proceedings of the 15th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS '95, held in Bangalore, India in December 1995.
The volume presents 31 full revised research papers selected from a total of 106 submissions together with full papers of four invited talks. Among the topics covered are algorithms, software technology, functional programming theory, distributed algorithms, term rewriting and constraint logic programming, complexity theory, process algebras, computational geometry, and temporal logics and verification theory.


algorithm algorithms complexity complexity theory computational geometry computer computer science logic programming term rewriting verification

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60692-5
  • Online ISBN 978-3-540-49263-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
IT & Software
Consumer Packaged Goods