Cs-Ds
A Durable Flash Memory Search Tree
Online Exploration of Polygons with Holes
On Money as a Means of Coordination between Network Packets
Adaptive Inference on General Graphical Models
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control
A one-bit swap object using test-and-sets and a max register
Fast Distributed Computation in Dynamic Networks via Random Walks
On the optimality of tree-reweighted max-product message-passing
Mechanism Design for Fair Division
Convex Relaxations for Learning Bounded Treewidth Decomposable Graphs
Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles
The Cost of Address Translation
Lattice Sparsification and the Approximate Closest Vector Problem
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound
A Practical Algorithm for Topic Modeling with Provable Guarantees
An Efficient Simulation Algorithm on Kripke Structures
Optimal Time Bounds for Approximate Clustering
One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
Local Thresholding in General Network Graphs
A Hierarchical Exact Accelerated Stochastic Simulation Algorithm
New Algorithms for Position Heaps
