1: On Acceleration with Noise-Corrupted Gradients
2: Efficient Algorithms and Lower Bounds for Robust Linear Regression
3: Near-Optimal Budgeted Data Exchange for Distributed Loop Closure Detection
4: Block Palindromes: A New Generalization of Palindromes
5: Joint Size and Depth Optimization of Sorting Networks
6: Provably convergent acceleration in factored gradient descent with applications in matrix sensing
7: Fast Locality Sensitive Hashing for Beam Search on GPU
8: On Minrank and Forbidden Subgraphs
9: Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks
10: Principled Network Reliability Approximation: A Counting-Based Approach
11: Covering with Clubs: Complexity and Approximability
12: Efficient Genomic Interval Queries Using Augmented Range Trees
13: Towards the Practical Application of Near-Term Quantum Computers in Quantum Chemistry Simulations: A Problem Decomposition Approach
14: Improving rewards in overloaded real-time systems
15: Labeling Algorithm and Compact Routing Scheme for a Small World Network Model
16: Graph Compression Using Pattern Matching Techniques
17: Dynamic Programming Optimization in Line of Sight Networks
18: Fast Dynamic Programming on Graph Decompositions
19: On the performance of multi-objective estimation of distribution algorithms for combinatorial problems
20: Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
21: Tree Path Majority Data Structures
22: Another Proof of Cuckoo hashing with New Variants
23: Bounding Bloat in Genetic Programming
24: Online Makespan Minimization: The Power of Restart
25: Conditional Linear Regression
26: Mitigating Bias in Adaptive Data Gathering via Differential Privacy