| Big Graph Visual Analytics | 1 | 0.37 | 2017 |
| Exploring DataVortex Systems for Irregular Applications | 2 | 0.35 | 2017 |
| Exploring Data Vortex Network Architectures | 0 | 0.34 | 2016 |
| A visual analytics paradigm enabling trillion-edge graph exploration | 3 | 0.39 | 2015 |
| High-Performance, Distributed Dictionary Encoding of RDF Datasets | 0 | 0.34 | 2015 |
| Combining Structure and Property Values is Essential for Graph-Based Learning | 0 | 0.34 | 2013 |
| Scalable, Multithreaded, Partially-in-Place Sorting | 1 | 0.35 | 2013 |
| Feature Clustering for Accelerating Parallel Coordinate Descent | 29 | 1.46 | 2012 |
| DisClose: discovering colossal closed itemsets via a memory efficient compact row-tree | 0 | 0.34 | 2012 |
| Toward Parallel Document Clustering | 1 | 0.36 | 2011 |
| Hashing Strategies for the Cray XMT | 9 | 0.70 | 2010 |
| Factors affecting the performance of parallel mining of minimal unique itemsets on diverse architectures | 4 | 0.47 | 2009 |
| Variable-Grain And Dynamic Work Generation For Minimal Unique Itemset Mining | 2 | 0.47 | 2008 |
| A recursive search algorithm for statistical disclosure assessment | 11 | 0.69 | 2008 |
| On Minimal Infrequent Itemset Mining | 19 | 1.00 | 2007 |
| Towards Average Case Analysis of Itemset Mining | 0 | 0.34 | 2007 |
| A tool for public analysis of scientific data | 1 | 0.41 | 2005 |
| Technical report column | 0 | 0.34 | 2002 |
| The Message-Minimizing Load Redistribution Problem | 1 | 0.43 | 2001 |
| An Optimal Algorithm For Finding All Convex Subsets In Tournaments | 0 | 0.34 | 1999 |
| On Convex Subsets in Tournaments | 6 | 1.31 | 1996 |
| A Massively Parallel Transportation Solution | 0 | 0.34 | 1995 |
| Bipartite Expander Matching is in NC | 0 | 0.34 | 1995 |
| Approximating matchings in parallel | 18 | 2.24 | 1993 |
| Approximating Maximum 2-CNF Satisfiability | 4 | 5.06 | 1992 |
| On a fast deterministic parallel approximate matching algorithm | 0 | 0.34 | 1991 |
