- 5 resultados
menor preço: € 4.70, preço mais alto: € 54.99, preço médio: € 34.27
1
Optimal Algorithms: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings Hristo Djidjev Editor
Encomendar
no/na BarnesandNoble.com
€ 54.99
Encomendar
Detalhes e envio
Link patrocinado

Optimal Algorithms: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings Hristo Djidjev Editor - nuovo livro

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… mais…

new in stock. Custos de envio:zzgl. Versandkosten., mais custos de envio
fechar(X)
2
Optimal Algorithms
Encomendar
no/na Springer.com
€ 53.49
Envio: € 0.001
Encomendar
Detalhes fornecedor
Link patrocinado
Optimal Algorithms - nuovo livro

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… mais…

Nr. 978-3-540-51859-4. Custos de envio:Worldwide free shipping, , DE. (EUR 0.00)
fechar(X)
3
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Djidjev, Hristo,
Encomendar
no/na ZVAB.com
€ 4.70
Envio: € 3.001
Encomendar
Detalhes fornecedor
Link patrocinado
Djidjev, Hristo,:
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Livro de bolso

1989

ISBN: 3540518592

[EAN: 9783540518594], [SC: 3.0], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE … mais…

Custos de envio: EUR 3.00 Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)]
fechar(X)
4
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Djidjev, Hristo,
Encomendar
no/na AbeBooks.de
€ 4.70
Envio: € 3.001
Encomendar
Detalhes fornecedor
Link patrocinado
Djidjev, Hristo,:
Optimal Algorithms International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings - Livro de bolso

1989, ISBN: 3540518592

[EAN: 9783540518594], [PU: Springer Berlin], GRAPHENALGORITHMEN,AUTOMATA,FINITE,GEOMETRY,OPTIMIZATION,KOMPLEXITÄT VON ALGORITHMEN,COMPLEXITY,GEOMETRISCHE ALGORITHMEN,PARALLELE ALGRITHMEN,… mais…

Custos de envio: EUR 3.00 Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)]
fechar(X)
5
Optimal Algorithms - Hristo Djidjev
Encomendar
no/na Hugendubel.de
€ 53.49
Envio: € 0.001
Encomendar
Detalhes fornecedor
Link patrocinado
Hristo Djidjev:
Optimal Algorithms - Livro de bolso

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 … mais…

Custos de envio:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
fechar(X)
1Como algumas plataformas não transmitem condições de envio e estas podem depender do país de entrega, do preço de compra, do peso e tamanho do item, de uma possível adesão à plataforma, de uma entrega direta pela plataforma ou através de um fornecedor terceirizado (Marketplace), etc., é possível que os custos de envio indicados pela terralivro não correspondam aos da plataforma ofertante.

Dados bibliográficos do melhor livro correspondente

Pormenores referentes ao livro
Optimal Algorithms: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings Hristo Djidjev Editor
Autor:
Título:
Número 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 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.

Dados detalhados do livro - Optimal Algorithms: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings Hristo Djidjev Editor


EAN (ISBN-13): 9783540518594
ISBN (ISBN-10): 3540518592
Livro de capa dura
Livro de bolso
Ano de publicação: 1989
Editor/Editora: Springer Berlin Heidelberg Core >1 >T
308 Páginas
Peso: 0,485 kg

Livro na base de dados desde 2007-03-21T02:14:01-03:00 (Sao Paulo)
Página de detalhes modificada pela última vez em 2024-03-12T08:52:06-03:00 (Sao Paulo)
Número ISBN/EAN: 9783540518594

Número ISBN - Ortografia alternativa:
3-540-51859-2, 978-3-540-51859-4
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: dji, hristo
Título do livro: optimal, 1989 band, algorithms, varna, lecture notes computer science, bulgaria, ufo symposium, tau 1989, international proceedings

Dados da editora

Autor: Hristo Djidjev
Título: Lecture Notes in Computer Science; Optimal Algorithms - International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings
Editora: Springer; Springer Berlin
312 Páginas
Ano de publicação: 1989-11-08
Berlin; Heidelberg; DE
Língua: 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.

Outros livros adicionais, que poderiam ser muito similares com este livro:

Último livro semelhante:
9783540468318 Optimal Algorithms (Hristo Djidjev)

< Para arquivar...