1: Similar Elements and Metric Labeling on Complete Graphs
2: A quantum algorithm for simulating non-sparse Hamiltonians
3: Multiversion Concurrency with Bounded Delay and Precise Garbage Collection
4: Parallel Range, Segment and Rectangle Queries with Augmented Maps
5: Determinantal Point Processes for Coresets
6: Data Streams with Bounded Deletions
7: Byzantine Stochastic Gradient Descent
8: A Bounded Formulation for The School Bus Scheduling Problem
9: Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows
10: Stochastic bandits robust to adversarial corruptions
11: Popular Matching in Roommates Setting is NP-hard
12: Unpopularity Factor in the Marriage and Roommates Problems
13: Clustering to Given Connectivities
14: On the Approximation Ratio of Ordered Parsings
15: Universal Compressed Text Indexing
16: Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays
17: Algorithm Configuration: Learning policies for the quick termination of poor performers
18: Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems
19: A Faster FPTAS for the Subset-Sums Ratio Problem
20: Learning to Branch
21: Distributed Adaptive Sampling for Kernel Matrix Approximation
22: A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint
23: Privacy-preserving Prediction
24: The balanced 2-median and 2-maxian problems on a tree
25: Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent
26: A Framework for ETH-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
27: On Learning Graphs with Edge-Detecting Queries