Optimal Algorithms
International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings
Editors: Djidjev, Hristo (Ed.)
Free PreviewBuy this book
- About this book
-
This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and complexity of algorithms. Some of the invited papers include surveys of results in particular fields and some report original research, while all the contributed papers report original research. Most of the algorithms given are for parallel models of computation. The papers were presented at the Second International Symposium on Optimal Algorithms held in Varna, Bulgaria, in May/June 1989. The volume will be useful to researchers and students in theoretical computer science, especially in parallel computing.
- Table of contents (22 chapters)
-
-
Randomization in parallel algorithms and its impact on computational geometry
Pages 1-8
-
There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees
Pages 9-13
-
Computing digitized voronoi diagrams on a systolic screen and applications to clustering
Pages 14-24
-
PRAM algorithms for identifying polygon similarity
Pages 25-32
-
A framework for parallel graph algorithm design
Pages 33-40
-
Table of contents (22 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Optimal Algorithms
- Book Subtitle
- International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings
- Editors
-
- Hristo Djidjev
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 401
- Copyright
- 1989
- Publisher
- Springer-Verlag Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- eBook ISBN
- 978-3-540-46831-8
- DOI
- 10.1007/3-540-51859-2
- Softcover ISBN
- 978-3-540-51859-4
- Series ISSN
- 0302-9743
- Edition Number
- 1
- Number of Pages
- VIII, 312
- Topics
