Asymptotics of divide-and-conquer recurrences: Batcher’s sorting algorithm and a minimum Euclidean matching heuristic

Please use this identifier to cite or link to this item: http://ir.sinica.edu.tw/handle/201000000A/41794

Title:	Asymptotics of divide-and-conquer recurrences: Batcher’s sorting algorithm and a minimum Euclidean matching heuristic
Authors:	Hwang, H. -K.
Issue Date:	1998
Relation:	Algorithmica 22, 529-546
URI:	http://ir.sinica.edu.tw/handle/201000000A/41794
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0178-4617&DestApp=JCR&RQ=IF_CAT_BOXPLOT
Appears in Collections:	統計科學研究所

Show full item record

Last Week
0

Last month

checked on May 13, 2025

Check