default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid J. Haglin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j17]David Haglin, David Trimm, Pak Chung Wong:
Big graph visual analytics. Inf. Vis. 16(3): 155-156 (2017)- [c27]Roberto Gioiosa, Antonino Tumeo
, Jian Yin, Thomas Warfel, David J. Haglin, Santiago Betelú:
Exploring DataVortex Systems for Irregular Applications. IPDPS 2017: 409-418 - [c26]Vito Giovanni Castellana, Marco Minutoli, Shreyansh Bhatt, Khushbu Agarwal, Arthur Bleeker, John Feo, Daniel G. Chavarría-Miranda, David J. Haglin:
High-Performance Data Analytics Beyond the Relational and Graph Data Models with GEMS. IPDPS Workshops 2017: 1029-1038 - 2016
- [c25]Roberto Gioiosa, Thomas Warfel, Jian Yin, Antonino Tumeo, David J. Haglin:
Exploring Data Vortex Network Architectures. Hot Interconnects 2016: 84-91 - [c24]Daniel G. Chavarría-Miranda, Vito Giovanni Castellana, Alessandro Morari, David Haglin, John Feo:
GraQL: A Query Language for High-Performance Attributed Graph Databases. IPDPS Workshops 2016: 1453-1462 - 2015
- [j16]Vito Giovanni Castellana, Alessandro Morari, Jesse Weaver, Antonino Tumeo, David Haglin, Oreste Villa, John Feo:
In-Memory Graph Databases for Web-Scale Data. Computer 48(3): 24-35 (2015) - [c23]Alessandro Morari, Jesse Weaver, Oreste Villa, David J. Haglin, Antonino Tumeo, Vito Giovanni Castellana, John Feo:
High-Performance, Distributed Dictionary Encoding of RDF Datasets. CLUSTER 2015: 250-253 - [c22]Pak Chung Wong, David J. Haglin, David Gillen, Daniel G. Chavarría-Miranda, Vito Giovanni Castellana, Cliff A. Joslyn, Alan R. Chappell, Song Zhang:
A visual analytics paradigm enabling trillion-edge graph exploration. LDAV 2015: 57-64 - [p1]Alessandro Morari, Vito Giovanni Castellana, Oreste Villa, Jesse Weaver, Gregory Todd Williams, David J. Haglin, Antonino Tumeo, John Feo:
GEMS: Graph Database Engine for Multithreaded Systems. Big Data - Algorithms, Analytics, and Applications 2015: 139-156 - 2014
- [j15]Alessandro Morari, Vito Giovanni Castellana, Oreste Villa, Antonino Tumeo, Jesse Weaver, David Haglin, Sutanay Choudhury, John Feo:
Scaling Semantic Graph Databases in Size and Performance. IEEE Micro 34(4): 16-26 (2014) - [j14]Jesse Weaver, Vito Giovanni Castellana, Alessandro Morari, Antonino Tumeo, Sumit Purohit, Alan R. Chappell, David Haglin, Oreste Villa, Sutanay Choudhury, Karen Schuchardt, John Feo:
Toward a data scalable solution for facilitating discovery of science resources. Parallel Comput. 40(10): 682-696 (2014) - [c21]Eric L. Goodman, Edward Jimenez, Cliff A. Joslyn, David J. Haglin, Sinan Al-Saffar, Dirk Grunwald:
Optimizing graph queries with graph joins and Sprinkle SPARQL. IEEE BigData 2014: 17-24 - 2013
- [c20]Alessandro Morari, Vito Giovanni Castellana, David Haglin, John Feo, Jesse Weaver, Antonino Tumeo, Oreste Villa:
Accelerating semantic graph databases on commodity clusters. IEEE BigData 2013: 768-772 - [c19]David J. Haglin, Robert Adolf, Greg E. Mackey:
Scalable, Multithreaded, Partially-in-Place Sorting. IPDPS Workshops 2013: 1656-1664 - [c18]David J. Haglin, Lawrence B. Holder:
Combining Structure and Property Values is Essential for Graph-Based Learning. IPDPS Workshops 2013: 1899-1904 - [c17]Alan R. Chappell, Sutanay Choudhury, John Feo, David J. Haglin, Alessandro Morari, Sumit Purohit, Karen Schuchardt, Antonino Tumeo, Jesse Weaver, Oreste Villa:
Toward a data scalable solution for facilitating discovery of scientific data resources. DISCS@SC 2013: 55-60 - [c16]Cliff A. Joslyn, Sutanay Choudhury, David Haglin, Bill Howe, Bill Nickless, Bryan Olsen:
Massive scale cyber traffic analysis: a driver for graph database research. GRADES 2013: 3 - [c15]Vito Giovanni Castellana, Antonino Tumeo, Oreste Villa, David Haglin, John Feo:
Composing Data Parallel Code for a SPARQL Graph Engine. SocialCom 2013: 691-699 - 2012
- [c14]Chad Scherrer, Mahantesh Halappanavar, Ambuj Tewari, David Haglin:
Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems. ICML 2012 - [c13]Chad Scherrer, Ambuj Tewari, Mahantesh Halappanavar, David Haglin:
Feature Clustering for Accelerating Parallel Coordinate Descent. NIPS 2012: 28-36 - [c12]Nurul Fariza Zulkurnain, David J. Haglin, John A. Keane:
DisClose: Discovering Colossal Closed Itemsets via a Memory Efficient Compact Row-Tree. PAKDD Workshops 2012: 141-156 - [c11]Mahantesh Halappanavar, Yousu Chen, Robert Adolf, David Haglin, Zhenyu Huang, Mark Rice:
Towards Efficient N-x Contingency Selection Using Group betweenness Centrality. SC Companion 2012: 273-282 - [i1]Chad Scherrer, Ambuj Tewari, Mahantesh Halappanavar, David J. Haglin:
Feature Clustering for Accelerating Parallel Coordinate Descent. CoRR abs/1212.4174 (2012) - 2011
- [c10]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 - [c9]Jace Mogill, David J. Haglin:
Toward Parallel Document Clustering. IPDPS Workshops 2011: 1700-1709 - [c8]Robert Adolf, David Haglin, Mahantesh Halappanavar, Yousu Chen, Zhenyu Huang:
Techniques for Improving Filters in Power Grid Contingency Analysis. MLDM 2011: 599-611 - 2010
- [c7]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
2000 – 2009
- 2009
- [j13]David J. Haglin, Kenneth R. Mayes, Anna M. Manning, John Feo, John R. Gurd, Mark J. Elliot, John A. Keane:
Factors affecting the performance of parallel mining of minimal unique itemsets on diverse architectures. Concurr. Comput. Pract. Exp. 21(9): 1131-1158 (2009) - 2008
- [j12]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) - [c6]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 - 2007
- [c5]Dan Singer, David J. Haglin, Anna M. Manning:
Towards Average Case Analysis of Itemset Mining. DMIN 2007: 127-133 - [c4]David J. Haglin, Anna M. Manning:
On Minimal Infrequent Itemset Mining. DMIN 2007: 141-147 - 2005
- [j11]David J. Haglin, Richard J. Roiger, Jon Hakkila, Timothy W. Giblin:
A tool for public analysis of scientific data. Data Sci. J. 4: 39-53 (2005) - [c3]Anna M. Manning, David J. Haglin:
A New Algorithm for Finding Minimal Sample Uniques for Use in Statistical Disclosure Assessment. ICDM 2005: 290-297 - 2002
- [j10]David J. Haglin:
Technical report column. SIGACT News 33(2): 29-30 (2002) - 2001
- [j9]David J. Haglin, Rupert W. Ford:
The Message-Minimizing Load Redistribution Problem. J. Univers. Comput. Sci. 7(4): 291-306 (2001) - 2000
- [j8]David J. Haglin:
Technical Report Column. SIGACT News 31(1): 14-15 (2000)
1990 – 1999
- 1999
- [j7]Marty J. Wolf, David J. Haglin:
An Optimal Algorithm for Finding All Convex Subsets in Tournaments. Ars Comb. 52 (1999) - [j6]David J. Haglin:
Technical report column. SIGACT News 30(4): 22-24 (1999) - 1996
- [j5]David J. Haglin, Marty J. Wolf:
On Convex Subsets in Tournaments. SIAM J. Discret. Math. 9(1): 63-70 (1996) - 1995
- [j4]David J. Haglin:
Bipartite Expander Matching is in NC. Parallel Process. Lett. 5: 413-420 (1995) - [c2]David J. Haglin, John A. Kaliski:
A Massively Parallel Transportation Solution. PDPTA 1995: 231-239 - 1993
- [j3]Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin:
Approximating Matchings in Parallel. Inf. Process. Lett. 46(3): 115-118 (1993) - 1992
- [j2]David J. Haglin:
Approximating Maximum 2-CNF Satisfiability. Parallel Process. Lett. 2: 181-187 (1992) - 1991
- [j1]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) - [c1]David J. Haglin:
On a fast deterministic parallel approximate matching algorithm. SPDP 1991: 774-777
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
