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.

Applications of approximation algorithms to cooperative games: Label: en
The complexity of analytic tableaux: Label: en
Regular resolution lower bounds for the weak pigeonhole principle: Label: en
A sharp threshold in proof complexity: Label: en
Sharp threshold and scaling window for the integer partitioning problem: Label: en
Lower bounds for intersection searching and fractional cascading in higher dimension: Label: en
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D: Label: en
One line and ε: Label: en
Smoothed analysis of algorithms: Label: en
Testing of matrix properties: Label: en
Testing metric properties: Label: en
Sampling algorithms: Label: en
Learning DNF in time: Label: en
Learning mixtures of arbitrary gaussians: Label: en
Decidability of string graphs: Label: en
Euler paths in series parallel graphs: Label: en
Computing crossing numbers in quadratic time: Label: en
Fully-dynamic min-cut: Label: en
Randomness efficient identity testing of multivariate polynomials: Label: en
Sparse polynomial approximation in finite fields: Label: en
Excellent codes from modular curves: Label: en
Extractor codes: Label: en
Approximate distance oracles: Label: en
(1 + εΒ) -spanner constructions for general graphs: Label: en
Spatial gossip and resource location protocols: Label: en
Conditions on input vectors for consensus solvability in asynchronous distributed systems: Label: en
Loss-less condensers, unbalanced expanders, and extractors: Label: en
A new protocol and lower bounds for quantum coin flipping: Label: en
Interaction in quantum communication and the complexity of set disjointness: Label: en
Quantum computers that can be simulated classically in polynomial time: Label: en
Stackelberg scheduling strategies: Label: en
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines: Label: en
Algorithms for minimizing weighted flow time: Label: en
Minimax parametric optimization problems and multi-dimensional parametric searching: Label: en
Quantum mechanical algorithms for the nonabelian hidden subgroup problem: Label: en
Quantum algorithms for solvable groups: Label: en
Quantum walks on graphs: Label: en
One-dimensional quantum walks: Label: en
Profit-earning facility location: Label: en
Local search heuristic for k-median and facility location problems: Label: en
Approximating min-sum k -clustering in metric spaces: Label: en
Clustering to minimize the sum of cluster diameters: Label: en
Automata, circuits and hybrids: Label: en
Algorithms, games, and the internet: Label: en
Running time and program size for self-assembled squares: Label: en
Complex tilings: Label: en
Computing with continuous-time Liapunov systems: Label: en
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries: Label: en
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains: Label: en
Compatible sequences and a slow Winkler percolation: Label: en