1: Submodular Optimization over Sliding Windows
2: A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs
3: LAST but not Least: Online Spanners for Buy-at-Bulk
4: Submodular Maximization over Sliding Windows
5: Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time
6: Stationary time-vertex signal processing
7: Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths
8: Computing Skylines on Distributed Data
9: Worst Case Competitive Analysis of Online Algorithms for Conic Optimization
10: An asymptotically optimal, online algorithm for weighted random sampling with replacement
11: Online Algorithm for Demand Response with Inelastic Demands and Apparent Power Constraint
12: Algorithmic concepts for the computation of Jacobsthal’s function
13: Combinatorial Prophet Inequalities
14: Linear Programming Heuristics for the Graph Isomorphism Problem
15: Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners
16: Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs
17: Accelerated Methods for Non-Convex Optimization
18: Preserving Randomness for Adaptive Algorithms
19: Multidimensional Binary Search for Contextual Decision-Making
20: Below all subsets for Minimal Connected Dominating Set
21: Designing Sparse Reliable Pose-Graph SLAM: A Graph-Theoretic Approach
22: Low Rank Approximation with Entrywise $\ell_1$-Norm Error
23: DecreaseKeys are Expensive for External Memory Priority Queues
24: A Dichotomy for Regular Expression Membership Testing
25: Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs
26: Fast Eigenspace Approximation using Random Signals
27: Fully polynomial time approximation schemes (FPTAS) for some counting problems
28: Half-integral linkages in highly connected directed graphs
29: Solving the Persistent Phylogeny Problem in polynomial time
30: Drive Mode Optimization and Path Planning for Plug-in Hybrid Electric Vehicles
31: A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs
32: Finding Approximate Local Minima Faster than Gradient Descent
33: Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness
34: Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs
35: Generalized Topic Modeling
36: A Generalization of the Minisum and Minimax Voting Methods
37: Searching Trees with Permanently Noisy Advice: Walking and Query Algorithms
38: Space-Efficient Re-Pair Compression
39: A Two Pronged Progress in Structured Dense Matrix Multiplication
40: Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree
41: Uniform Sampling through the Lov'asz Local Lemma
42: Twenty (simple) questions
43: Oracle-Efficient Online Learning and Auction Design
44: Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds
45: Deciding Graph non-Hamiltonicity via a Closure Algorithm
46: LZ-End Parsing in Compressed Space
47: A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
48: Algorithmic Discrepancy Beyond Partial Coloring
49: Compressed Dynamic Range Majority and Minority Data Structures
50: MTS Sketch for Accurate Estimation of Set-Expression Cardinalities from Small Samples
51: A Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem
52: Linear Sketching over $\mathbb F_2$
53: On the Configuration-LP of the Restricted Assignment Problem