1: Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees
2: Robustness for Non-Parametric Classification: A Generic Attack and Defense
3: Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science
4: Symmetry Properties of Nested Canalyzing Functions
5: Finding a Shortest Non-zero Path in Group-Labeled Graphs
6: Parallel Streaming Random Sampling
7: The Demand Query Model for Bipartite Matching
8: Pure entropic regularization for metrical task systems
9: Meta-Learning Neural Bloom Filters
10: Ultra Fast Medoid Identification via Correlated Sequential Halving
11: Almost Optimal Semi-streaming Maximization for k-Extendible Systems
12: Rearrangement operations on unrooted phylogenetic networks
13: A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths
14: Faster Algorithms for High-Dimensional Robust Covariance Estimation
15: Communication and Memory Efficient Testing of Discrete Distributions
16: UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution
17: Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks
18: Similarity Problems in High Dimensions
19: Discrepancy, Coresets, and Sketches in Machine Learning
20: Prophet Inequalities on the Intersection of a Matroid and a Graph
21: Approximating the Orthogonality Dimension of Graphs and Hypergraphs
22: Sorted Top-k in Rounds
23: The Tandem Duplication Distance is NP-hard
24: Loop Programming Practices that Simplify Quicksort Implementations
25: Lower Bounds for the Happy Coloring Problems
26: Structural Parameterization for Graph Deletion Problems over Data Streams
27: On Longest Common Property Preserved Substring Queries
28: A Turing Kernelization Dichotomy for Structural Parameterizations of $\mathcal{F}$-Minor-Free Deletion
29: Post-Processing of High-Dimensional Data
30: Querying a Matrix through Matrix-Vector Products
31: The Communication Complexity of Optimization
32: Multi-level tree based approach for interactive graph visualization with semantic zoom
33: Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising
34: Dynamic Path-Decomposed Tries