A Local Algorithm for Finding Dense Subgraphs
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning
A Local Spectral Method for Graphs: with Applications to Improving Graph Partitions and Exploring Data Graphs Locally
A Lower Bound for Estimating High Moments of a Data Stream
A Lower Bound for Succinct Rank Queries
A lower bound for the tree-width of planar graphs with vital linkages
A Matrix Hyperbolic Cosine Algorithm and Applications
A Memetic Algorithm for the Generalized Traveling Salesman Problem
A Memetic Algorithm for the Multidimensional Assignment Problem
A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly
A Minimal Periods Algorithm with Applications
A Monte Carlo algorithm for efficient large matrix inversion
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
A Multi-level Blocking Distinct Degree Factorization Algorithm
A Near-Optimal Algorithm for L1-Difference
A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size
A nearly optimal and deterministic summary structure for update data streams
A nearly-mlogn time solver for SDD linear systems
A Nearly-Quadratic Gap Between Adaptive and Non-Adaptive Property Testers
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees