A linear space algorithm for the LCS problem
Acta Informatica
The least weight subsequence problem
SIAM Journal on Computing
The input/output complexity of sorting and related problems
Communications of the ACM
Speeding up dynamic programming with application to molecular biology
Theoretical Computer Science
Fast linear-space computations of longest common subsequences
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Parallel algorithms for dynamic programming recurrences with more than O(1) dependency
Journal of Parallel and Distributed Computing
An analysis of dag-consistent distributed shared-memory algorithms
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Locality of Reference in LU Decomposition with Partial Pivoting
SIAM Journal on Matrix Analysis and Applications
Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Communications of the ACM
Dynamic Programming
Computer Algorithms: C++
Introduction to Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Dynamic Programming
Optimizing Graph Algorithms for Improved Cache Performance
IEEE Transactions on Parallel and Distributed Systems
Algorithm Design
Cache oblivious stencil computations
Proceedings of the 19th annual international conference on Supercomputing
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The cache complexity of multithreaded cache oblivious algorithms
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Engineering a cache-oblivious sorting algorithm
Journal of Experimental Algorithmics (JEA)
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Cache-efficient dynamic programming algorithms for multicores
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Solving path problems on the GPU
Parallel Computing
Solving longest common subsequence and related problems on graphical processing units
Software—Practice & Experience
Cache-Oblivious Dynamic Programming for Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Graph expansion and communication costs of fast matrix multiplication: regular submission
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Communication-optimal Parallel and Sequential Cholesky Decomposition
SIAM Journal on Scientific Computing
Fast and cache-oblivious dynamic programming with local dependencies
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Revisiting the cache miss analysis of multithreaded algorithms
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A scalable algorithm for maximizing range sum in spatial databases
Proceedings of the VLDB Endowment
Parallel longest common subsequence using graphics hardware
EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
Graph expansion and communication costs of fast matrix multiplication
Journal of the ACM (JACM)
Hi-index | 0.00 |
We present efficient cache-oblivious algorithms for several fundamental dynamic programs. These include new algorithms with improved cache performance for longest common subsequence (LCS), edit distance, gap (i.e., edit distance with gaps), and least weight subsequence. We present a new cache-oblivious framework called the Gaussian Elimination Paradigm (GEP) for Gaussian elimination without pivoting that also gives cache-oblivious algorithms for Floyd-Warshall all-pairs shortest paths in graphs and 'simple DP', among other problems.