Parallel probabilistic searching and sorting algorithms

被引：0

|

作者：

Kramosil, Ivan

机构：

来源：

Kybernetika | 1990年 / 26卷 / 02期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：17 / 40

相关论文

共 50 条

[31] THE PROBABILISTIC METHOD YIELDS DETERMINISTIC PARALLEL ALGORITHMS
MOTWANI, R
NAOR, JS
NAOR, M
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 49 (03) : 478 - 516
[32] A framework for simple sorting algorithms on parallel disk systems
Rajasekaran, S
THEORY OF COMPUTING SYSTEMS, 2001, 34 (02) : 101 - 114
[33] PARALLEL SORTING ALGORITHMS FOR TIGHTLY COUPLED MULTIPROCESSORS.
Quinn, Michael J.
1600, (06):
[34] A Framework for Simple Sorting Algorithms on Parallel Disk Systems
S. Rajasekaran
Theory of Computing Systems, 2001, 34 : 101 - 114
[35] OPTIMAL AND SUBLOGARITHMIC TIME RANDOMIZED PARALLEL SORTING ALGORITHMS
RAJASEKARAN, S
REIF, JH
SIAM JOURNAL ON COMPUTING, 1989, 18 (03) : 594 - 607
[36] Performance comparison of parallel sorting algorithms on the cluster of workstations
Kyi, Lai Lai Win
Tun, Nay Min
World Academy of Science, Engineering and Technology, 2011, 75 : 344 - 348
[37] Performance Analysis of Parallel Sorting Algorithms using MPI
Durad, Muhammad Hanif
Akhtar, Muhammad Naveed
Irfan-ul-Haq
PROCEEDINGS OF 2014 12TH INTERNATIONAL CONFERENCE ON FRONTIERS OF INFORMATION TECHNOLOGY, 2014, : 202 - 207
[38] OPTIMAL PARALLEL ALGORITHMS FOR COMPUTING CONVEX HULLS AND FOR SORTING
AKL, SG
COMPUTING, 1984, 33 (01) : 1 - 11
[39] An improved reliability bound of a probabilistic parallel integer sorting algorithm
Gerbessiotis, Alexandros V.
INFORMATION PROCESSING LETTERS, 2012, 112 (24) : 976 - 979
[40] A methodological review for the analysis of divide & conquer based sorting/searching algorithms
Abhayankar, Deepak
Ingle, Maya
International Journal of Computer Science Issues, 2011, 8 (5 5-3): : 531 - 533

← 1 2 3 4 5 →