Experimental Algorithmics
Editat de Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidten Limba Engleză Paperback – 13 dec 2002
Based on a seminar held at Dagstuhl Castle, Germany in September 2000, this state-of-the-art survey presents a coherent survey of the work done in the area so far. The 11 carefully reviewed chapters provide complete coverage of all current topics in experimental algorithmics.
Preț: 322.37 lei
Preț vechi: 402.96 lei
-20%
Puncte Express: 484
Preț estimativ în valută:
57.01€ • 65.37$ • 49.27£
57.01€ • 65.37$ • 49.27£
Carte disponibilă
Livrare economică 07-21 aprilie
Specificații
ISBN-13: 9783540003465
ISBN-10: 3540003460
Pagini: 304
Ilustrații: XVIII, 286 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540003460
Pagini: 304
Ilustrații: XVIII, 286 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Algorithm Engineering for Parallel Computation.- Visualization in Algorithm Engineering: Tools and Techniques.- Parameterized Complexity: The Main Ideas and Connections to Practical Computing.- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation.- Using Finite Experiments to Study Asymptotic Performance.- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms.- Algorithms and Heuristics in VLSI Design.- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics.- Presenting Data from Experiments in Algorithmics.- Distributed Algorithm Engineering.- Implementations and Experimental Studies of Dynamic Graph Algorithms.
Caracteristici
Includes supplementary material: sn.pub/extras