Skip to main content
SpringerLink
Log in

Optimal Algorithms

International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. Hristo Djidjev
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 401)

Included in the following conference series:

Conference proceedings info: OA 1989.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (22 papers)

  1. Front Matter

    Download chapter PDF

  2. Randomization in parallel algorithms and its impact on computational geometry

    • John H. Reif, Sandeep Sen
    Pages 1-8

  3. There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees

    • Christos Levcopoulos, Andrzej Lingas
    Pages 9-13

  4. Computing digitized voronoi diagrams on a systolic screen and applications to clustering

    • Frank Dehne
    Pages 14-24

  5. PRAM algorithms for identifying polygon similarity

    • Costas S. Iliopoulos, W. F. Smyth
    Pages 25-32

  6. A framework for parallel graph algorithm design

    • Vijaya Ramachandran
    Pages 33-40

  7. Fast soliton automata

    • T. S. Papatheodorou, N. B. Tsantanis
    Pages 41-47

  8. An upper bound on the order of locally testable deterministic finite automata

    • Sam Kim, Robert McNaughton, Robert McCloskey
    Pages 48-65

  9. A fast algorithm to decide on simple grammars equivalence

    • Didier Caucal
    Pages 66-85

  10. Complexity of the parallel Givens factorization on shared memory architectures

    • Michel Cosnard, Mostafa El Daoudi, Yves Robert
    Pages 86-105

  11. Optimal bounds on the dictionary problem

    • Arne Andersson
    Pages 106-114

  12. Optimal constant space move-to-fear list organization

    • B. John Oommen, David T. H. Ng
    Pages 115-125

  13. Improved bounds on the size of separators of toroidal graphs

    • L. G. Aleksandrov, H. N. Djidjev
    Pages 126-138

  14. On some properties of (a,b)-trees

    • Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani
    Pages 139-152

  15. Disassembling two-dimensional composite parts via translations

    • Doron Nussbaum, Jörg-R. Sack
    Pages 153-167

  16. Which triangulations approximate the complete graph?

    • Gautam Das, Deborah Joseph
    Pages 168-192

  17. The approximability of problems complete for P

    • Maria Serna, Paul Spirakis
    Pages 193-204

  18. A structural overview of NP optimization problems

    • Danilo Bruschi, Deborah Joseph, Paul Young
    Pages 205-231

  19. Sorting within distance bound on a mesh-connected processor array

    • Bogdan S. Chlebus
    Pages 232-238

  20. Local insertion sort revisited

    • Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    Pages 239-253
Back to top

Other volumes

  1. Optimal Algorithms

Keywords

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation