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 26 results in range #51 to #76.

On the geometry of graphs with a forbidden minor: Label: en
Finding sparse cuts locally using evolving sets: Label: en
An improved constant-time approximation algorithm for maximum~matchings: Label: en
A fast and efficient algorithm for low-rank approximation of a matrix: Label: en
Numerical linear algebra in the streaming model: Label: en
Approximating edit distance in near-linear time: Label: en
Non-malleability amplification: Label: en
A unified framework for concurrent security: Label: en
Fully homomorphic encryption using ideal lattices: Label: en
Green's conjecture and testing linear-invariant properties: Label: en
Testing juntas nearly optimally: Label: en
On proximity oblivious testing: Label: en
New direct-product testers and 2-query PCPs: Label: en
Near-perfect load balancing by randomized rounding: Label: en
Distributed (δ+1)-coloring in linear (in δ) time: Label: en
A nearly optimal oracle for avoiding failed vertices and edges: Label: en
An efficient algorithm for partial order production: Label: en
The extended BG-simulation and the characterization of t-resiliency: Label: en
On oblivious PTAS's for nash equilibrium: Label: en
Affine dispersers from subspace polynomials: Label: en
Polynomial-time theory of matrix groups: Label: en
Exact learning of random DNF over the uniform distribution: Label: en
3-query locally decodable codes of subexponential length: Label: en
A deterministic reduction for the gap minimum distance problem: Label: en
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes: Label: en
Message passing algorithms and improved LP decoding: Label: en