An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
An O(M(n) log n) algorithm for the Jacobi symbol
An O(m) Algorithm for Cores Decomposition of Networks
An O(n^3)-Time Algorithm for Tree Edit Distance
An O(n^{2.75}) algorithm for online topological ordering
An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk
An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems
An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings
An Optimal Algorithm for the Indirect Covering Subtree Problem
An Optimal Algorithm for the Maximum-Density Segment Problem
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
An Optimal Bloom Filter Replacement Based on Matrix Solving
An Optimal Labeling Scheme for Ancestry Queries
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
An Overview of Multiple Sequence Alignment Systems
An Ω(n log n) lower bound for computing the sum of even-ranked elements
Analysis of Agglomerative Clustering
Analysis of multi-stage open shop processing systems