Fleischer, Rudolf (ed.); Moret, Bernard (ed.); Schmidt, Erik Meineche (ed.) Experimental algorithmics. From algorithm design to robust and efficient software. (English) Zbl 1011.68694 Lecture Notes in Computer Science. 2547. Berlin: Springer. xvii, 278 p. (2002). Show indexed articles as search result. The articles of this volume will be reviewed individually.Indexed articles:Bader, David A.; Moret, Bernard M. E.; Sanders, Peter, Algorithm engineering for parallel computation, 1-23 [Zbl 1026.68760]Demetrescu, Camil; Finocchi, Irene; Italiano, Giuseppe F.; Näher, Stefan, Visualization in algorithm engineering: Tools and techniques, 24-50 [Zbl 1026.68768]Fellows, Michael R., Parameterized complexity: The main ideas and connections to practical computing, 51-77 [Zbl 1026.68773]Ladner, Richard E.; Fortna, Ray; Nguyen, Bao-Hoang, A comparison of cache aware and cache oblivious static search trees using program instrumentation, 78-92 [Zbl 1026.68790]McGeoch, Catherine; Sanders, Peter; Fleischer, Rudolf; Cohen, Paul R.; Precup, Doina, Using finite experiments to study asymptotic performance, 93-126 [Zbl 1026.68796]Meinel, Christoph; Sack, Harald; Wagner, Arno, WWW. BDD-Portal. ORG: An experimentation platform for binary decision diagram algorithms, 127-138 [Zbl 1026.68798]Meinel, Christoph; Stangier, Christian, Algorithms and heuristics in VLSI design, 139-162 [Zbl 1026.68797]Moret, Bernard M. E.; Warnow, Tandy, Reconstructing optimal phylogenetic trees: A challenge in experimental algorithmics, 163-180 [Zbl 1026.68801]Sanders, Peter, Presenting data from experiments in algorithmics, 181-196 [Zbl 1026.68816]Spirakis, Paul G.; Zaroliagis, Christos D., Distributed algorithm engineering, 197-228 [Zbl 1026.68819]Zaroliagis, Christos D., Implementations and experimental studies of dynamic graph algorithms, 229-278 [Zbl 1026.68829] Cited in 1 Document MSC: 68U99 Computing methodologies and applications 68Wxx Algorithms in computer science 68-06 Proceedings, conferences, collections, etc. pertaining to computer science 68N19 Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) Keywords:Experimental algorithmics; Algorithm design; Robust software; Efficient software PDFBibTeX XMLCite \textit{R. Fleischer} (ed.) et al., Experimental algorithmics. From algorithm design to robust and efficient software. Berlin: Springer (2002; Zbl 1011.68694) Full Text: DOI Link