1: Parallel Reachability in Almost Linear Work and Square Root Depth
2: Distributed Pattern Formation in a Ring
3: ALEX: An Updatable Adaptive Learned Index
4: Cartesian Tree Matching and Indexing
5: A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets
6: Efficient Multi-Resource, Multi-Unit VCG Auction
7: Connectivity Lower Bounds in Broadcast Congested Clique
8: A Hypergraph Based Approach for the 4-Constraint Satisfaction Problem Tractability
9: Dynamic Algorithms for the Massively Parallel Computation Model
10: Convergence Analyses of Online ADAM Algorithm in Convex Setting and Two-Layer ReLU Neural Network
11: Graph Searches and Their End Vertices
12: Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees
13: COBS: a Compact Bit-Sliced Signature Index
14: On the Average Case of MergeInsertion
15: Price of Dependence: Stochastic Submodular Maximization with Dependent Items
16: Approximation schemes for the generalized extensible bin packing problem
17: An Efficient Approach for Super and Nested Term Indexing and Retrieval
18: Feedback graph regret bounds for Thompson Sampling and UCB
19: Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter
20: Fast Convergence of Belief Propagation to Global Optima: Beyond Correlation Decay
21: The Effectiveness of Uniform Sampling for Center-Based Clustering with Outliers
22: Hardness of Distributed Optimization
23: What Can ResNet Learn Efficiently, Going Beyond Kernels?
24: The advantages of multiple classes for reducing overfitting from test set reuse
25: Quantum-inspired algorithms in practice
26: Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy
27: Enhancing Adversarial Defense by k-Winners-Take-All
28: Evacuating Two Robots from a Disk: A Second Cut
29: Robotic bees: Algorithms for collision detection and prevention
30: Subgraph Isomorphism on Graph Classes that Exclude a Substructure
31: Deterministic Distributed Dominating Set Approximation in the CONGEST Model
32: Minimum Age TDMA Scheduling
33: Phase Transitions in Bandits with Switching Constraints
34: Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
35: Regular resolution for CNFs with almost bounded one-sided treewidth
36: Engineering Kernelization for Maximum Cut
37: Scaling Fine-grained Modularity Clustering for Massive Graphs
38: Counting Causal Paths in Big Times Series Data on Networks
39: On Mappings on the Hypercube with Small Average Stretch
40: A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems
41: Adaptive Reduced Rank Regression
42: On the Complexity of Distributed Splitting Problems
43: A near-optimal algorithm for approximating the John Ellipsoid
44: Average Bias and Polynomial Sources
45: Certified lattice reduction
46: A Graph Theoretic Additive Approximation of Optimal Transport
47: A Parameterized Perspective on Protecting Elections