- 5 Resultados
precio mínimo: € 53,49, precio máximo: € 96,49, precio promedio: € 62,39
1
Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings Rolf Karlsson Editor
Pedir
por BarnesandNoble.com
€ 54,99
PedirEnlace patrocinado

Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings Rolf Karlsson Editor - libro nuevo

ISBN: 9783540614227

This book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996. The 35 full papers included in … Más…

new in stock. Gastos de envío:zzgl. Versandkosten., más gastos de envío
2
Algorithm Theory - SWAT '96
Pedir
por Springer.com
€ 53,49
Envío: € 0,001
PedirEnlace patrocinado

SWAT '96:

Algorithm Theory - libro nuevo

ISBN: 9783540614227

This book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996. The 35 full papers included in t… Más…

Nr. 978-3-540-61422-7. Gastos de envío:Worldwide free shipping, , DE. (EUR 0.00)
3
Algorithm Theory - SWAT '96 - Rolf Karlsson/ Andrzej Lingas
Pedir
por Hugendubel.de
€ 53,49
Envío: € 0,001
PedirEnlace patrocinado
Rolf Karlsson/ Andrzej Lingas:
Algorithm Theory - SWAT '96 - Pasta blanda

ISBN: 9783540614227

*Algorithm Theory - SWAT '96* - 5th Scandinavian Workshop on Algorithm Theory Reykjavik Iceland July 1996. Proceedings. Auflage 1996 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, W… Más…

Gastos de envío:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
4
Algorithm Theory - SWAT '96 - Rolf Karlsson/ Andrzej Lingas
Pedir
por Hugendubel.de
€ 96,49
Envío: € 0,001
PedirEnlace patrocinado
Rolf Karlsson/ Andrzej Lingas:
Algorithm Theory - SWAT '96 - Pasta blanda

ISBN: 9783540614227

Algorithm Theory - SWAT '96 ab 96.49 € als Taschenbuch: 5th Scandinavian Workshop on Algorithm Theory Reykjavik Iceland July 1996. Proceedings. Auflage 1996. Aus dem Bereich: Bücher, Wiss… Más…

Gastos de envío:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
5
Algorithm Theory - SWAT '96 - Rolf Karlsson; Andrzej Lingas
Pedir
por lehmanns.de
€ 53,49
Envío: € 0,001
PedirEnlace patrocinado
Rolf Karlsson; Andrzej Lingas:
Algorithm Theory - SWAT '96 - Primera edición

1996, ISBN: 9783540614227

Pasta blanda

5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1996

Gastos de envío:Versand in 10-14 Tagen. (EUR 0.00)

1Dado que algunas plataformas no nos comunican las condiciones de envío y éstas pueden depender del país de entrega, del precio de compra, del peso y tamaño del artículo, de una posible membresía a la plataforma, de una entrega directa por parte de la plataforma o a través de un tercero (Marketplace), etc., es posible que los gastos de envío indicados por eurolibro/terralibro no concuerden con los de la plataforma ofertante.

Datos bibliográficos del mejor libro coincidente

Detalles del libro
Algorithm Theory - SWAT '96

This book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996.The 35 full papers included in the book in revised version were carefully selected from a total of 95 submissions; also included are abstracts or full versions of three invited talks by prominent researchers. All in all, the collection of articles reports state-of-the-art results on various topics of current design and analysis of algorithms.

Detalles del libro - Algorithm Theory - SWAT '96


EAN (ISBN-13): 9783540614227
ISBN (ISBN-10): 3540614222
Tapa blanda
Año de publicación: 1996
Editorial: Springer Berlin
472 Páginas
Peso: 0,707 kg
Idioma: eng/Englisch

Libro en la base de datos desde 2007-06-09T04:09:29-05:00 (Mexico City)
Página de detalles modificada por última vez el 2024-03-05T22:59:42-06:00 (Mexico City)
ISBN/EAN: 3540614222

ISBN - escritura alterna:
3-540-61422-2, 978-3-540-61422-7
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: swat, lingas, andrzej just, karlsson
Título del libro: reykjavik, iceland, july july, scandinavian, swat, reykjavík


Datos del la editorial

Autor: Rolf Karlsson; Andrzej Lingas
Título: Lecture Notes in Computer Science; Algorithm Theory - SWAT '96 - 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings
Editorial: Springer; Springer Berlin
462 Páginas
Año de publicación: 1996-06-19
Berlin; Heidelberg; DE
Idioma: Inglés
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 462 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmen; Algorithms; Complexity Theory; Data Structures; Datenstrukturen; Discrete Mathematics; Graph Algorithms; Graphalgorithmen; Komplexitaetstheorie; algorithm; algorithm analysis and problem complexity; Theory of Computation; Software Engineering; Algorithms; Data Science; Data Storage Representation; Software Engineering; Algorithmen und Datenstrukturen; Datenbanken; EA

Derandomization via small sample spaces.- The randomized complexity of maintaining the minimum.- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning.- Service-constrained network design problems.- Approximate hypergraph coloring.- Facility dispersion and remote subgraphs.- The constrained minimum spanning tree problem.- Randomized approximation of the constraint satisfaction problem.- On the hardness of global and local approximation.- Approximation algorithms for the maximum satisfiability problem.- On the hardness of approximating the minimum consistent OBDD problem.- Computing the unrooted maximum agreement subtree in sub-quadratic time.- Greedily finding a dense subgraph.- Using sparsification for parametric minimum spanning tree problems.- Vertex partitioning problems on partial k-trees.- Making an arbitrary filled graph minimal by removing fill edges.- Sorting and searching revisted.- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching.- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees.- Neighborhood graphs and distributed ?+1-coloring.- Communication complexity of gossiping by packets.- Optimal cost-sensitive distributed minimum spanning tree algorithm.- A linear time algorithm for the feasibility of pebble motion on trees.- Linear-time heuristics for minimum weight rectangulation.- Visibility with multiple reflections.- A fast heuristic for approximating the minimum weight triangulation.- Neighbours on a grid.- On two dimensional packing.- Optimal orthogonal drawings of triconnected plane graphs.- Walking streets faster.- Safe and efficient traffic laws for mobile robots.- Progress in selection.- Probabilistic ancestral sequences and multiplealignments.- Efficient algorithms for Lempel-Ziv encoding.- The deterministic complexity of parallel multisearch.- Priority queues on parallel machines.- Binary search trees: How low can you go?.- Boolean analysis of incomplete examples.

Más, otros libros, que pueden ser muy parecidos a este:

Último libro similar:
9783540685296 Algorithm Theory - SWAT '96 (Rolf Karlsson; Andrzej Lingas)


< para archivar...