David J. Haglin

David Haglin

	2011
23		Eric L. Goodman, Edward Jimenez, David Mizell, Sinan Al-Saffar, Bob Adolf, David J. Haglin: High-Performance Computing Applied to Semantic Databases. ESWC (2) 2011: 31-45
22		Jace Mogill, David J. Haglin: Toward Parallel Document Clustering. IPDPS Workshops 2011: 1700-1709
21		Robert Adolf, David Haglin, Mahantesh Halappanavar, Yousu Chen, Zhenyu Huang: Techniques for Improving Filters in Power Grid Contingency Analysis. MLDM 2011: 599-611
	2010
20		Eric L. Goodman, David J. Haglin, Chad Scherrer, Daniel G. Chavarría-Miranda, Jace Mogill, John Feo: Hashing strategies for the Cray XMT. IPDPS Workshops 2010: 1-8
	2009
19		David J. Haglin, Kenneth R. Mayes, Anna M. Manning, John Feo, John R. Gurd, M. Elliot, John A. Keane: Factors affecting the performance of parallel mining of minimal unique itemsets on diverse architectures. Concurrency and Computation: Practice and Experience 21(9): 1131-1158 (2009)
	2008
18		Paraskevas Yiapanis, David J. Haglin, Anna M. Manning, Ken Mayes, John A. Keane: Variable-grain and dynamic work generation for Minimal Unique Itemset mining. CLUSTER 2008: 33-41
17		Anna M. Manning, David J. Haglin, John A. Keane: A recursive search algorithm for statistical disclosure assessment. Data Min. Knowl. Discov. 16(2): 165-196 (2008)
	2007
16		Dan Singer, David J. Haglin, Anna M. Manning: Towards Average Case Analysis of Itemset Mining. DMIN 2007: 127-133
15		David J. Haglin, Anna M. Manning: On Minimal Infrequent Itemset Mining. DMIN 2007: 141-147
	2005
14		Anna M. Manning, David J. Haglin: A New Algorithm for Finding Minimal Sample Uniques for Use in Statistical Disclosure Assessment. ICDM 2005: 290-297
13		David J. Haglin, Richard J. Roiger, Jon Hakkila, Timothy W. Giblin: A tool for public analysis of scientific data. Data Science Journal 4: 39-53 (2005)
	2002
12		David J. Haglin: Technical report column. SIGACT News 33(2): 29-30 (2002)
	2001
11		David J. Haglin, Rupert W. Ford: The Message-Minimizing Load Redistribution Problem. J. UCS 7(4): 291-306 (2001)
	2000
10		David J. Haglin: Technical Report Column. SIGACT News 31(1): 14-15 (2000)
	1999
9		Marty J. Wolf, David J. Haglin: An Optimal Algorithm for Finding All Convex Subsets in Tournaments. Ars Comb. 52: (1999)
8		David J. Haglin: Technical report column. SIGACT News 30(4): 22-24 (1999)
	1996
7		David J. Haglin, Marty J. Wolf: On Convex Subsets in Tournaments. SIAM J. Discrete Math. 9(1): 63-70 (1996)
	1995
6		David J. Haglin, John A. Kaliski: A Massively Parallel Transportation Solution. PDPTA 1995: 231-239
5		David J. Haglin: Bipartite Expander Matching is in NC. Parallel Processing Letters 5: 413-420 (1995)
	1993
4		Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin: Approximating Matchings in Parallel. Inf. Process. Lett. 46(3): 115-118 (1993)
	1992
3		David J. Haglin: Approximating Maximum 2-CNF Satisfiability. Parallel Processing Letters 2: 181-187 (1992)
	1991
2		David J. Haglin: On a fast deterministic parallel approximate matching algorithm. SPDP 1991: 774-777
1		David J. Haglin, Shankar M. Venkatesan: Approximation and Intractability Results for the Maximum Cut Problem and its Variants. IEEE Trans. Computers 40(1): 110-113 (1991)

Coauthor Index

1	Bob Adolf	[23]
2	Robert Adolf	[21]
3	Sinan Al-Saffar	[23]
4	Daniel G. Chavarría-Miranda	[20]
5	Yousu Chen	[21]
6	M. Elliot	[19]
7	John Feo	[19] [20]
8	Ted Fischer	[4]
9	Rupert W. Ford	[11]
10	Timothy W. Giblin	[13]
11	Andrew V. Goldberg	[4]
12	Eric L. Goodman	[20] [23]
13	John R. Gurd	[19]
14	Jon Hakkila	[13]
15	Mahantesh Halappanavar	[21]
16	Zhenyu Huang	[21]
17	Edward Jimenez	[23]
18	John A. Kaliski	[6]
19	John A. Keane	[17] [18] [19]
20	Anna M. Manning	[14] [15] [16] [17] [18] [19]
21	Kenneth R. Mayes (Ken Mayes)	[18] [19]
22	David Mizell	[23]
23	Jace Mogill	[20] [22]
24	Serge A. Plotkin	[4]
25	Richard J. Roiger	[13]
26	Chad Scherrer	[20]
27	Dan Singer	[16]
28	Shankar M. Venkatesan	[1]
29	Marty J. Wolf	[7] [9]
30	Paraskevas Yiapanis	[18]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page