H
Haodong Hu
Researcher at Stony Brook University
Publications - 16
Citations - 266
Haodong Hu is an academic researcher from Stony Brook University. The author has contributed to research in topics: Engineering & Computer science. The author has an hindex of 8, co-authored 9 publications receiving 232 citations. Previous affiliations of Haodong Hu include Shanghai University of Finance and Economics & Microsoft.
Papers
More filters
Journal ArticleDOI
An adaptive packed-memory array
Michael A. Bender,Haodong Hu +1 more
TL;DR: The first adaptive packed-memory array (APMA), which automatically adjusts to the input pattern, is given, which has four times fewer element moves per insertion than the traditional PMA and running times that are more than seven times faster.
Proceedings ArticleDOI
Improved bounds on sorting with length-weighted reversals
TL;DR: This work studies the problem of sorting integer sequences and permutations by length-weighted reversals, and gives polynomial-time algorithms to determine the optimal reversal sequence for a restricted but interesting class of sequences and cost functions.
Proceedings ArticleDOI
The cost of cache-oblivious searching
Michael A. Bender,Gerth Stølting Brodal,Rolf Fagerberg,Dongdong Ge,Simai He,Haodong Hu,John Iacono,Alejandro López-Ortiz +7 more
TL;DR: It is shown that for a multilevel memory hierarchy, a simple cache-oblivious structure almost replicates the performance of an optimal parameterized k-level DAM structure, and it is demonstrated that as k grows, the search costs of the optimal k- level DAM search structure and the optimal cache-OBlivious search structure rapidly converge.
Proceedings ArticleDOI
An adaptive packed-memory array
Michael A. Bender,Haodong Hu +1 more
TL;DR: The first adaptive packed-memory array (APMA), which automatically adjusts to the input pattern, is given, which has four times fewer element moves per insertion than the traditional PMA and running times that are more than seven times faster.
Book ChapterDOI
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
TL;DR: The main result in this paper is an optimal polynomial-time algorithm for sorting circular 0/1 sequences when the cost function is additive.