✦ LIBER ✦

Padded lists: set operations in expected θ(log log N) time

✍ Scribed by W. Randolph Franklin

Book ID: 113162070
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 498 KB
Volume: 9
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(79)90060-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to solve the m × n assignme

An algorithm to solve the m × n assignment problem in expected time O(mn log n)

✍ Richard M. Karp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The

Randomized Sorting in O(n log 

Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations

✍ Mikkel Thorup 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

A randomized sorting algorithm is presented, doing as described in the title. Implications of the techniques are discussed for dictionaries and priority queues.

An O(log n) time parallel algorithm for

An O(log n) time parallel algorithm for triangulating a set of points in the plane

✍ Cao An Wang; Yung H. Tsin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 439 KB

An optimum Θ(n log n) algorithm for find

An optimum Θ(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals

✍ Glenn K. Manacher; Terrance A. Mankus; Carol Joan Smith 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 595 KB

[ACM Press the second annual symposium -

[ACM Press the second annual symposium - Yorktown Heights, New York, United States (1986.06.02-1986.06.04)] Proceedings of the second annual symposium on Computational geometry - SCG '86 - A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time

✍ Dwyer, R A 📂 Article 📅 1986 🏛 ACM Press ⚖ 747 KB