✦ LIBER ✦

A generalization of the zero–one principle for sorting algorithms

✍ Scribed by Dorothea Wagner; Frank Wagner

Book ID: 104184161
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 518 KB
Volume: 30
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90050-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for automated line generaliza

Algorithms for automated line generalization 1 based on a natural principle of objective generalization

✍ LI, ZHILIN; OPENSHAW, STAN 📂 Article 📅 1992 🏛 Taylor and Francis Group 🌐 English ⚖ 314 KB

Sorting algorithms for the implementatio

Sorting algorithms for the implementation of a generalized vector product

✍ Alberto Garcia-Diaz; Donald K. Friesen; Donald J. Bagert 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

A generative model for rank data based o

A generative model for rank data based on insertion sort algorithm

✍ Christophe Biernacki; Julien Jacques 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 486 KB

The performance of a selection of sortin

The performance of a selection of sorting algorithms on a general purpose parallel computer

✍ DOWSING, R. D.; MARTINS, W. S. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 2 views

In the past few years, there has been considerable interest in general purpose computational models of parallel computation to enable independent development of hardware and software. The BSP and related models represent an important step in this direction, providing a simple view of a parallel mach

R70-4 Analysis of Algorithms for the Zer

R70-4 Analysis of Algorithms for the Zero–One Programming Problem

✍ Geoffrion, A.M. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 275 KB

Generalization of the minimax principle

Generalization of the minimax principle for model quasispin problems

✍ N. N. Bogolyubov; A. G. Shumovskaya; A. S. Shumovskii 📂 Article 📅 1974 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 369 KB