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.

Efficient probabilistic checkable proofs and applications to approximation: Label: en
A theory of clock synchronization (extended abstract): Label: en
Time-adaptive algorithms for synchronization: Label: en
A coding theorem for distributed computation: Label: en
A functional equation often arising in the analysis of algorithms (extended abstract): Label: en
Non-standard stringology: Label: en
Aligning sequences via an evolutionary tree: Label: en
Fast algorithms for finding randomized strategies in game trees: Label: en
Optimality and domination in repeated games with bounded players: Label: en
Simple strategies for large zero-sum games with applications to complexity theory: Label: en
On complexity as bounded rationality (extended abstract): Label: en
The connectivity carcass of a vertex subset in a graph and its incremental maintenance: Label: en
Alpha-algorithms for incremental planarity testing (preliminary version): Label: en
Efficient splitting off algorithms for graphs: Label: en
Improved data structures for fully dynamic biconnectivity: Label: en
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version): Label: en
Two heads are better than two tapes: Label: en
Augmenting undirected connectivity in RNC and in randomized Õ(n³) time: Label: en
Random sampling in cut, flow, and network design problems: Label: en
Lower bounds on testing membership to a polyhedron by algebraic decision trees: Label: en
Lower bounds for union-split-find related problems on random access machines: Label: en
Decision tree complexity and Betti numbers: Label: en
Lower bounds for parallel linear programming and other problems: Label: en
Balanced allocations (extended abstract): Label: en
Improved algorithms via approximations of probability distributions (extended abstract): Label: en
Tiny families of functions with random properties (preliminary version): Label: en
On construction of k-wise independent random variables: Label: en
A minimal model for secure computation (extended abstract): Label: en
Receipt-free secret-ballot elections (extended abstract): Label: en
Computational complexity and knowledge complexity (extended abstract): Label: en
How to share a function securely: Label: en
An accelerated interior point method whose running time depends only on A (extended abstract): Label: en
On the k-server conjecture: Label: en
Derandomization through approximation: Label: en
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks: Label: en
Pseudorandom generators and learning algorithms for AC: Label: en
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version): Label: en
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version): Label: en
Beyond NP-completeness for problems of bounded width (extended abstract): Label: en
Greed is good: Label: en
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane: Label: en
.879-approximation algorithms for MAX CUT and MAX 2SAT: Label: en
Low degree spanning trees of small weight: Label: en
The independence of the modulo p counting principles: Label: en
The computational complexity of recognizing permutation functions: Label: en
Optimal parallel string algorithms: Label: en
Trade-offs between communication throughput and parallel time: Label: en
The complexity of verification: Label: en
Pseudorandomness for network algorithms: Label: en
A spectral technique for coloring random 3-colorable graphs (preliminary version): Label: en