Experimental Algorithmics

Keyphrases

Publications

volume 2547, 2002

Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000] Experimental Algorithmics 2547 (2002)

2000

Christoph Meinel, Christian Stangier
Algorithms and Heuristics in VLSI Design. Experimental Algorithmics (2000)
Paul G. Spirakis, Christos D. Zaroliagis
Distributed Algorithm Engineering. Experimental Algorithmics (2000)
Richard E. Ladner, Ray Fortna, Bao-Hoang Nguyen
A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation. Experimental Algorithmics (2000)
Christos D. Zaroliagis
Implementations and Experimental Studies of Dynamic Graph Algorithms. Experimental Algorithmics (2000)
David A. Bader, Bernard M. E. Moret, Peter Sanders
Algorithm Engineering for Parallel Computation. Experimental Algorithmics (2000)
Peter Sanders
Presenting Data from Experiments in Algorithmics. Experimental Algorithmics (2000)
Christoph Meinel, Harald Sack, Arno Wagner
WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms. Experimental Algorithmics (2000)
Bernard M. E. Moret, Tandy J. Warnow
Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics. Experimental Algorithmics (2000)
Michael R. Fellows
Parameterized Complexity: The Main Ideas and Connections to Practical Computing. Experimental Algorithmics (2000)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics (2000)
Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup
Using Finite Experiments to Study Asymptotic Performance. Experimental Algorithmics (2000)