Haodong Hu

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2011
j3		Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz: The Cost of Cache-Oblivious Searching. Algorithmica 61(2): 463-505 (2011)
	2010
c5		Michael A. Bender, Haodong Hu, Bradley C. Kuszmaul: Performance guarantees for B-trees with different-sized atomic keys. PODS 2010: 305-316
	2008
j2		Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan: Improved bounds on sorting by length-weighted reversals. J. Comput. Syst. Sci. 74(5): 744-774 (2008)
	2007
j1		Michael A. Bender, Haodong Hu: An adaptive packed-memory array. ACM Trans. Database Syst. 32(4) (2007)
	2006
c4		Michael A. Bender, Haodong Hu: An adaptive packed-memory array. PODS 2006: 20-29
	2004
c3		Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter: Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. CPM 2004: 32-46
c2		Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan: Improved bounds on sorting with length-weighted reversals. SODA 2004: 919-928
	2003
c1		Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz: The Cost of Cache-Oblivious Searching. FOCS 2003: 271-282

Coauthor Index

1	Michael A. Bender	[j3] [c5] [j2] [j1] [c4] [c3] [c2] [c1]
2	Gerth Stølting Brodal	[j3] [c1]
3	Rolf Fagerberg	[j3] [c1]
4	Dongdong Ge	[j3] [j2] [c3] [c2] [c1]
5	Simai He	[j3] [j2] [c3] [c2] [c1]
6	John Iacono	[j3] [c1]
7	Bradley C. Kuszmaul	[c5]
8	Alejandro López-Ortiz (Alex López-Ortiz)	[j3] [c1]
9	Ron Y. Pinter	[j2] [c3] [c2]
10	Steven Skiena	[j2] [c2]
11	Firas Swidan	[j2] [c3] [c2]

Last update Sat May 25 12:23:17 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page