1: Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
2: Computing voting power in easy weighted voting games
3: Phase transition for Local Search on planted SAT
4: An Efficient Algorithm for Partial Order Production
5: Generating Random Networks Without Short Cycles
6: Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes
7: Exact phase transition of backtrack-free search with implications on the power of greedy algorithms
8: Dynamic External Hashing: The Limit of Buffering
9: Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems
10: An experimental analysis of Lemke-Howson algorithm
11: Binar Sort: A Linear Generalized Sorting Algorithm
12: Binar Shuffle Algorithm: Shuffling Bit by Bit
13: Faster Approximate String Matching for Short Patterns