- 5 Risultati
prezzo più basso: € 53,49, prezzo più alto: € 96,49, prezzo medio: € 62,39
1
Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings Rolf Karlsson Editor
Ordina
da BarnesandNoble.com
€ 54,99
OrdinaLink sponsorizzato

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

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

new in stock. Costi di spedizione:zzgl. Versandkosten., Costi di spedizione aggiuntivi
2
Algorithm Theory - SWAT '96
Ordina
da Springer.com
€ 53,49
Spedizione: € 0,001
OrdinaLink sponsorizzato

SWAT '96:

Algorithm Theory - nuovo libro

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

Nr. 978-3-540-61422-7. Costi di spedizione:Worldwide free shipping, , DE. (EUR 0.00)
3
Algorithm Theory - SWAT '96 - Rolf Karlsson/ Andrzej Lingas
Ordina
da Hugendubel.de
€ 53,49
Spedizione: € 0,001
OrdinaLink sponsorizzato
Rolf Karlsson/ Andrzej Lingas:
Algorithm Theory - SWAT '96 - edizione con copertina flessibile

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

Costi di spedizione: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
Ordina
da Hugendubel.de
€ 96,49
Spedizione: € 0,001
OrdinaLink sponsorizzato
Rolf Karlsson/ Andrzej Lingas:
Algorithm Theory - SWAT '96 - edizione con copertina flessibile

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

Costi di spedizione: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
Ordina
da lehmanns.de
€ 53,49
Spedizione: € 0,001
OrdinaLink sponsorizzato
Rolf Karlsson; Andrzej Lingas:
Algorithm Theory - SWAT '96 - Prima edizione

1996, ISBN: 9783540614227

edizione con copertina flessibile

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

Costi di spedizione:Versand in 10-14 Tagen. (EUR 0.00)

1Poiché alcune piattaforme non trasmettono le condizioni di spedizione e queste possono dipendere dal paese di consegna, dal prezzo di acquisto, dal peso e dalle dimensioni dell'articolo, dall'eventuale iscrizione alla piattaforma, dalla consegna diretta da parte della piattaforma o tramite un fornitore terzo (Marketplace), ecc. è possibile che le spese di spedizione indicate da eurolibro non corrispondano a quelle della piattaforma offerente.

Dati bibliografici del miglior libro corrispondente

Dettagli 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.

Informazioni dettagliate del libro - Algorithm Theory - SWAT '96


EAN (ISBN-13): 9783540614227
ISBN (ISBN-10): 3540614222
Copertina flessibile
Anno di pubblicazione: 1996
Editore: Springer Berlin
472 Pagine
Peso: 0,707 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2007-06-09T11:09:29+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2024-03-06T05:59:42+01:00 (Zurich)
ISBN/EAN: 3540614222

ISBN - Stili di scrittura alternativi:
3-540-61422-2, 978-3-540-61422-7
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : swat, lingas, andrzej just, karlsson
Titolo del libro: reykjavik, iceland, july july, scandinavian, swat, reykjavík


Dati dell'editore

Autore: Rolf Karlsson; Andrzej Lingas
Titolo: Lecture Notes in Computer Science; Algorithm Theory - SWAT '96 - 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings
Editore: Springer; Springer Berlin
462 Pagine
Anno di pubblicazione: 1996-06-19
Berlin; Heidelberg; DE
Lingua: Inglese
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.

Altri libri che potrebbero essere simili a questo:

Ultimo libro simile:
9783540685296 Algorithm Theory - SWAT '96 (Rolf Karlsson; Andrzej Lingas)


< Per archiviare...