StringologyTimes

Data Structures and Algorithms: 2009/12/29-31

1: Lipschitz Unimodal and Isotonic Regression on Paths and Trees
2: Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
3: Time and Memory Efficient Lempel-Ziv Compression Using Suffix Arrays
4: A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem
5: The k-in-a-path problem for claw-free graphs