✦ LIBER ✦

Tree sorting of records in computers

✍ Scribed by S. I. Kozlova

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 121 KB
Volume: 10
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071535

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pattern sorting: A computer-controlled m

Pattern sorting: A computer-controlled multidimensional sorting method using k-d trees

✍ M. Bigos; D. R. Parks; W. A. Moore; L. A. Herzenberg; L. A. Herzenberg 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

Breadth-first traversal of trees and int

Breadth-first traversal of trees and integer sorting in parallel

✍ Calvin C.-Y. Chen; Sajal K. Das 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Implementation of samplesort: A minimal

Implementation of samplesort: A minimal storage tree sort

✍ J. G. Peters; P. S. Kritzinger 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 580 KB

Consistent records in asynchronous compu

Consistent records in asynchronous computations

✍ Roberto Baldoni; Jean-Michel Helary; Michel Raynal 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 212 KB

Parallel computation of matchings in tre

Parallel computation of matchings in trees

✍ Constantine N.K. Osiakwan; Selim G. Akl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 932 KB

We present adaptive parallel algorithms for b-matchings in trees. The algorithms are designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a tree of n vertices, we present an algorithm that determines a maximum cardinality b-m

Computer assisted tabular sorting of phy

Computer assisted tabular sorting of phytosociological data

✍ Dale, M. B. ;Quadraccia, L. 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 780 KB