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 … Plus…
BarnesandNoble.com new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise Details... |
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… Plus…
Springer.com Nr. 978-3-540-61422-7. Frais d'envoiWorldwide free shipping, , DE. (EUR 0.00) Details... |
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… Plus…
Hugendubel.de Frais d'envoiShipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
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… Plus…
Hugendubel.de Frais d'envoiShipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
1996, ISBN: 9783540614227
Livres de poche
5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1996
lehmanns.de Frais d'envoiVersand in 10-14 Tagen. (EUR 0.00) Details... |
Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings Rolf Karlsson Editor - nouveau livre
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 … Plus…
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… Plus…
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… Plus…
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… Plus…
1996, ISBN: 9783540614227
Livres de poche
5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1996
Données bibliographiques du meilleur livre correspondant
Auteur: | |
Titre: | |
ISBN: |
Informations détaillées sur le livre - Algorithm Theory - SWAT '96
EAN (ISBN-13): 9783540614227
ISBN (ISBN-10): 3540614222
Livre de poche
Date de parution: 1996
Editeur: Springer Berlin
472 Pages
Poids: 0,707 kg
Langue: eng/Englisch
Livre dans la base de données depuis 2007-06-09T11:09:29+02:00 (Zurich)
Page de détail modifiée en dernier sur 2024-03-06T05:59:42+01:00 (Zurich)
ISBN/EAN: 3540614222
ISBN - Autres types d'écriture:
3-540-61422-2, 978-3-540-61422-7
Autres types d'écriture et termes associés:
Auteur du livre: swat, lingas, andrzej just, karlsson
Titre du livre: reykjavik, iceland, july july, scandinavian, swat, reykjavík
Données de l'éditeur
Auteur: Rolf Karlsson; Andrzej Lingas
Titre: Lecture Notes in Computer Science; Algorithm Theory - SWAT '96 - 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings
Editeur: Springer; Springer Berlin
462 Pages
Date de parution: 1996-06-19
Berlin; Heidelberg; DE
Langue: Anglais
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.Autres livres qui pourraient ressembler au livre recherché:
Dernier livre similaire:
9783540685296 Algorithm Theory - SWAT '96 (Rolf Karlsson; Andrzej Lingas)
< pour archiver...