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.

Huffman coding with unequal letter costs: Label: en
Finding nearest neighbors in growth-restricted metrics: Label: en
Space-efficient approximate Voronoi diagrams: Label: en
Expanders from symmetric codes: Label: en
Randomness conductors and constant-degree lossless expanders: Label: en
Pseudo-random generators for all hardnesses: Label: en
Deterministic sorting in O ( n log log n ) time and linear space: Label: en
Verifying candidate matches in sparse and wildcard matching: Label: en
Optimal finger search trees in the pointer machine: Label: en
Meldable heaps and boolean union-find: Label: en
Wait-free consensus with infinite arrivals: Label: en
On the composition of authenticated byzantine agreement: Label: en
The invasiveness of off-line memory checking: Label: en
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem: Label: en
The price of anarchy is independent of the network topology: Label: en
Crawling on web graphs: Label: en
Tradeoffs in probabilistic packet marking for IP traceback: Label: en
Stability of load balancing algorithms in dynamic adversarial systems: Label: en
Fast, small-space algorithms for approximate histogram maintenance: Label: en
Similarity estimation techniques from rounding algorithms: Label: en
Approximate counting of inversions in a data stream: Label: en
Approximation algorithms for minimum-cost k-vertex connected subgraphs: Label: en
Approximation schemes for preemptive weighted flow time: Label: en
Selfish traffic allocation for server farms: Label: en
Average case analysis for batched disk scheduling and increasing subsequences: Label: en
Cache-oblivious priority queue and graph algorithm applications: Label: en
Approximate clustering via core-sets: Label: en
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant: Label: en
Random sampling and approximation of MAX-CSP problems: Label: en
Clifford algebras and approximating the permanent: Label: en
Models and thresholds for random constraint satisfaction problems: Label: en
Optimal rate-based scheduling on multiprocessors: Label: en
A unified analysis of hot video schedulers: Label: en
A new average case analysis for completion time scheduling: Label: en
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths: Label: en
The complexity of choosing an H -colouring (nearly) uniformly at random: Label: en
On the advantage over a random assignment: Label: en
Dynamic subgraph connectivity with geometric applications: Label: en
Approximating the smallest grammar: Label: en
Learnability beyond AC ⁰: Label: en
On the power of unique 2-prover 1-round games: Label: en
3-manifold knot genus is NP-complete: Label: en
Hardness amplification within NP: Label: en
Computing the betti numbers of arrangements: Label: en
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems: Label: en
Quantum lower bound for the collision problem: Label: en
Algorithmic derandomization via complexity theory: Label: en
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε: Label: en
Relations between average case complexity and approximation complexity: Label: en
Strict polynomial-time in simulation and extraction: Label: en