[1] Qingpeng Zhang and David Haglin. Semantic similarity between ontologies at different scales. IEEE/CAA Journal of Automatica Sinica, 3(2):132-140, April 2016. [ bib | DOI ]
[2] Vito Giovanni Castellana, Alessandro Morari, Jesse Weaver, Antonino Tumeo, David Haglin, Oreste Villa, and John Feo. In-memory graph databases for web-scale data. IEEE Computer, 48(3):24-35, 2015. [ bib | DOI | http ]
[3] Jesse Weaver, Vito Giovanni Castellana, Alessandro Morari, Antonino Tumeo, Sumit Purohit, Alan Chappell, David Haglin, Oreste Villa, Sutanay Choudhury, Karen Schuchardt, and John Feo. Toward a data scalable solution for facilitating discovery of science resources. Parallel Computing, 40(10):682-696, December 2014. [ bib | DOI | http ]
Keywords: Data intensive
[4] Alessandro Morari, Vito Giovanni Castellana, Oreste Villa, Antonino Tumeo, Jesse Weaver, David Haglin, Sutanay Choudhury, and John Feo. Scaling semantic graph databases in size and performance. Micro, IEEE, 34(4):16-26, July 2014. [ bib | DOI ]
Keywords: Big data;Cluster approximation;Data structures;Distributed processing;Multithreading;Resource description framework;Runtime;Semantics;SPARQL;big data;cluster;data aggregation;data analysis;distributed systems;graph databases;multithreading
[5] D.J. Haglin, K.R. Mayes, A.M. Manning, J Feo, J.R. Gurd, M. Elliot, and J.A. Keane. Factors affecting the performance of parallel mining of minimal unique itemsets on diverse architectures. Concurrency and Computations: Practice and Experience, 21(9):1131-1158, June 2009. [ bib ]
[6] A.M. Manning, D.J. Haglin, and J.A. Keane. A recursive search algorithm for statistical disclosure assessment. Data Mining and Knowledge Discovery, 16(2):165-196, 2008. [ISI Impact Factor (2006): 2.295]. [ bib ]
[7] Jon Hakkila, Timothy W. Giblin, Kevin C. Young, Stephen P. Fuller, Christopher D. Peters, Chris Nolan, Sarah M. Sonnett, David J. Haglin, and Richard. J. Roiger. A gamma-ray burst database of batse spectral lag and internal luminosity function values. The Astrophysical Journal Supplement Series, 169(1):6274, 2007. [ bib ]
[8] David J. Haglin, Richard J. Roiger, Jon Hakkila, and Timothy W. Giblin. A tool for public analysis of scientific data. Data Science Journal, 4:39-53, 2005. [ bib ]
[9] J. Hakkila, T.W. Giblin, K.C. Young, D.J. Haglin, R.J. Roiger, J.P. Norris, and J.D. Bonnell. Probing GRB Jet Structure from Prompt Emission. Chinese Journal of Astronomy and Astrophysics, 5:171-176, 2005. [ bib ]
[10] J. Hakkila, T.W. Giblin, R.J. Roiger, D.J. Haglin, W.S. Paciesas, and C.A. Meegan. How Sample Completeness Affects Gamma-Ray Burst Classification. The Astrophysical Journal, 582:320-329, 2003. [ bib ]
[11] David J. Haglin and Rupert W. Ford. The message-minimizing load redistribution problem. J. UCS, 7(4):291-306, 2001. [ bib ]
[12] Jon Hakkila, David J. Haglin, Geoffrey N. Pendleton, Robert S. Mallozzi, Charles A. Meegan, and Richard Roiger. Gamma-ray burst class properties. Astrophysical Journal, 538:165-180, 2000. [ bib ]
[13] Marty J. Wolf and David J. Haglin. An optimal algorithm for finding all convex subsets in tournaments. Ars Combinatoria, 52:173-179, 1999. [ bib ]
[14] J.A. Kaliski, D.J. Haglin, C. Roos, and T. Terlaky. Logarithmic barrier decomposition methods for semi-infinite programming. International Transactions in Operations Research, 4:285-303, 1997. [ bib | .ps.gz ]
[15] David J. Haglin and Marty J. Wolf. On convex subsets in tournaments. SIAM J. Discrete Math., 9(1):63-70, 1996. [ bib ]
[16] David J. Haglin. Bipartite expander matching is in NC. Parallel Processing Letters, 5:413-420, 1995. [ bib ]
[17] Ted Fischer, Andrew V. Goldberg, David J. Haglin, and Serge A. Plotkin. Approximating matchings in parallel. Inf. Process. Lett., 46(3):115-118, 1993. [ bib ]
[18] David J. Haglin. Approximating maximum 2-cnf satisfiability. Parallel Processing Letters, 2:181-187, 1992. [ bib ]
[19] David J. Haglin and Shankar M. Venkatesan. Approximation and intractability results for the maximum cut problem and its variants. IEEE Trans. Computers, 40(1):110-113, 1991. [ bib ]
[20] WD McCuaig, DJ Haglin, and SM Venkatesan. Contractible edges in 4-connected maximal planar graphs. Ars Combinatoria, 31:199-203, 1991. [ bib ]
[21] DJ Haglin and SM Venkatesan. Approximation results for the two-layer constrained-via-minimization problem. Computer-aided design, 21(7):463-466, 1989. [ bib ]

This file was generated by bibtex2html 1.96.