Table of contents

  1. Front Matter
  2. David S. Rosenblum, Sriram Sankar, David C. Luckham
    Pages 10-35
  3. Sanjeev Kumar, V. M. Malhotra
    Pages 57-80
  4. J. -L. Lassez, K. Marriott
    Pages 96-107
  5. Vipin Kumar, Yow-Jian Lin
    Pages 108-123
  6. Y. V. Srinivas, Rajeev Sangal
    Pages 124-143
  7. Christos H. Papadimitriou
    Pages 144-153
  8. Jayaram Bhasker, Sartaj Sahni
    Pages 154-176
  9. Prakash Ramanan, Kazuhiro Tsuga
    Pages 177-192
  10. Ravi Kannan, László Lovász
    Pages 193-213
  11. V. S. Lakshmanan, C. E. Veni Madhavan
    Pages 214-238
  12. D. Beauquier
    Pages 239-251
  13. Joachim von zur Gathen
    Pages 252-262
  14. Ravi Kannan, Lyle A. McGeoch
    Pages 263-269
  15. S. R. Goregaokar, S. Arun-Kumar
    Pages 270-287
  16. Ajoy Kumar Datta, S. Ghosh
    Pages 288-318
  17. Inder S. Gopal, Parviz Kermani
    Pages 319-329

About these proceedings

Keywords

Approximation Ban Code Debugging Matching algorithms communication complexity logic theoretical computer science

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-17179-7
  • Copyright Information Springer-Verlag 1986
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-17179-9
  • Online ISBN 978-3-540-47239-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Pharma
Automotive
Chemical Manufacturing
Biotechnology
Electronics
Telecommunications
Energy, Utilities & Environment
Aerospace