LEADER 04599nam  22007935  450 
001 9910143889403321
005 20200706032105.0
010   $a3-540-36383-1
024 7 $a10.1007/3-540-36383-1
035   $a(CKB)1000000000211884
035   $a(SSID)ssj0000323041
035   $a(PQKBManifestationID)11272565
035   $a(PQKBTitleCode)TC0000323041
035   $a(PQKBWorkID)10296389
035   $a(PQKB)10211577
035   $a(DE-He213)978-3-540-36383-5
035   $a(MiAaPQ)EBC3072643
035   $a(PPN)15521845X
035   $a(EXLCZ)991000000000211884
100   $a20121227d2002      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aExperimental Algorithmics $eFrom Algorithm Design to Robust and Efficient Software /$fedited by Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt
205   $a1st ed. 2002.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002.
215   $a1 online resource (XVIII, 286 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2547
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-00346-0 
320   $aIncludes bibliographical references at the end of each chapters and index.
327   $aAlgorithm 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.
330   $a Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the process of developing robust and efficient software for applications. 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2547
606   $aComputer science
606   $aData structures (Computer science)
606   $aAlgorithms
606   $aNumerical analysis
606   $aComputer science?Mathematics
606   $aComputer Science, general$3https://scigraph.springernature.com/ontologies/product-market-codes/I00001
606   $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018
615  0$aComputer science.
615  0$aData structures (Computer science).
615  0$aAlgorithms.
615  0$aNumerical analysis.
615  0$aComputer science?Mathematics.
615 14$aComputer Science, general.
615 24$aData Structures.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aNumeric Computing.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aAlgorithms.
676   $a005.1
702   $aFleischer$b Rudolf$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMoret$b Bernhard$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMeineche Schmidt$b Erik$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910143889403321
996   $aExperimental algorithmics$9953833
997   $aUNINA