Algorithm Engineering is concerned with the design, analysis, implementation, tuning, debugging and experimental evaluation of computer programs for solving algorithmic problems. It provides methodologies and tools for developing and engineering efficient algorithmic codes and aims at integrating and reinforcing traditional theoretical approaches for the design and analysis of algorithms and data structures.
|
6121
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
2010
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
871
|
Network flows: theory, algorithms, and applications
– Ahuja, Magnanti, et al.
- 1993
|
|
545
|
LEDA - A Platform for Combinatorial and Geometric
– Mehlhorn, Naher
- 1996
|
|
496
|
Linear Programming and Extensions
– Dantzig
- 1998
|
|
453
|
A new polynomial-time algorithm for linear programming
– Karmarkar
- 1984
|
|
412
|
Fibonacci heaps and their uses in improved network optimization algorithms
– Fredman, Tarjan
- 1987
|
|
401
|
The input/output complexity of sorting and related problems
– Aggarwal, Vitter
- 1988
|
|
315
|
A System for algorithm animation
– Brown, Sedgewick
- 1984
|
|
253
|
Designing programs that check their work
– Blum, Kannan
- 1995
|
|
246
|
A polynomial algorithm in linear programming. Doklady Akademiia Nauk SSSR
– Khachiyan
- 1979
|
|
236
|
New hash functions and their use in authentication and set equality
– Wegman, Carter
- 1981
|
|
227
|
Algorithms for parallel memory I: two-level memories
– Vitter, Shriver
- 1994
|
|
222
|
External memory algorithms and data structures: Dealing with
– Vitter
- 2000
|
|
203
|
Organization and maintenance of large ordered indexes
– Bayer, McCreight
- 1985
|
|
166
|
Zeus: A System for Algorithm Animation and Multi-view Editing (Research Report No
– Brown
- 1992
|
|
100
|
Hierarchical memory with block transfer
– Aggarwal, Chandra, et al.
- 1987
|
|
98
|
On implementing pushrelabel method for the maximum flow problem
– Cherkassky, Goldberg
- 1997
|
|
97
|
Software Visualization: Programming as a Multimedia Experience
– Stasko, Domingue, et al.
- 1998
|
|
93
|
Cache-oblivious B-trees
– Bender, Demaine, et al.
- 2000
|
|
79
|
Software reliability via run-time result-checking
– Blum, Wasserman
- 1997
|
|
78
|
Pavane: a system for declarative visualization of concurrent computations
– Roman, Cox, et al.
|
|
69
|
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
– Spielman, Teng
|
|
66
|
On the Design of CGAL, a Computational Geometry Algorithms Library
– FABRI, GIEZEMAN, et al.
- 2000
|
|
62
|
External memory data structures
– Arge
- 2002
|
|
59
|
Graphs minors --- a survey
– Robertson, Seymour
- 1985
|
|
58
|
Cache-oblivious algorithms
– Prokop
- 1999
|
|
58
|
Algorithms for parallel memory II: Hierarchical multilevel memories
– Vitter, Shriver
- 1994
|
|
54
|
A locality-preserving cache-oblivious dynamic dictionary
– Bender, Duan, et al.
- 2002
|
|
54
|
The Matrix Market: A web resource for test matrix collections
– Boisvert, Pozo, et al.
- 1997
|
|
50
|
A theoretician's guide to the experimental analysis of algorithms. http://www.research.att.com/~dsj/papers/. Preliminary draft
– JOHNSON
|
|
40
|
Animating Algorithms with XTANGO
– Stasko
- 1992
|
|
39
|
Implementing the Simplex Method: The Initial Basis
– Bixby
- 1992
|
|
32
|
Towards a discipline of experimental algorithmics
– Moret
- 2001
|
|
29
|
An empirical assessment of algorithms for constructing a minimal spanning tree
– Moret
- 1994
|
|
28
|
Visualization of geometric algorithms
– Tal, Dobkin
- 1995
|
|
26
|
Reversible execution and visualization of programs with LEONARDO
– Crescenzi, Demetrescu, et al.
- 2000
|
|
26
|
Netgen A program for generating large scale capacitated assignement, transportation, and minimum cost network flow problems
– Klingman, Napier, et al.
- 1974
|
|
25
|
Implementing I/O-efficient data structures using TPIE
– Arge, Procopiuc, et al.
- 2002
|
|
19
|
Testers and visualizers for teaching data structures
– Baker, Boilen, et al.
- 1999
|
|
19
|
Implementation of a combinatorial multicommodity algorithm
– Leong, Shor, et al.
- 1993
|
|
17
|
A comparison of cache aware and cache oblivious static search trees using program instrumentation
– Ladner, Fortna, et al.
- 2002
|
|
17
|
Visualizing Parallel Computer System Performance
– Malony, Reed
- 1988
|
|
13
|
Exponential structures for efficient cache-oblivious algorithms
– Bender, Cole, et al.
- 2002
|
|
10
|
AGD-library: a library of algorithms for graph drawing
– Alberts, Gutwenger, et al.
- 1997
|
|
9
|
Visualizing Algorithms over the Web with the Publication-driven Approach
– Demetrescu, Finocchi, et al.
- 2000
|
|
8
|
Parameterized Complexity. Monographs in computer science
– Downey, Fellows
- 1999
|
|
6
|
Selecting problems for algorithm evaluation
– Goldberg
- 1999
|
|
4
|
The role of experiment in the theory of algorithms
– Anderson
- 1996
|
|
4
|
Visualization in algorithm engineering: Tools and techniques
– Demetrescu, Finocchi, et al.
- 2002
|
|
