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...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
401 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
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 |
| LEADER | 04424nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 943876 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155167081 | ||
| 020 | |a 9783540468318 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 511.4 | ||
| 111 | 2 | |a International symposium on optimal algorithms |n (2 |d :1989 |c :Varna, Bulgarie). | |
| 245 | 1 | 0 | |a Optimal algorithms : |b international symposium, Varna, Bulgaria, May 29 June 2, 1989 : proceedings |c [edited by] H. Djidjev. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 401 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Optimisation mathématique | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Approximation, Théorie de l' | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Djidjev, Hristo, |d 19..- |4 pbd | |
| 776 | 0 | |0 021311668 |t Optimal algorithms |o international symposium, Varna, Bulgaria, May/June 1989 |o proceedings |f H. Djidjev, ed |c Berlin |n Springer-Verlag |d 1989 |p 1 vol. (VI-308 p.) |s Lecture notes in computer science |z 0-387-51859-2 | |
| 776 | 0 | |t Optimal Algorithms |b Texte imprimé |z 9783662193341 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-51859-2 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-HJ0QGF5B-B |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747924899 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-51859-2 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750937033 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-51859-2 |z Accès INSA CVL | |
| 997 | |0 943876 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||