- 0 Ergebnisse
Kleinster Preis: € 80,95, größter Preis: € 113,62, Mittelwert: € 97,45
1
Algorithm Theory - SWAT '96 - Rolf Karlsson; Andrzej Lingas
Bestellen
bei Springer.com
€ 96,29
Versand: € 0,00
Bestellen
gesponserter Link
Rolf Karlsson; Andrzej Lingas:

Algorithm Theory - SWAT '96 - Taschenbuch

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

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
2
Algorithm Theory - SWAT '96 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings - Lingas, Andrzej (Herausgeber); Karlsson, Rolf (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 100,09
Versand: € 0,00
Bestellen
gesponserter Link

Lingas, Andrzej (Herausgeber); Karlsson, Rolf (Herausgeber):

Algorithm Theory - SWAT '96 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings - neues Buch

1996, ISBN: 3540614222

1996 Kartoniert / Broschiert Algorithmus, Betriebssysteme, Algorithmen und Datenstrukturen, Software Engineering, Data Mining, Informatik, Theoretische Informatik, ; complexitytheory; … Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
3
Algorithm Theory - SWAT  96 - Karlsson, Rolf Lingas, Andrzej
Bestellen
bei booklooker.de
€ 80,95
Versand: € 0,00
Bestellen
gesponserter Link
Karlsson, Rolf Lingas, Andrzej:
Algorithm Theory - SWAT 96 - Erstausgabe

1996

ISBN: 9783540614227

Taschenbuch

[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book constitutes the… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
4
Bestellen
bei Indigo.ca
C$ 167,95
(ca. € 113,62)
Bestellen
gesponserter Link
Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings - neues Buch

ISBN: 9783540614227

Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings Books List_Books, [PU: Springer, Berlin/Heidelberg]

new in stock. Versandkosten:zzgl. Versandkosten.
5
Algorithm Theory - SWAT '96 - Rolf Karlsson; Andrzej Lingas
Bestellen
bei lehmanns.de
€ 96,29
Versand: € 0,00
Bestellen
gesponserter Link
Rolf Karlsson; Andrzej Lingas:
Algorithm Theory - SWAT '96 - Taschenbuch

1996, ISBN: 9783540614227

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

Versandkosten:Versand in 10-14 Tagen. (EUR 0.00)

Details zum Buch
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.

Detailangaben zum Buch - Algorithm Theory - SWAT '96


EAN (ISBN-13): 9783540614227
ISBN (ISBN-10): 3540614222
Taschenbuch
Erscheinungsjahr: 1996
Herausgeber: Springer Berlin
472 Seiten
Gewicht: 0,707 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-06-09T11:09:29+02:00 (Berlin)
Detailseite zuletzt geändert am 2022-02-26T17:15:14+01:00 (Berlin)
ISBN/EAN: 3540614222

ISBN - alternative Schreibweisen:
3-540-61422-2, 978-3-540-61422-7


Daten vom Verlag:

Autor/in: Rolf Karlsson; Andrzej Lingas
Titel: Lecture Notes in Computer Science; Algorithm Theory - SWAT '96 - 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings
Verlag: Springer; Springer Berlin
462 Seiten
Erscheinungsjahr: 1996-06-19
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Gewicht: 1,450 kg
Sprache: Englisch
96,29 € (DE)
98,99 € (AT)
120,12 CHF (CH)
POD
X, 462 p.

BC; Book; 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; C; Theory of Computation; Software Engineering/Programming and Operating Systems; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Data Structures; Data Storage Representation; Theory of Computation; Software Engineering; Algorithms; Data Science; Data Storage Representation; Computer Science; Software Engineering; Algorithmen und Datenstrukturen; Datenbanken; 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 multiple alignments.- 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.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783540685296 Algorithm Theory - SWAT '96 (Rolf Karlsson; Andrzej Lingas)


< zum Archiv...