<--- Back to Details
First PageDocument Content
Graph theory / Graph coloring / NP-complete problems / Uzi Vishkin / Iterated logarithm / Time complexity / Algorithm / Multi-trials technique / Theoretical computer science / Mathematics / Applied mathematics
Date: 2012-09-30 13:58:10
Graph theory
Graph coloring
NP-complete problems
Uzi Vishkin
Iterated logarithm
Time complexity
Algorithm
Multi-trials technique
Theoretical computer science
Mathematics
Applied mathematics

Add to Reading List

Source URL: www.cs.helsinki.fi

Download Document from Source Website

Share Document on Facebook

Similar Documents

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 Z4

DocID: 1rLtv - View Document

Mathematical analysis / Probability / Stochastic processes / Random walk / Expected value / Logarithm / Law of the iterated logarithm / Normal distribution

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 local

DocID: 1qoDI - View Document

Stochastic processes / Probability distributions / Logarithms / Probability theory / Random walk / Normal distribution / Stable distribution / Slowly varying function / Law of the iterated logarithm

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évy

DocID: 1oEmD - View Document

Analysis of algorithms / Balls into bins / With high probability / Sorting algorithm / Leader election / Time complexity / Best /  worst and average case / Big O notation / Bin / Iterated logarithm / Randomized algorithm / Asymptotically optimal algorithm

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

DocID: 1oxw6 - View Document

THEORY PROBAB. APPL. Vol. 44, No. 4 A FINITELY ADDITIVE VERSION OF THE LAW OF THE ITERATED LOGARITHM∗ I. EPIFANI

DocID: 1mzgX - View Document