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
Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey)
Analysis of the Relationships among Longest Common Subsequences, Shortest Common Supersequences and Patterns and its application on Pattern Discovery in Biological Sequences
Angle Tree: Nearest Neighbor Search in High Dimensions with Low Intrinsic Dimensionality
Another view of the Gaussian algorithm
AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming
Antilope - A Lagrangian Relaxation Approach to the de novo Peptide Sequencing Problem