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… Altro …
BarnesandNoble.com new in stock. Costi di spedizione:zzgl. Versandkosten., Costi di spedizione aggiuntivi 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… Altro …
Springer.com Nr. 978-3-540-51859-4. Costi di spedizione:Worldwide free shipping, , DE. (EUR 0.00) Details... |
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - edizione con copertina flessibile
1989, ISBN: 3540518592
[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … Altro …
ZVAB.com Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Costi di spedizione: EUR 3.00 Details... |
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - edizione con copertina flessibile
1989, ISBN: 3540518592
[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… Altro …
AbeBooks.de Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Costi di spedizione: 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 … Altro …
Hugendubel.de Costi di spedizione: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 - nuovo libro
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… Altro …
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… Altro …
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - edizione con copertina flessibile
1989
ISBN: 3540518592
[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … Altro …
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - edizione con copertina flessibile
1989, ISBN: 3540518592
[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… Altro …
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 … Altro …
Dati bibliografici del miglior libro corrispondente
Autore: | |
Titolo: | |
ISBN: |
Informazioni dettagliate del libro - Optimal Algorithms: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings Hristo Djidjev Editor
EAN (ISBN-13): 9783540518594
ISBN (ISBN-10): 3540518592
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 1989
Editore: Springer Berlin Heidelberg Core >1 >T
308 Pagine
Peso: 0,485 kg
Libro nella banca dati dal 2007-03-21T06:14:01+01:00 (Rome)
Pagina di dettaglio ultima modifica in 2024-03-12T12:52:06+01:00 (Rome)
ISBN/EAN: 3540518592
ISBN - Stili di scrittura alternativi:
3-540-51859-2, 978-3-540-51859-4
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : dji, hristo
Titolo del libro: optimal, 1989 band, algorithms, varna, lecture notes computer science, bulgaria, ufo symposium, tau 1989, international proceedings
Dati dell'editore
Autore: Hristo Djidjev
Titolo: Lecture Notes in Computer Science; Optimal Algorithms - International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings
Editore: Springer; Springer Berlin
312 Pagine
Anno di pubblicazione: 1989-11-08
Berlin; Heidelberg; DE
Lingua: Inglese
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.Altri libri che potrebbero essere simili a questo:
Ultimo libro simile:
9783540468318 Optimal Algorithms (Hristo Djidjev)
< Per archiviare...