1: A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids
2: Blind Signal Separation in the Presence of Gaussian Noise
3: Inverse problems in approximate uniform generation
4: Simple I/O-efficient flow accumulation on grid terrains
5: On the Convergence of the Hegselmann-Krause System
6: I/O-optimal algorithms on grid graphs
7: Efficient learning of simplices
8: Graph isomorphism and automorphism problems are polynomial
9: Strong Bounds for Evolution in Undirected Graphs
10: A memory versus compression ratio trade-off in PPM via compressed context modeling
11: Recognizing Interval Bigraphs by Forbidden Patterns
12: Testing probability distributions using conditional samples
13: A Mazing 2+eps Approximation for Unsplittable Flow on a Path
14: Online Stochastic Bin Packing
15: Metastability of Asymptotically Well-Behaved Potential Games
16: Iterative Row Sampling
17: BayesHammer: Bayesian clustering for error correction in single-cell sequencing
18: Enumeration of sequences with large alphabets
19: Iterative decoding of Generalized Parallel Concatenated Block codes using cyclic permutations
20: Truthful Mechanism Design for Multidimensional Covering Problems
21: Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
22: Network Sampling: From Static to Streaming Graphs