A review of stable marriage algorithms

ASIA unversity > 資訊學院 > 行動商務與多媒體應用學系 > 期刊論文 > Item 310904400/4664

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/4664

题名:	A review of stable marriage algorithms
作者:	S. S. Tseng
贡献者:	Department of Information Science and Applications
日期:	1986
上传时间:	2009-11-30 08:03:00 (UTC+0)
出版者:	Asia University
摘要:	Previous research work on parallel sorting and merging is reviewed. The topics covered include: paralel straight insertion sort, odd-even transposition sort, odd-even merge sorting, bitonic merge sorting, min-mid- max merge sorting, k-sorter sorting, implementations of Bather's algorithms on the multiprocessor system, and perfect shuffle and bitonic sorting. Also addressed are: parallel sorting algorithms implemented on the linear- connected computer and mesh-connected computer, the Boolean lattice and Diamond sort, duodirun merging, Valiant's algorithm, the parallel insertion sort, the parallel enumeration sort, the parallel bucket sort, and sorting by VLSI technology.
關聯:	Journal of Management Sciences 3(2):193-206
显示于类别:	[行動商務與多媒體應用學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	423	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.