StringologyTimes

Data Structures and Algorithms: 2019/1/15-21

1: Quotient Hash Tables - Efficiently Detecting Duplicates in Streaming Data
2: Online Inventory Management with Application to Energy Procurement in Data Centers
3: A constant FPT approximation algorithm for hard-capacitated k-means
4: Unconstrained Church-Turing thesis cannot possibly be true
5: An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs
6: The Bayesian Prophet: A Low-Regret Framework for Online Decision Making
7: Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention
8: Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform
9: On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree
10: Solving Simple Stochastic Games with few Random Nodes faster using Bland’s Rule
11: An analysis of the Geodesic Distance and other comparative metrics for tree-like structures
12: The Pareto Record Frontier
13: Generating Pareto records
14: Boolean matrix factorization meets consecutive ones property
15: Resource-Aware Algorithms for Distributed Loop Closure Detection with Provable Performance Guarantees
16: Accelerated Experimental Design for Pairwise Comparisons
17: On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms
18: Dynamic Partition Bloom Filters: A Bounded False Positive Solution For Dynamic Set Membership (Extended Abstract)
19: Minimum–Entropy Couplings and their Applications
20: Approximation Algorithms for the A Priori TravelingRepairman
21: Efficiently factoring polynomials modulo $p^4$
22: Fast algorithms at low temperatures via Markov chains
23: Iterative Refinement for $\ell_p$-norm Regression
24: Mixed integer formulations using natural variables for single machine scheduling around a common due date