The interval ordering problem
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy
The K-Server Dual and Loose Competitiveness for Paging
The Knapsack Problem with Neighbour Constraints
The lattice dimension of a graph
The Lazy Bureaucrat Scheduling Problem
The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search
The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions
The Linear Arrangement Problem Parameterized Above Guaranteed Value
The LSST moving object processing pipeline
The maximum disjoint paths problem on multi-relations social networks
The Minimum Expectation Selection Problem
The Open Graph Archive: A Community-Driven Effort
The Optimal Quantile Estimator for Compressed Counting
The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs
The parameterized complexity of k-edge induced subgraphs
The phase transition in random Horn satisfiability and its algorithmic implications
The Power of Simple Tabulation Hashing
The Query-commit Problem