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
The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure
The Random Buffer Tree : A Randomized Technique for I/O-efficient Algorithms
The rank convergence of HITS can be slow
The Ratio Index for Budgeted Learning, with Applications
The reverse greedy algorithm for the metric k-median problem
The set of realizations of a max-plus linear sequence is semi-polyhedral