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 22 results in range #51 to #72.

Estimating the weight of metric minimum spanning trees in sublinear-time: Label: en
Approximation algorithms for deadline-TSP and vehicle routing with time-windows: Label: en
The all-or-nothing multicommodity flow problem: Label: en
Approximation algorithm for k-node connected subgraphs via critical graphs: Label: en
Exponential separation of quantum and classical one-way communication complexity: Label: en
Sorting and searching in the presence of memory faults (without redundancy): Label: en
Dictionary matching and indexing with errors and don't cares: Label: en
The zero-one principle for switching networks: Label: en
Know thy neighbor's neighbor: Label: en
Adaptive routing with end-to-end feedback: Label: en
On the performance of greedy algorithms in packet buffering: Label: en
New hardness results for congestion minimization and machine scheduling: Label: en
Asymmetric k-center is log ^* n -hard to approximate: Label: en
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection: Label: en
Robust pcps of proximity, shorter pcps and applications to coding: Label: en
Rational secret sharing and multiparty computation: Label: en
Computing Nash equilibria for scheduling on restricted parallel links: Label: en
The complexity of pure Nash equilibria: Label: en
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph: Label: en
Quantum algorithms a decade after shor: Label: en
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems: Label: en
Approximating the cut-norm via Grothendieck's inequality: Label: en