1: Optimal competitiveness for the Rectilinear Steiner Arborescence problem
2: Simple and Faster algorithm for Reachability in a Decremental Directed Graph
3: On the Structure, Covering, and Learning of Poisson Multinomial Distributions
4: Multi-probe consistent hashing
5: Approximation Algorithms for the Connected Sensor Cover Problem
6: The quantum complexity of approximating the frequency moments
7: Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
8: An Algorithmic Framework for Labeling Network Maps
9: Instance Optimal Geometric Algorithms
10: Combining Rewriting and Incremental Materialisation Maintenance for Datalog Programs with Equality
11: An Improved Private Mechanism for Small Databases
12: Algorithms for Lipschitz Learning on Graphs
13: Optimal Search Trees with 2-Way Comparisons
14: Approaching unstructured search from function bilateral symmetry detection - A quantum algorithm
15: Algorithms for the minimum sum coloring problem: a review
16: Triple State QuickSort, A replacement for the C/C++ library qsort
17: Anonymous Graph Exploration with Binoculars
18: On the Threshold of Intractability
19: Using higher-order Fourier analysis over general fields
20: Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables
21: Dual Failure Resilient BFS Structure
22: n-Level Hypergraph Partitioning
23: Parameterized Approximation Algorithms for Packing Problems
24: A family of greedy algorithms for finding maximum independent sets
25: Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking
26: Evaluating the Potential of a Dual Randomized Kaczmarz Solver for Laplacian Linear Systems
27: Dynamic Grover Search: Applications in Recommendation systems and Optimization problems
28: Approximation Ratio of LD Algorithm for Multi-Processor Scheduling and the Coffman-Sethi Conjecture
29: Depth-first search in split-by-edges trees
30: GWGGI: software for genome-wide gene-gene interaction analysis
31: Implementation of BT-trees
32: Improved Approximation Algorithms for Stochastic Matching
33: Public Transit Labeling
34: Maximum Matching in Turnstile Streams
35: Tight Bounds for Linear Sketches of Approximate Matchings
36: Fast and Powerful Hashing using Tabulation
37: Kernelization via Sampling with Applications to Dynamic Graph Streams