Stem polylogarithm$ (all stems)
6 papers:
ICALP-v2-2015-AlistarhG #polynomial #protocol- Polylogarithmic-Time Leader Election in Population Protocols (DA, RG), pp. 479–491.
STOC-2014-GuruswamiHHSV- Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (VG, PH, JH, SS, GV), pp. 614–623.
STOC-2004-ChlebusKS #worst-case- Collective asynchronous reading with polylogarithmic worst-case overhead (BSC, DRK, AAS), pp. 321–330.
STOC-2003-HalperinK- Polylogarithmic inapproximability (EH, RK), pp. 585–594.
STOC-1995-HenzingerK #algorithm #graph #random- Randomized dynamic graph algorithms with polylogarithmic time per operation (MRH, VK), pp. 519–527.
STOC-1991-BabaiFLS- Checking Computations in Polylogarithmic Time (LB, LF, LAL, MS), pp. 21–31.