Fast sequential and parallel algorithms for finding extremal sets

International Journal of Computer Mathematics

Volumn 61, Issue 3-4, 1996, Pages 195-211

  Shen, Hong ^a   Evans, D J ^b  

^a GRIFFITH UNIVERSITY   (Australia)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Algorithms; Extremal set; Partial order; Set inclusion; Word to bit mapping

Indexed keywords

CONSTANT TIME ALGORITHM; EXTREMAL SET; PARTIAL ORDER; SEQUENTIAL ALGORITHMS; SET INCLUSION; WORD TO BIT MAPPING;

DATA PROCESSING; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS; RANDOM ACCESS STORAGE; SET THEORY;

PARALLEL ALGORITHMS;

EID: 0030398757     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169608804512     Document Type: Article

References (14)

1. Bentley, J. L. and Yao, A. C. (1976). An almost optimal algrithm for unbounded searchina. Inform. Process. Lett., 5, 82-87.
2. Cole. R. (1988). Parallel merge sort. SIAM J. Comput., 17, 770-785.
3. Hagerup, T. and Shea, H. (1990). Improved non-conservative sequential and, parallel integer sorting. Inform, Process. Lett., 36 57-63.
4. JáJá, J. (1992). An introduction to Algorithms. Addison-Wesley.
5. Kruskal, C. (1983). Searching, merging and sorting in parallel computation. IEEE Trans. on Computers., C-32, 942-946.
6. Kucera, L. (1982). Parallel computation and conflicts in memory access. Inform. Process. Lett., 14, 93-96.
7. Pritchard, P. (1991). Opportunistic algorithms for eliminating supersets. Acta Informatica, 28, 733-754.
8. Pritchard, P. (1995). On computing the subset graph of a collection of sets. Res. Rep. CIT-95-03, School of Computing and Information Technology, Griffith University.
9. Shen, H. (1990). A fast parallel algorithm for integer sorting. In Advances in Parallel Computing Vol 2: Parallel Computing 89, North-Holland, 331-336.
10. Shen, H. (1995). Fast parallel algorithms for finding extremal sets. In Proc. 1995 International Conference on High Performance Computing. New Delhi, India.
11. 3 N) space. In Proc. Tenth Intern. Symp. Computer and Information Sciences. Ozmer, Turkey.
12. Yellin, D. M. (1992). Algorithms for subset testing and finding maximal sets. In Proc. 3rd ACM-SIAM Symp. Discrete Algorithms, ACM/SIAM, 386-392.
13. Yellin, D. M. (1992). Representing sets with constant time equality testing. J. Algorithms, 13, 353-373.
14. Yellin, D. M. and Jutla, C. S. (1993). Finding extremal sets in less than quadratic time. Inform. Process. Lett., 48, 29-34.