First Page | Document Content | |
---|---|---|
![]() Date: 2012-09-30 13:58:10Graph theory Graph coloring NP-complete problems Uzi Vishkin Iterated logarithm Time complexity Algorithm Multi-trials technique Theoretical computer science Mathematics Applied mathematics | Source URL: www.cs.helsinki.fiDownload Document from Source WebsiteShare Document on Facebook |
![]() | A NNALES DE L’I. H. P., SECTION B M ICHAEL B. M ARCUS JAY ROSEN Laws of the iterated logarithm for intersections of random walks on Z4DocID: 1rLtv - View Document |
![]() | A NNALES DE L’I. H. P., SECTION B E NDRE C SÁKI PÁL R ÉVÉSZ JAY ROSEN Functional laws of the iterated logarithm for localDocID: 1qoDI - View Document |
![]() | A NNALES DE L’I. H. P., SECTION B M ICHAEL B. M ARCUS JAY ROSEN Laws of the iterated logarithm for the local times of recurrent random walks on Z2 and of LévyDocID: 1oEmD - View Document |
![]() | Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph LenzenDocID: 1oxw6 - View Document |
![]() | THEORY PROBAB. APPL. Vol. 44, No. 4 A FINITELY ADDITIVE VERSION OF THE LAW OF THE ITERATED LOGARITHM∗ I. EPIFANIDocID: 1mzgX - View Document |