| Subcubic Equivalences Between Path, Matrix, and Triangle Problems |
10 |
| Hierarchical Clustering: Objective Functions and Algorithms |
9 |
| Worst-case Optimal Join Algorithms |
6 |
| Spectral Properties of Hypergraph Laplacian and Approximation Algorithms |
6 |
| Fair Enough: Guaranteeing Approximate Maximin Shares |
5 |
| The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication |
5 |
| Bandits with Knapsacks |
5 |
| Deterministic Edge Connectivity in Near-Linear Time |
5 |
| Threesomes, Degenerates, and Love Triangles |
4 |
| The Salesman's Improved Paths through Forests |
4 |
| Approaching 3/2 for the s-t-path TSP |
4 |
| Near-optimal Linear Decision Trees for k-SUM and Related Problems |
4 |
| Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time |
3 |
| Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes |
3 |
| Uniform Sampling Through the Lovasz Local Lemma |
3 |
| Pseudorandomness from Shrinkage |
3 |
| Embeddability in the 3-Sphere Is Decidable |
3 |
| The Moser-Tardos Framework with Partial Resampling |
3 |
| On the Parameterized Complexity of Approximating Dominating Set |
3 |
| Non-Malleable Codes |
3 |
| Path ORAM: An Extremely Simple Oblivious RAM Protocol |
3 |
| Full Abstraction for Probabilistic PCF |
2 |
| Distributed (Delta+1)-Coloring in Sublogarithmic Rounds |
2 |
| Optimal Multi-Way Number Partitioning |
2 |
| Minimization of Tree Patterns |
2 |
| Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) |
2 |
| Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford |
2 |
| Bandits and Experts in Metric Spaces |
2 |
| Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems |
2 |
| Approximate Counting, the Lovasz Local Lemma, and Inference in Graphical Models |
2 |
| Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System |
2 |
| On Algebraic Branching Programs of Small Width |
2 |
| The Parameterized Complexity of the k-Biclique Problem |
2 |
| Reachability Is in DynFO |
1 |
| On the Computability of Conditional Probability |
1 |
| Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms |
1 |
| From Real-time Logic to Timed Automata |
1 |
| Parallel Bayesian Search with No Coordination |
1 |
| Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity |
1 |
| Indistinguishability Obfuscation from Functional Encryption |
1 |
| White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing |
1 |
| Index Reduction for Differential-algebraic Equations with Mixed Matrices |
1 |
| Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability |
1 |
| Settling the Query Complexity of Non-adaptive Junta Testing |
1 |
| An Unrestricted Learning Procedure |
1 |
| The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3 |
1 |
| Constant-Rate Coding for Multiparty Interactive Communication Is Impossible |
1 |
| Fast Hamiltonicity Checking Via Bases of Perfect Matchings |
1 |
| Approximation Schemes for Independent Set and Sparse Subsets of Polygons |
1 |
| Engineering with Logic: Rigorous Test-Oracle Specification and Validation for TCP/IP and the Sockets API |
1 |
