StringologyTimes

Data Structures and Algorithms: 2009/11/15-21

1: Boltzmann Samplers for Colored Combinatorial Objects
2: Boltzmann Samplers for v-balanced Colored Necklaces
3: Distances on Rhombus Tilings
4: Optimal Partial Tiling of Manhattan Polyominoes
5: Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly
6: A Dynamic Near-Optimal Algorithm for Online Linear Programming
7: Faster exponentials of power series
8: Efficient Distributed Random Walks with Applications
9: Recognizing well-parenthesized expressions in the streaming model
10: Re-Pair Compression of Inverted Lists
11: A Minimal Periods Algorithm with Applications
12: Randomized Interior Point methods for Sampling and Optimization