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… Meer...
BarnesandNoble.com new in stock. Verzendingskosten:zzgl. Versandkosten., exclusief verzendingskosten 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… Meer...
Springer.com Nr. 978-3-540-51859-4. Verzendingskosten:Worldwide free shipping, , DE. (EUR 0.00) Details... |
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - pocketboek
1989, ISBN: 3540518592
[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … Meer...
ZVAB.com Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Verzendingskosten: EUR 3.00 Details... |
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - pocketboek
1989, ISBN: 3540518592
[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… Meer...
AbeBooks.de Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Verzendingskosten: 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 … Meer...
Hugendubel.de Verzendingskosten:Shipping 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 - nieuw boek
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… Meer...
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… Meer...
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - pocketboek
1989
ISBN: 3540518592
[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … Meer...
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - pocketboek
1989, ISBN: 3540518592
[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… Meer...
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 … Meer...
Bibliografische gegevens van het best passende boek
auteur: | |
Titel: | |
ISBN: |
Gedetalleerde informatie over het boek. - Optimal Algorithms: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings Hristo Djidjev Editor
EAN (ISBN-13): 9783540518594
ISBN (ISBN-10): 3540518592
Gebonden uitgave
pocket book
Verschijningsjaar: 1989
Uitgever: Springer Berlin Heidelberg Core >1 >T
308 Bladzijden
Gewicht: 0,485 kg
Boek bevindt zich in het datenbestand sinds 2007-03-21T06:14:01+01:00 (Amsterdam)
Detailpagina laatst gewijzigd op 2024-03-12T12:52:06+01:00 (Amsterdam)
ISBN/EAN: 9783540518594
ISBN - alternatieve schrijfwijzen:
3-540-51859-2, 978-3-540-51859-4
alternatieve schrijfwijzen en verwante zoekwoorden:
Auteur van het boek: dji, hristo
Titel van het boek: optimal, 1989 band, algorithms, varna, lecture notes computer science, bulgaria, ufo symposium, tau 1989, international proceedings
Gegevens van de uitgever
Auteur: Hristo Djidjev
Titel: Lecture Notes in Computer Science; Optimal Algorithms - International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings
Uitgeverij: Springer; Springer Berlin
312 Bladzijden
Verschijningsjaar: 1989-11-08
Berlin; Heidelberg; DE
Taal: Engels
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.Andere boeken die eventueel grote overeenkomsten met dit boek kunnen hebben:
Laatste soortgelijke boek:
9783540468318 Optimal Algorithms (Hristo Djidjev)
< naar Archief...