1: Lower Bounds for BMRM and Faster Rates for Training SVMs
2: The Uniformization Process of the Fast Congestion Notification (FN)
3: On The Optimality Of All To All Broadcast In k ary n dimensional Tori
4: Minimum clique partition in unit disk graphs
5: Teaching an Old Elephant New Tricks
6: Optimally fast incremental Manhattan plane embedding and planar tight span construction
7: Paired approximation problems and incompatible inapproximabilities
8: Computing alignment plots efficiently
9: Deterministic approximation for the cover time of trees
10: Size Bounds for Conjunctive Queries with General Functional Dependencies
11: Approximate Nearest Neighbor Search through Comparisons
12: Generating All Partitions: A Comparison Of Two Encodings
13: Hierarchical Routing over Dynamic Wireless Networks
14: Simple implementation of deletion from open-address hash table