1: Learning One Convolutional Layer with Overlapping Patches
2: Current Flow Group Closeness Centrality for Complex Networks
3: Fair-by-design matching
4: Tight Lower Bounds for Locally Differentially Private Selection
5: Minimizing Latency in Online Ride and Delivery Services
6: A Complexity Theory for Labeling Schemes
7: Distributed Spanner Approximation
8: The $b$-bibranching Problem: TDI System, Packing, and Discrete Convexity
9: Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
10: Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
11: Searching isomorphic graphs
12: On the Tractability of (k,i)-Coloring
13: Low-Rank Methods in Event Detection and Subsampled Point-to-Subspace Proximity Tests
14: Faster Distributed Shortest Path Approximations via Shortcuts
15: Stochastic Non-preemptive Co-flow Scheduling with Time-Indexed Relaxation
16: The Use of Presence Data in Modelling Demand for Transportation
17: Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains
18: Reducing Compare-and-Swap to Consensus Number One Primitives
19: Katyusha X: Practical Momentum Method for Stochastic Sum-of-Nonconvex Optimization
20: How to Match when All Vertices Arrive Online
21: BagMinHash - Minwise Hashing Algorithm for Weighted Sets
22: On Minrank and the Lov'asz Theta Function
23: Algorithms for robust production scheduling with energy consumption limits
24: CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams
25: Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm
26: A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization
27: Scalable Lattice Influence Maximization
28: Hierarchical Overlap Graph
29: A Faster Isomorphism Test for Graphs of Small Degree
30: Quantum versus Classical Online Streaming Algorithms with Advice
31: Hadamard Response: Estimating Distributions Privately, Efficiently, and with Little Communication
32: Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model
33: Efficient Discovery of Variable-length Time Series Motifs with Large Length Range in Million Scale Time Series