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.

Rounding sum-of-squares relaxations: Label: en
Private matchings and allocations: Label: en
Analyze gauss: Label: en
Fingerprinting codes and the price of approximate differential privacy: Label: en
Hitting sets for multilinear read-once algebraic branching programs, in any order: Label: en
Computing with a full memory: Label: en
Communication lower bounds via critical block sensitivity: Label: en
Efficient deterministic approximate counting for low-degree polynomial threshold functions: Label: en
Satisfiability threshold for random regular NAE-SAT: Label: en
The asymptotic k-SAT threshold: Label: en
Optimal error rates for interactive coding I: Label: en
Breaking the quadratic barrier for 3-LCC's over the reals: Label: en
Non-malleable codes from additive combinatorics: Label: en
Every list-decodable code for high noise has abundant near-optimal rate puncturings: Label: en
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements: Label: en
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing: Label: en
Cluster before you hallucinate: Label: en
Multiway cut, pairwise realizable distributions, and descending thresholds: Label: en
Distributed computability in Byzantine asynchronous systems: Label: en
Community detection thresholds and the weak Ramanujan property: Label: en
Zig-zag sort: Label: en
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs: Label: en
Faster all-pairs shortest paths via circuit complexity: Label: en
Approximate distance oracles with constant query time: Label: en
A strongly polynomial algorithm for generalized flow maximization: Label: en
A characterization of strong approximation resistance: Label: en
Analytical approach to parallel repetition: Label: en
Efficient density estimation via piecewise polynomial approximation: Label: en
Smoothed analysis of tensor decompositions: Label: en
Fourier PCA and robust tensor decomposition: Label: en
Parallel algorithms for geometric graph problems: Label: en
Distributed approximation algorithms for weighted shortest paths: Label: en
Approximation algorithms for bipartite matching with metric and geometric costs: Label: en
Constant rank bimatrix games are PPAD-hard: Label: en
Query complexity of approximate nash equilibria: Label: en
Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions: Label: en
Black-box non-black-box zero knowledge: Label: en
On the existence of extractable one-way functions: Label: en
Circuits resilient to additive attacks with applications to secure computation: Label: en
How to delegate computations: Label: en
How to use indistinguishability obfuscation: Label: en
Online local learning via semidefinite programming: Label: en
Bandits with switching costs: Label: en
From average case complexity to improper learning complexity: Label: en
The average sensitivity of an intersection of half spaces: Label: en
Infinite randomness expansion with a constant number of devices: Label: en
Coin flipping of any constant bias implies one-way functions: Label: en
Testing surface area with arbitrary accuracy: Label: en
Embedding and canonizing graphs of bounded genus in logspace: Label: en
Shortest paths on polyhedral surfaces and terrains: Label: en