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.

A new line of attack on the dichotomy conjecture: Label: en
Holant problems and counting CSP: Label: en
Random graphs and the parity quantifier: Label: en
An axiomatic approach to algebrization: Label: en
Online and stochastic survivable network design: Label: en
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation: Label: en
Multiple intents re-ranking: Label: en
A constant-factor approximation for stochastic Steiner forest: Label: en
Explicit construction of a small epsilon-net for linear threshold functions: Label: en
Small-size ε-nets for axis-parallel rectangles and boxes: Label: en
Every planar graph is the intersection graph of segments in the plane: Label: en
On cryptography with auxiliary input: Label: en
Inaccessible entropy: Label: en
Non-malleable extractors and symmetric key cryptography from weak secrets: Label: en
Tight lower bounds for greedy routing in uniform small world rings: Label: en
Reconstruction for the Potts model: Label: en
Mixing time for the solid-on-solid model: Label: en
Random walks on polytopes and an affine interior point method for linear programming: Label: en
How long does it take to catch a wild kangaroo?: Label: en
MaxMin allocation via degree lower-bounded arborescences: Label: en
Multiplicative updates outperform generic no-regret learning in congestion games: Label: en
On the convergence of regret minimization dynamics in concave games: Label: en
Intrinsic robustness of the price of anarchy: Label: en
A new approach to auctions and resilient mechanism design: Label: en
Conditional hardness for satisfiable 3-CSPs: Label: en
Randomly supported independence and resistance: Label: en
Bit-probe lower bounds for succinct data structures: Label: en
On the complexity of communication complexity: Label: en
Finding, minimizing, and counting weighted subgraphs: Label: en
Hadwiger's conjecture is decidable: Label: en
Fault-tolerant spanners for general graphs: Label: en
Affiliation networks: Label: en
The detectability lemma and quantum gap amplification: Label: en
Efficient discrete-time simulations of continuous-time quantum query algorithms: Label: en
Short seed extractors against quantum storage: Label: en
Quantum algorithms using the curvelet transform: Label: en
On the complexity of differentially private data release: Label: en
Differential privacy and robust statistics: Label: en
Private coresets: Label: en
Universally utility-maximizing privacy mechanisms: Label: en
A constructive proof of the Lovász local lemma: Label: en
Public-key cryptosystems from the worst-case shortest vector problem: Label: en
Non-monotone submodular maximization under matroid and knapsack constraints: Label: en
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems: Label: en
CSP gaps and reductions in the lasserre hierarchy: Label: en
Sherali-adams relaxations of the matching polytope: Label: en
Integrality gaps for Sherali-Adams relaxations: Label: en
Homology flows, cohomology cuts: Label: en
Max cut and the smallest eigenvalue: Label: en
Twice-ramanujan sparsifiers: Label: en