๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Generalized Recursive Sorting Networks

โœ Scribed by T.T. Lee

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
598 KB
Volume
21
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sorting using networks of deques
Sorting using networks of deques
โœ A. Nozaki ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB
Fault-tolerance in balanced sorting netw
Fault-tolerance in balanced sorting networks
โœ Jianli Sun; Jan Gecsei; Eduard Cerny ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer US ๐ŸŒ English โš– 662 KB

Much research has been done on sorting networks but there are very few results concerning their robustness. Our starting point is the balanced sorting network introduced by Dowd et al. and its single-block robust design of Rudolph obtained at the cost of some redundancy and two permuters external to

Two entropies of a generalized sorting p
Two entropies of a generalized sorting problem
โœ Akihiro Nozaki ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 248 KB

In this paper we introduce a class of generalized sorting (ordering) problems called "classifications." To each "classification," we associate two quantities: informational entropy (average information quantity) and operational entropy (measure of computational complexity, that is, number of compari