1: On Self-Avoiding Walks across n-Dimensional Dice and Combinatorial Optimization: An Introduction
2: Improved bounds for the randomized decision tree complexity of recursive majority
3: Span-program-based quantum algorithm for tree detection
4: The Dynamic Longest Increasing Subsequence Problem