Optimal algorithms : international symposium, Varna, Bulgaria, May 29 June 2, 1989 : proceedings
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 repor...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
401 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Optimal algorithms, international symposium, Varna, Bulgaria, May/June 1989, proceedings, H. Djidjev, ed, Berlin, Springer-Verlag, 1989, 1 vol. (VI-308 p.), Lecture notes in computer science, 0-387-51859-2 • Optimal Algorithms, Texte imprimé, 9783662193341 |
Indholdsfortegnelse:
- Randomization in parallel algorithms and its impact on computational geometry
- There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees
- Computing digitized voronoi diagrams on a systolic screen and applications to clustering
- PRAM algorithms for identifying polygon similarity
- A framework for parallel graph algorithm design
- Fast soliton automata
- An upper bound on the order of locally testable deterministic finite automata
- A fast algorithm to decide on simple grammars equivalence
- Complexity of the parallel Givens factorization on shared memory architectures
- Optimal bounds on the dictionary problem
- Optimal constant space move-to-fear list organization
- Improved bounds on the size of separators of toroidal graphs
- On some properties of (a,b)-trees
- Disassembling two-dimensional composite parts via translations
- Which triangulations approximate the complete graph?
- The approximability of problems complete for P
- A structural overview of NP optimization problems
- Sorting within distance bound on a mesh-connected processor array
- Local insertion sort revisited
- Packet routing on grids of processors
- Optimal parallel computations for halin graphs
- Optimal parallel algorithms for b-matchings in trees.