1: An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games
2: Ordered Median Hub Location Problems with Capacity Constraints
3: More General Queries and Less Generalization Error in Adaptive Data Analysis
4: Using Model-Checking Techniques for Component-Based Systems with Reconfigurations
5: Algebraic Methods in the Congested Clique
6: Perfect Consistent Hashing
7: The Book Thickness of 1-Planar Graphs is Constant
8: A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex
9: The Graph Motif problem parameterized by the structure of the input graph
10: Quality Assessment of Linked Datasets using Probabilistic Approximation
11: Sketching, Embedding, and Dimensionality Reduction for Information Spaces
12: Entropy-scaling search of massive biological data
13: Time and Space Efficient Algorithms for RNA Folding with the Four-Russians Technique
14: The Lock-free $k$-LSM Relaxed Priority Queue
15: FFT Algorithm for Binary Extension Finite Fields and its Application to Reed-Solomon Codes
16: Counting hypergraph matchings up to uniqueness threshold
17: Constant-complexity Stochastic Simulation Algorithm with Optimal Binning
18: Hub Location under Uncertainty: a Minimax Regret Model for the Capacitated Problem with Multiple Allocations
19: Dynamic Data Structures for Document Collections and Graphs
20: Binary Coding in Stream