A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
A Proof of the Boyd-Carr Conjecture
A PTAS for Computing the Supremum of Gaussian Processes
A PTAS for Scheduling with Tree Assignment Restrictions
A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters
A quadratic algorithm for road coloring
A Quartic Kernel for Pathwidth-One Vertex Deletion
A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy
A Randomized Algorithm for 3-SAT
A randomized algorithm for the on-line weighted bipartite matching problem
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem
A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM
A Reduced Offset Based Method for Fast Computation of the Prime Implicants Covering a Given Cube
A Searchable Compressed Edit-Sensitive Parsing
A simple algorithm for the evaluation of the hypergeometric series using quasi-linear time and linear space
A simple and practical algorithm for differentially private data release
A Simple Approach to Error Reconciliation in Quantum Key Distribution
A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies
A simple D^2-sampling based PTAS for k-means and other Clustering Problems