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 Black-Box Algorithms Through Higher Arity Operators

Faster Energy Efficient Dadda Based Baugh-Wooley Multipliers

Faster estimation of the correlation fractal dimension using box-counting

Faster exon assembly by sparse spliced alignment

Faster exponentials of power series

Faster FAST(Feedback Arc Set in Tournaments)

Faster fully compressed pattern matching by recompression

Faster generation of random spanning trees

Faster Gossiping in Bidirectional Radio Networks with Large Labels

Faster Information Dissemination in Dynamic Networks via Network Coding

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections

Faster Least Squares Approximation

Faster Parameterized Algorithms using Linear Programming