Towards A Discipline Of Experimental Algorithmics

Cached

Download Links

by Bernard M. E. Moret
Citations:36 - 8 self

Active Bibliography

9 Algorithms and Experiments: The New (and Old) Methodology – Bernard M. E. Moret, Henry D. Shapiro - 2001
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
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
7 Reconstructing optimal phylogenetic trees: a challenge in experimental algorithmics – Bernard M. E. Moret, Tandy Warnow - 2002
4 Practical Performance of Efficient Minimum Cut Algorithms – Michael Jünger, Giovanni Rinaldi, Stefan Thienel - 1997
55 Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport – Frank Schulz, Dorothea Wagner, Karsten Weihe - 2000
12 Experimental Evaluation of a New Shortest Path Algorithm (Extended Abstract) – Seth Pettie, Vijaya Ramachandran, Srinath Sridhar - 2002
2 Algorithm Engineering – Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano - 2003
2 The Partial Augment–Relabel Algorithm for the Maximum Flow Problem – Andrew V. Goldberg
2 Average-Case Complexity of Shortest-Paths Problems – Volker Priebe, Der Naturwissenschaftlich-technischen Fakultät I, Dekan Prof, Dr. Rainer Schulze-pillot-ziemen, Gutachter Prof, Dr. Kurt Mehlhorn, Prof Alan Frieze, Ph. D
35 Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems – Ali Dasdan, et al. - 1999
20 Combining Speed-Up Techniques for Shortest-Path Computations – Martin Holzer, Frank Schulz, Thomas Willhalm - 2004
© 1996 INFORMS Use of Representative Operation Counts in Computational Testing of Algorithms – Ravindra K. Ahuja
40 An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree – Bernard M. E. Moret, Henry D. Shapiro - 1994
54 A New Implementation and Detailed Study of Breakpoint Analysis – Bernard M. E. Moret, Stacia Wyman, David A. Bader, Tandy Warnow, Mi Yan - 2001
1 Priority Queues and Dijkstra’s Algorithm ∗ – Mo Chen, Rezaul Alam, Chowdhury Vijaya Ramach, David Lan, Roche Lingling Tong - 2007
2 Redesigning the String Hash Table, Burst Trie, and BST to Exploit Cache – Nikolas Askitis, JUSTIN ZOBEL - 2011
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998