ISBN: 9783540518594
This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and co… Plus…
BarnesandNoble.com new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise Details... |
ISBN: 9783540518594
This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and co… Plus…
Springer.com Nr. 978-3-540-51859-4. Frais d'envoiWorldwide free shipping, , DE. (EUR 0.00) Details... |
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Livres de poche
1989, ISBN: 3540518592
[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … Plus…
ZVAB.com Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Frais d'envoi EUR 3.00 Details... |
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Livres de poche
1989, ISBN: 3540518592
[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… Plus…
AbeBooks.de Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Frais d'envoi EUR 3.00 Details... |
ISBN: 9783540518594
*Optimal Algorithms* - International Symposium. Varna Bulgaria May 29-June 2 1989. Proceedings. Auflage 1989 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Wissenschaft, Mathematik … Plus…
Hugendubel.de Frais d'envoiShipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
Optimal Algorithms: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings Hristo Djidjev Editor - nouveau livre
ISBN: 9783540518594
This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and co… Plus…
ISBN: 9783540518594
This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and co… Plus…
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Livres de poche
1989
ISBN: 3540518592
[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … Plus…
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Livres de poche
1989, ISBN: 3540518592
[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… Plus…
ISBN: 9783540518594
*Optimal Algorithms* - International Symposium. Varna Bulgaria May 29-June 2 1989. Proceedings. Auflage 1989 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Wissenschaft, Mathematik … Plus…
Données bibliographiques du meilleur livre correspondant
Auteur: | |
Titre: | |
ISBN: |
Informations détaillées sur le livre - Optimal Algorithms: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings Hristo Djidjev Editor
EAN (ISBN-13): 9783540518594
ISBN (ISBN-10): 3540518592
Version reliée
Livre de poche
Date de parution: 1989
Editeur: Springer Berlin Heidelberg Core >1 >T
308 Pages
Poids: 0,485 kg
Livre dans la base de données depuis 2007-03-21T06:14:01+01:00 (Zurich)
Page de détail modifiée en dernier sur 2024-03-12T12:52:06+01:00 (Zurich)
ISBN/EAN: 9783540518594
ISBN - Autres types d'écriture:
3-540-51859-2, 978-3-540-51859-4
Autres types d'écriture et termes associés:
Auteur du livre: dji, hristo
Titre du livre: optimal, 1989 band, algorithms, varna, lecture notes computer science, bulgaria, ufo symposium, tau 1989, international proceedings
Données de l'éditeur
Auteur: Hristo Djidjev
Titre: Lecture Notes in Computer Science; Optimal Algorithms - International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings
Editeur: Springer; Springer Berlin
312 Pages
Date de parution: 1989-11-08
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 312 p.
BC; Hardcover, Softcover / Mathematik; Mathematik; Verstehen; Equivalence; Finite; Geometrische Algorithmen; Graphenalgorithmen; Komplexität von Algorithmen; Parallele Algrithmen; Probabilistisches Rechnen; algorithm; algorithms; automata; complexity; data structure; geometry; optimization; algorithm analysis and problem complexity; data structures; Mathematics; Algorithms; Theory of Computation; Data Science; Algorithmen und Datenstrukturen; Theoretische Informatik; Datenbanken; EA
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.Autres livres qui pourraient ressembler au livre recherché:
Dernier livre similaire:
9783540468318 Optimal Algorithms (Hristo Djidjev)
< pour archiver...