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.

Multi-way spectral partitioning and higher-order cheeger inequalities: Label: en
Improved smoothed analysis of multiobjective optimization: Label: en
Optimal private halfspace counting via discrepancy: Label: en
Unconditional differentially private mechanisms for linear queries: Label: en
Beating randomized response on incoherent matrices: Label: en
Multiparty computation secure against continual memory leakage: Label: en
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption: Label: en
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels: Label: en
Tight lower bounds for the online labeling problem: Label: en
Strict fibonacci heaps: Label: en
Matroids and integrality gaps for hypergraphic steiner tree relaxations: Label: en
Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator: Label: en
Many sparse cuts via higher eigenvalues: Label: en
From query complexity to computational complexity: Label: en
Probabilistic existence of rigid combinatorial structures: Label: en
Nearly complete graphs decomposable into large induced matchings and their applications: Label: en
Monotone expansion: Label: en
A quantitative gibbard-satterthwaite theorem without neutrality: Label: en
Minimax option pricing meets black-scholes in the limit: Label: en
Rational proofs: Label: en
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities: Label: en
A tight RMR lower bound for randomized mutual exclusion: Label: en
Tight time-space tradeoff for mutual exclusion: Label: en
Global computation in a poorly connected world: Label: en
Tight bounds for distributed functional monitoring: Label: en
Robust satisfiability of constraint satisfaction problems: Label: en
The freezing threshold for k-colourings of a random graph: Label: en
Complexity of counting CSP with complex weights: Label: en
Catching the k-NAESAT threshold: Label: en
Multiplying matrices faster than coppersmith-winograd: Label: en
Improving christofides' algorithm for the s-t path TSP: Label: en
Routing in undirected graphs with constant congestion: Label: en
Design extractors, non-malleable condensers and privacy amplification: Label: en
Characterizing pseudoentropy and simplifying pseudorandom generator constructions: Label: en
Pseudorandom generators with long stretch and low locality from random local one-way functions: Label: en
An analysis of one-dimensional schelling segregation: Label: en
Finding red balloons with split contracts: Label: en
Competitive contagion in networks: Label: en
Making polynomials robust to noise: Label: en
Approximation algorithms and hardness of integral concurrent flow: Label: en
On vertex sparsifiers with Steiner nodes: Label: en
The traveling salesman problem: Label: en
Affine projections of polynomials: Label: en
Reconstruction of depth-4 multilinear circuits with top fan-in 2: Label: en
Separating multilinear branching programs and formulas: Label: en
Jacobian hits circuits: Label: en
Optimal online buffer scheduling for block devices: Label: en
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars: Label: en
Nearly optimal sparse fourier transform: Label: en
Fast matrix rank algorithms and applications: Label: en