Table of contents

  1. Front Matter
  2. Mark de Berg, Leonidas Guibas, Dan Halperin, Mark Overmars, Otfried Schwarzkopf, Micha Sharir et al.
    Pages 1-10
  3. Gautam Das, Paul J. Heffernan
    Pages 11-20
  4. Katrin Dobrindt, Mariette Yvinec
    Pages 21-30
  5. Martin Furer, C. R. Subramanian, C. E. Veni Madhavan
    Pages 31-37
  6. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh
    Pages 48-57
  7. Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
    Pages 58-67
  8. Anders Dessmark, Klaus Jansen, Andrzej Lingas
    Pages 88-97
  9. Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
    Pages 98-107
  10. T. Kloks
    Pages 108-117
  11. C. M. Khoong, H. W. Leong
    Pages 128-137
  12. Sabine R. öhring, Sajal K. Das
    Pages 147-156
  13. J. C. Cogolludo, S. Rajasekaran
    Pages 157-166
  14. Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang
    Pages 167-175
  15. Anand Srivastav, Peter Stangier
    Pages 176-184

About these proceedings


This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include: - automata, languages, and computability, - combinatorial, graph, geometric, and randomized algorithms, - networks and distributed algorithms, - VLSIand parallel algorithms, - theory of learning and robotics, - number theory and robotics. Three invited papers are also included.


AAC Algorithms Automat DOM algorithm automata complexity computability robot robotics

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-57568-9
  • Online ISBN 978-3-540-48233-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book