✦ LIBER ✦

Atomic Snapshots in O ( n log n ) Operations

✍ Scribed by Attiya, Hagit; Rachman, Ophir

Book ID: 118178157
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 838 KB
Volume: 27
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539795279463

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scattering from elongated objects: direc

Scattering from elongated objects: direct solution in O(N log2 N) operations

✍ Michielssen, E.; Boag, A.; Chew, W.C. 📂 Article 📅 1996 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 844 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

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 ^

Padded lists: set operations in expected

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

✍ W. Randolph Franklin 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Variable abstraction in O(n log n) space

✍ J.R. Kennaway; M.R. Sleep 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 604 KB

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