1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2007★ 1 cited
Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
Greg Sepesi
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers severa…
cs.DS2007
Dualheap Selection Algorithm: Efficient, Inherently Parallel and Somewhat Mysterious
Greg Sepesi
An inherently parallel algorithm is proposed that efficiently performs selection: finding the K-th largest member of a set of N members. Selection is a common component of many mor…
cs.DS2001
A Dualheap Selection Algorithm - A Call for Analysis
Greg Sepesi
An algorithm is presented that efficiently solves the selection problem: finding the k-th smallest member of a set. Relevant to a divide-and-conquer strategy, the algorithm also pa…