BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
approxim (3)
major (2)
gate (2)
algorithm (2)
undirect (1)

Stem polylog$ (all stems)

6 papers:

ICALPICALP-1998-PelegR #approximate #communication
Deterministic Polylog Approximation for Minimum Communication Spanning Trees (DP, ER), pp. 670–681.
STOCSTOC-1997-BartalBBT #algorithm
A polylog(n)-Competitive Algorithm for Metrical Task Systems (YB, AB, CB, AT), pp. 711–719.
STOCSTOC-1995-Pan #algorithm #approximate #parallel #polynomial
Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros (VYP), pp. 741–750.
Explicit dispersers with polylog degree (MES, AS, SZ), pp. 479–488.
STOCSTOC-1994-Cohen #approximate
Polylog-time and near-linear work approximation scheme for undirected shortest paths (EC), pp. 16–26.
When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One (RB), pp. 450–454.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.