1: Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations
2: Learning Sparse Fixed-Structure Gaussian Bayesian Networks
3: The Traveling Firefighter Problem
4: The Stationary Prophet Inequality Problem
5: Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling
6: Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
7: Nonlinear transformation of complex amplitudes via quantum singular value transformation
8: Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem under Small Bids
9: Multiclass versus Binary Differentially Private PAC Learning
10: An Adaptive State Aggregation Algorithm for Markov Decision Processes
11: Robust Adaptive Submodular Maximization
12: Gain-loss-duplication models on a phylogeny: exact algorithms for computing the likelihood and its gradient
13: On the Sample Complexity of Privately Learning Axis-Aligned Rectangles
14: Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces
15: Efficient inference of interventional distributions
16: Power of human-algorithm collaboration in solving combinatorial optimization problems
17: Differential Privacy in the Shuffle Model: A Survey of Separations
18: Logspace Reducibility From Secret Leakage Planted Clique
19: On Kernels for d-Path Vertex Cover
20: Relational Boosted Regression Trees
21: Parameterized complexity of reconfiguration of atoms
22: Overview of Bachelors Theses 2021
23: Approximating Sumset Size
24: The Space Complexity of Sum Labelling
25: Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
26: Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum
27: Generalized Nash Equilibrium Problems with Mixed-Integer Variables
28: $(1+\epsilon)$-Approximate Shortest Paths in Dynamic Streams
29: On the Approximability of Multistage Min-Sum Set Cover