Faster Algorithms for Rectangular Matrix Multiplication

Faster Algorithms for Semi-Matching Problems

Faster and More Accurate Sequence Alignment with SNAP

Faster and simpler approximation of stable matchings

Faster and Simpler Minimal Conflicting Set Identification

Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming

Faster Approximate Distance Queries and Compact Routing in Sparse Graphs

Faster Approximate Lossy Generalized Flow via Interior Point Algorithms

Faster Approximate Pattern Matching in Compressed Repetitive Texts

Faster Approximate String Matching for Short Patterns

Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs

Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms

Faster exon assembly by sparse spliced alignment

Faster FAST(Feedback Arc Set in Tournaments)

Faster fully compressed pattern matching by recompression

Faster generation of random spanning trees

Faster Information Dissemination in Dynamic Networks via Network Coding

Faster Least Squares Approximation

Faster Parameterized Algorithms using Linear Programming

Faster Parametric Shortest Path and Minimum Balance Algorithms