✦ LIBER ✦

Variable abstraction in O(n log n) space

✍ Scribed by J.R. Kennaway; M.R. Sleep

Book ID: 113163086
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 604 KB
Volume: 24
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90161-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Translation of Turner Combinators in O(n

Translation of Turner Combinators in O(n log n) space

✍ Kohei Noshita 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Remarks on languages acceptable in log l

Remarks on languages acceptable in log log n space

✍ Andrzej Szepietowski 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 209 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 ^

Atomic Snapshots in O ( n log n ) Operat

Atomic Snapshots in O ( n log n ) Operations

✍ Attiya, Hagit; Rachman, Ophir 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 838 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