1: Anisotropic k-Nearest Neighbor Search Using Covariance Quadtree
2: DNA Lossless Differential Compression Algorithm based on Similarity of Genomic Sequence Database
3: Fully Retroactive Approximate Range and Nearest Neighbor Searching
4: A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
5: Approximate Counting via Correlation Decay in Spin Systems
6: Maximum Segment Sum, Monadically (distilled tutorial, with solutions)
7: Specific “scientific” data structures, and their processing
8: Implementing Explicit and Finding Implicit Sharing in Embedded DSLs
9: An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries
10: Limitations of randomized mechanisms for combinatorial auctions
11: A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel
12: A deterministic algorithm for fitting a step function to a weighted point-set
13: Get the Most out of Your Sample: Optimal Unbiased Estimators using Partial Information
14: The Open Graph Archive: A Community-Driven Effort