Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Prioritized Metric Structures and Embedding: Label: en
2-Server PIR with Sub-Polynomial Communication: Label: en
Preserving Statistical Validity in Adaptive Data Analysis: Label: en
Inapproximability of Combinatorial Problems via Small LPs and SDPs: Label: en
Sum of Squares Lower Bounds from Pairwise Independence: Label: en
Sum-of-squares Lower Bounds for Planted Clique: Label: en
On the Complexity of Random Satisfiability Problems with Planted Solutions: Label: en
Proof of the Satisfiability Conjecture for Large k: Label: en
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false): Label: en
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture: Label: en
Clustered Integer 3SUM via Additive Combinatorics: Label: en
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture: Label: en
The Power of Dynamic Distance Oracles: Label: en
Online Submodular Welfare Maximization: Label: en
Approximate Distance Oracles with Improved Bounds: Label: en
Secretary Problems with Non-Uniform Arrival Order: Label: en
Greedy Algorithms for Steiner Forest: Label: en
Randomized Rounding for the Largest Simplex Problem: Label: en
Minimizing Flow-Time on Unrelated Machines: Label: en
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection: Label: en
Analysis of a Classical Matrix Preconditioning Algorithm: Label: en
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices: Label: en
From Independence to Expansion and Back Again: Label: en
Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms: Label: en
Optimal Data-Dependent Hashing for Approximate Near Neighbors: Label: en
Approximate k -flat Nearest Neighbor Search: Label: en
Efficiently Learning Ising Models on Arbitrary Graphs: Label: en
Learning Mixtures of Gaussians in High Dimensions: Label: en
Tight Bounds for Learning a Mixture of Two Gaussians: Label: en
Learning Arbitrary Statistical Mixtures of Discrete Distributions: Label: en
Solving the Shortest Vector Problem in 2 ⁿ Time Using Discrete Gaussian Sampling: Label: en
Testing Cluster Structure of Graphs: Label: en
Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms: Label: en
Random Permutations using Switching Networks: Label: en
Faster Canonical Forms for Primitive Coherent Configurations: Label: en
Computing with Tangles: Label: en
Beyond the Euler Characteristic: Label: en
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time: Label: en
The Directed Grid Theorem: Label: en
Excluded Grid Theorem: Label: en
How Well Can Graphs Represent Wireless Interference?: Label: en
Adjacency Labeling Schemes and Induced-Universal Graphs: Label: en
Test-and-Set in Optimal Space: Label: en
Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity: Label: en
High Parallel Complexity Graphs and Memory-Hard Functions: Label: en
Fast Matrix Multiplication: Label: en
Lower Bounds on the Size of Semidefinite Programming Relaxations: Label: en
Exponential Separation of Information and Communication for Boolean Functions: Label: en
FPTAS for #BIS with Degree Bounds on One Side: Label: en
Bypassing KLS: Label: en