1: Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
2: Theoretical formulation and analysis of the deterministic dendritic cell algorithm
3: Dynamic Ad Allocation: Bandits with Budgets
4: In pursuit of the dynamic optimality conjecture
5: Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing
6: Orthogonal Range Searching for Text Indexing
7: The Frequent Items Problem in Online Streaming under Various Performance Measures
8: Arithmetic Algorithms for Hereditarily Binary Natural Numbers
9: Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Full Version
10: Efficient Single-Source Shortest Path and Distance Queries on Large Graphs
11: A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2 n)
12: A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles
13: A note on QUBO instances defined on Chimera graphs
14: Sparse Covers for Sums of Indicators
15: A Note on Graphs of Linear Rank-Width 1
16: Sorting suffixes of a text via its Lyndon Factorization
17: Threshold Load Balancing in Networks
18: Beyond Locality-Sensitive Hashing
19: Fast greedy algorithm for subspace clustering from corrupted and incomplete data