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 28 results in range #51 to #78.

Explicit capacity-achieving list-decodable codes: Label: en
Edge-disjoint paths in Planar graphs with constant congestion: Label: en
A subset spanner for Planar graphs, with application to subset TSP: Label: en
Provably near-optimal sampling-based algorithms for Stochastic inventory control models: Label: en
Minimizing average flow time on related machines: Label: en
A quasi-PTAS for unsplittable flow on line graphs: Label: en
On the randomness complexity of efficient sampling: Label: en
On basing one-way functions on NP-hardness: Label: en
Deterministic extractors for small-space sources: Label: en
Linear degree extractors and the inapproximability of max clique and chromatic number: Label: en
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction: Label: en
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree: Label: en
Fast convergence to Wardrop equilibria by adaptive sampling methods: Label: en
Truthful randomized mechanisms for combinatorial auctions: Label: en
New upper and lower bounds for randomized and quantum local search: Label: en
A new quantum lower bound method,: Label: en
Bounded-error quantum state identification and exponential separations in communication complexity: Label: en
Learning a circuit by injecting values: Label: en
Searching dynamic point sets in spaces with bounded doubling dimension: Label: en
On the importance of idempotence: Label: en
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform: Label: en
On earthmover distance, metric labeling, and 0-extension: Label: en
Integrality gaps for sparsest cut and minimum linear arrangement problems: Label: en
Hardness of cut problems in directed graphs: Label: en
Logarithmic hardness of the directed congestion minimization problem: Label: en
Narrow proofs may be spacious: Label: en
Extractors for a constant number of polynomially small min-entropy independent sources: Label: en
On adequate performance measures for paging: Label: en