1: Assembling sequences of DNA using an on-line algorithm based on DeBruijn graphs
2: Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond
3: Constructing a Consensus Phylogeny from a Leaf-Removal Distance
4: Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
5: Comparison-Based Choices
6: Estimating Sequence Similarity from Read Sets for Clustering Next-Generation Sequencing data
7: Stochastic k-Server: How Should Uber Work?
8: Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
9: Fast Snapshottable Concurrent Braun Heaps
10: Constrained Submodular Maximization via Greedy Local Search
11: Layered graphs: a class that admits polynomial time solutions for some hard problems
12: Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data
13: Taming Near Repeat Calculation for Crime Analysis via Cohesive Subgraph Computing
14: Algorithms for $\ell_p$ Low Rank Approximation
15: Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem
16: Practical Algorithms for Best-K Identification in Multi-Armed Bandits
17: A High-Performance Algorithm for Identifying Frequent Items in Data Streams
18: On Packet Scheduling with Adversarial Jamming and Speedup
19: Computing the BWT and LCP array of a Set of Strings in External Memory
20: CacheShuffle: An Oblivious Shuffle Algorithm Using Caches
21: Clustering under Local Stability: Bridging the Gap between Worst-Case and Beyond Worst-Case Analysis
22: PrivMin: Differentially Private MinHash for Jaccard Similarity Computation
23: Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$
24: Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks
25: Broadcasting in Noisy Radio Networks