✦ LIBER ✦

Parallel complexity of sorting problems

✍ Scribed by Martin Aigner

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 449 KB
Volume: 3
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(82)90010-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The average-case parallel complexity of

The average-case parallel complexity of sorting

✍ Ravi B. Boppana 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 219 KB

The parallel complexity of coarsest set

The parallel complexity of coarsest set partition problems

✍ Sang Cho; Dung T. Huynh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 497 KB

On the complexity of topological sorting

✍ Seinosuka Toda 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 498 KB

On the parallel complexity of hierarchic

On the parallel complexity of hierarchical clustering and CC-complete problems

✍ Raymond Greenlaw; Sanpawat Kantabutra 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

Complexity results for parallel machine

Complexity results for parallel machine problems with a single server

✍ Peter Brucker; Clarisse Dhaenens-Flipo; Sigrid Knust; Svetlana A. Kravchenko; Fr 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 270 KB

Parallel machine problems with a single server are generalizations of classical parallel machine problems. Immediately before processing, each job must be loaded on a machine, which takes a certain set-up time. All these set-ups have to be done by a single server which can handle at most one job at

Methods for parallel computation of comp

Methods for parallel computation of complex flow problems

✍ Tayfun Tezduyar; Yasuo Osawa 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 949 KB

This paper is an overview of some of the methods developed by the Team for Advanced Flow Simulation and Modeling (THAFSM) [http://www.mems.rice.edu/TAFSM/] to support ¯ow simulation and modeling in a number of ``Targeted Challenges''. The ``Targeted Challenges'' include unsteady ¯ows with interfaces