default search action
Experimental Algorithmics 2000: Dagstuhl, Germany
- Rudolf Fleischer, Bernard M. E. Moret, Erik Meineche Schmidt:
Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000]. Lecture Notes in Computer Science 2547, Springer 2002, ISBN 3-540-00346-0 - David A. Bader, Bernard M. E. Moret, Peter Sanders:
Algorithm Engineering for Parallel Computation. 1-23 - Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher:
Visualization in Algorithm Engineering: Tools and Techniques. 24-50 - Michael R. Fellows:
Parameterized Complexity: The Main Ideas and Connections to Practical Computing. 51-77 - Richard E. Ladner, Ray Fortna, Bao-Hoang Nguyen:
A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation. 78-92 - Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup:
Using Finite Experiments to Study Asymptotic Performance. 93-126 - Christoph Meinel, Harald Sack, Arno Wagner:
WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms. 127-138 - Christoph Meinel, Christian Stangier:
Algorithms and Heuristics in VLSI Design. 139-162 - Bernard M. E. Moret, Tandy J. Warnow:
Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics. 163-180 - Peter Sanders:
Presenting Data from Experiments in Algorithmics. 181-196 - Paul G. Spirakis, Christos D. Zaroliagis:
Distributed Algorithm Engineering. 197-228 - Christos D. Zaroliagis:
Implementations and Experimental Studies of Dynamic Graph Algorithms. 229-278
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.