1: Efficiently Solving MDPs with Stochastic Mirror Descent
2: Is the space complexity of planted clique recovery the same as that of detection?
3: An Efficient Routing Protocol for Secured Communication in Cognitive Radio Sensor Networks
4: Batching and Matching for Food Delivery in Dynamic Road Networks
5: Tight Bound for the Number of Distinct Palindromes in a Tree
6: Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics
7: Zoomless Maps: External Labeling Methods for the Interactive Exploration of Dense Point Sets at a Fixed Map Scale
8: Sorting by Prefix Block-Interchanges
9: Edmonds’ problem and the membership problem for orbit semigroups of quiver representations