Algorithms and Experiments: The New (and Old) Methodology (2001)


Download Links

by Bernard M. E. Moret , Henry D. Shapiro
Venue:J. Univ. Comput. Sci
Citations:9 - 4 self

Active Bibliography

36 Towards A Discipline Of Experimental Algorithmics – Bernard M. E. Moret
21 High-Performance Algorithm Engineering for Computational Phylogenetics – Bernard M. E. Moret, David A. Bader, Tandy Warnow - 2002
12 Graph and Hashing Algorithms for Modern Architectures: Design and Performance – John R. Black, Jr., Charles U. Martel, Hongbin Qi - 1998
2 Algorithm Engineering – Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano - 2003
1 Priority Queues and Dijkstra’s Algorithm ∗ – Mo Chen, Rezaul Alam, Chowdhury Vijaya Ramach, David Lan, Roche Lingling Tong - 2007
13 Experimental Evaluation of a New Shortest Path Algorithm (Extended Abstract) – Seth Pettie, Vijaya Ramachandran, Srinath Sridhar - 2002
6 What Do We Learn from Experimental Algorithmics? – Camil Demetrescu, Giuseppe F. Italiano - 2000
The Performance of in-Memory Sorting – Rajiv Wickremesinghe - 1999
5 An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms – Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro - 2007
10 Towards a Final Analysis of Pairing Heaps – Seth Pettie - 2005
14 Engineering an External Memory Minimum Spanning Tree Algorithm – Roman Dementiev, Peter Sanders, Dominik Schultes, Jop Sibeyn - 2004
4 Practical Performance of Efficient Minimum Cut Algorithms – Michael Jünger, Giovanni Rinaldi, Stefan Thienel - 1997
15 An Experimental Study of Priority Queues in External Memory – Klaus Brengel, et al.
2 The Partial Augment–Relabel Algorithm for the Maximum Flow Problem – Andrew V. Goldberg
56 Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport – Frank Schulz, Dorothea Wagner, Karsten Weihe - 2000
81 External Memory Data Structures – Lars Arge - 2001
38 STXXL: Standard template library for XXL data sets – R. Dementiev, L. Kettner - 2005
20 Combining Speed-Up Techniques for Shortest-Path Computations – Martin Holzer, Frank Schulz, Thomas Willhalm - 2004
_ E cient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems – Ali Dasdan, Y S. Irani, Rajesh K. Gupta