𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A hybrid of quicksort with O(n log n) worst case complexity

✍ Scribed by Johannes Röhrich

Book ID
113162441
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
524 KB
Volume
14
Category
Article
ISSN
0020-0190

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 ^

A Unified Formulation for Massively Para
A Unified Formulation for Massively Parallel Rigid Multibody Dynamics of O(log2n) Computational Complexity
✍ Andrés Jaramillo-Botero; Alfons Crespo I. Lorente 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 548 KB

A novel algorithm for the solution of the inverse dynamics problem is presented and augmented to the solution of the equations of motion (EOM) for rigid multibody chains using explicit constraint components of force. The unified model corresponds to an optimal, strictly parallel, time, space, and pr