✦ LIBER ✦

Insertion Sort is O(n log n)

✍ Scribed by Michael A. Bender; Martin Farach-Colton; Miguel A. Mosteiro

Book ID: 105914820
Publisher: Springer
Year: 2006
Tongue: English
Weight: 162 KB
Volume: 39
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-005-1237-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sorting in Average Time $o(\log \,n)$

✍ Ajtai, M.; Karabeg, D.; Komlós, J.; Szemerédi, E. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 991 KB

Sorting Stably, in Place, with O(n log n

Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves

✍ Gianni Franceschini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 299 KB

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 ^

An O(n log n log log n) parallel maximum

An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

✍ Taenam Kim; Kyung-Yong Chwa 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Bounded ordered dictionaries in O(log lo

Bounded ordered dictionaries in O(log log N) time and O(n) space

✍ Kurt Mehlhorn; Stefan Näher 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 456 KB

The cover time of a regular expander is

The cover time of a regular expander is O(n log n)

✍ Ronitt Rubinfeld 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 244 KB