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… Más…
BarnesandNoble.com new in stock. Gastos de envío:zzgl. Versandkosten., más gastos de envío 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… Más…
Springer.com Nr. 978-3-540-51859-4. Gastos de envío:Worldwide free shipping, , DE. (EUR 0.00) Details... |
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Pasta blanda
1989, ISBN: 3540518592
[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … Más…
ZVAB.com Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Gastos de envío: EUR 3.00 Details... |
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Pasta blanda
1989, ISBN: 3540518592
[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… Más…
AbeBooks.de Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Gastos de envío: 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 … Más…
Hugendubel.de Gastos de envío: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 - libro nuevo
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… Más…
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… Más…
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Pasta blanda
1989
ISBN: 3540518592
[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … Más…
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Pasta blanda
1989, ISBN: 3540518592
[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… Más…
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 … Más…
Datos bibliográficos del mejor libro coincidente
Autor: | |
Título: | |
ISBN: |
Detalles 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
Tapa dura
Tapa blanda
Año de publicación: 1989
Editorial: Springer Berlin Heidelberg Core >1 >T
308 Páginas
Peso: 0,485 kg
Libro en la base de datos desde 2007-03-21T06:14:01+01:00 (Madrid)
Página de detalles modificada por última vez el 2024-03-12T12:52:06+01:00 (Madrid)
ISBN/EAN: 9783540518594
ISBN - escritura alterna:
3-540-51859-2, 978-3-540-51859-4
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: dji, hristo
Título del libro: optimal, 1989 band, algorithms, varna, lecture notes computer science, bulgaria, ufo symposium, tau 1989, international proceedings
Datos del la editorial
Autor: Hristo Djidjev
Título: Lecture Notes in Computer Science; Optimal Algorithms - International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings
Editorial: Springer; Springer Berlin
312 Páginas
Año de publicación: 1989-11-08
Berlin; Heidelberg; DE
Idioma: Inglés
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.Más, otros libros, que pueden ser muy parecidos a este:
Último libro similar:
9783540468318 Optimal Algorithms (Hristo Djidjev)
< para archivar...