Advertisement

Table of contents

  1. Front Matter
  2. Christos H. Papadimitriou
    Pages 1-1
  3. D. T. Lee, Majid Sarrafzadeh
    Pages 2-11
  4. Yaw-Ling Lin, Steven S. Skiena
    Pages 12-21
  5. Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
    Pages 22-31
  6. Arvind Raghunathan, Huzur Saran
    Pages 32-41
  7. Shin-ichi Nakano, Takao Nishizeki
    Pages 43-51
  8. Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
    Pages 61-71
  9. Frank Wagner, Barbara Wolfers
    Pages 72-82
  10. Dorothea Wagner
    Pages 83-93
  11. Tetsuo Asano, Takeshi Tokuyama
    Pages 94-103
  12. E. Boros, P. L. Hammer, T. Ibaraki, K. Kawakami
    Pages 104-115
  13. Kwong-fai Chan, Tak Wah Lam
    Pages 127-136
  14. Herbert Edelsbrunner
    Pages 150-150
  15. Leonidas J. Guibas, John E. Hershberger, Joseph S. B. Mitchell, Jack Scott Snoeyink
    Pages 151-162
  16. Xue-Hou Tan, Tomio Hirata, Yasuyoshi Inagaki
    Pages 163-175
  17. A. Benkouar, Y. G. Manoussakis, V. Th. Paschos, R. Saad
    Pages 190-198
  18. Takao Asano
    Pages 199-207
  19. Wojciech Szpankowski
    Pages 208-217
  20. Susumu Hasegawa, Hiroshi Imai, Koji Hakata
    Pages 219-228
  21. M. Y. Chan, F. Y. L. Chin, C. K. Poon
    Pages 241-250
  22. Alistair Moffat, Ola Petersson
    Pages 263-272
  23. Arne Andersson, Tony W. Lai
    Pages 273-282
  24. Frances Yao
    Pages 283-283
  25. Vladimir Estivill-Castro, Murray Sherk
    Pages 284-293
  26. Luc Longpré, Sarah Mocas
    Pages 308-315
  27. Lih-Hsing Hsu, J. Y. Hwang, T. Y. Ho, C. H. Tsai
    Pages 316-325
  28. Tsan-sheng Hsu, Vijaya Ramachandran
    Pages 326-335
  29. Michael Kaufmann, Gerhard Klär
    Pages 336-348
  30. Hans-Peter Lenhof, Michiel Smid
    Pages 349-363
  31. Ip-Wang Chan, Donald K. Friesen
    Pages 375-384
  32. Krzysztof Diks, Oscar Garrido, Andrzej Lingas
    Pages 385-395
  33. Back Matter

About these proceedings

Introduction

This volume presents the proceedings of the Second Annual International Symposium on Algorithms held at Academia Sinica, Taipei, Republic of China, December 16-18, 1991. The symposium was organized by the Institute of Information Science, Academia Sinica, and the National Tsing Hua University. In response to the program committee's call for papers, 90 papers were submitted, from which the committee selected 36 for presentation at the symposium. In addition to these contributed papers, the symposium included 5 invited talks. The subjects of the papers range widely in the area of discrete algorithms, over such topics as computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing and computational algebra.

Keywords

Complexity Theory Computational Geometry Distributed Computing Graph Algorithms Graph-Algorithmen Komplexitätstheorie Matchings Parallel Algorithms Parallele Algorithmen Partition Verteiltes Rechnen algorithms complexity geometry statistics

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-54945-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 1991
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-54945-1
  • Online ISBN 978-3-540-46600-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications