1: Balancing SRPT and FCFS via Starvation Mitigation
2: Efficient Algorithms for Maximal k-Biplex Enumeration
3: Differentially-Private Clustering of Easy Instances
4: A Boolean Algebra for Genetic Variants
5: Private Rank Aggregation in Central and Local Models
6: Exact quantum query complexity of computing Hamming weight modulo powers of two and three
7: Optimal Weighted Load Balancing in TCAMs
8: A General Traffic Shaping Protocol in E-Commerce
9: Set membership with two classical and quantum bit probes
10: Space-Efficient FPT Algorithms
11: Complex contraction on trees without proof of correlation decay
12: Preference Swaps for the Stable Matching Problem