𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal parallel selection has complexity O(Log Log N)

✍ Scribed by Miklós Ajtai; János Komlós; W.L. Steiger; Endre Szemerédi

Book ID
103158664
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
503 KB
Volume
38
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Deterministic Construction of Normal B
A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)
✍ Alain Poli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Constructing normal bases of \(G F\left(q^{n}\right)\) over \(G F(q)\) can be done by probabilistic methods as well as deterministic ones. In the following paper we consider only deterministic constructions. As far as we know, the best complexity for probabilistic algorithms is \(O\left(n^{2} \log ^

Nearly optimal distributed edge coloring
Nearly optimal distributed edge coloring in O(log log n) rounds
✍ David A. Grable; Alessandro Panconesi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB

An extremely simple distributed randomized algorithm is presented which with ## Ž . high probability properly edge colors a given graph using 1 q ⌬ colors, where ⌬ is the maximum degree of the graph and is any given positive constant. The algorithm is very Ž fast. In particular, for graphs with su