| 2012 | ||
|---|---|---|
| c9 | Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen Linton: An efficient programming model for memory-intensive recursive algorithms using parallel disks. ISSAC 2012: 327-334 | |
| 2011 | ||
| i2 | Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen Linton: Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks. CoRR abs/1103.5736 (2011) | |
| 2010 | ||
| c8 | ||
| c7 | Daniel Kunkle, Vlad Slavici, Gene Cooperman: Parallel disk-based computation for large, monolithic binary decision diagrams. PASCO 2010: 63-72 | |
| c6 | Vlad Slavici, Xin Dong, Daniel Kunkle, Gene Cooperman: Fast multiplication of large permutations for disk, flash memory and RAM. ISSAC 2010: 355-362 | |
| i1 | ||
| 2009 | ||
| j3 | Daniel Kunkle, Gene Cooperman: Harnessing parallel disks to solve Rubik's cube. J. Symb. Comput. 44(7): 872-890 (2009) | |
| c5 | Daniel Kunkle, Gene Cooperman: Biased tadpoles: a fast algorithm for centralizers in large matrix groups. ISSAC 2009: 223-230 | |
| 2008 | ||
| j2 | Daniel Kunkle, Gene Cooperman: Solving Rubik's Cube: disk is the new RAM. Commun. ACM 51(4): 31-33 (2008) | |
| j1 | Daniel Kunkle, Donghui Zhang, Gene Cooperman: Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy. J. Comput. Sci. Technol. 23(1): 77-102 (2008) | |
| c4 | Daniel Kunkle, Jiri Schindler: A Load Balancing Framework for Clustered Storage Systems. HiPC 2008: 57-72 | |
| 2007 | ||
| c3 | Eric Robinson, Daniel Kunkle, Gene Cooperman: A comparative analysis of parallel disk-based Methods for enumerating implicit graphs. PASCO 2007: 78-87 | |
| c2 | ||
| 2006 | ||
| c1 | Daniel Kunkle, Donghui Zhang, Gene Cooperman: Efficient mining of max frequent patterns in a generalized environment. CIKM 2006: 810-811 | |
| 1 | Gene Cooperman | |
| 2 | Xin Dong 0004 | |
| 3 | Stephen Linton | |
| 4 | Eric Robinson | |
| 5 | Jiri Schindler | |
| 6 | Vlad Slavici | |
| 7 | Donghui Zhang |
Data released under the ODC-BY 1.0 license — See also our legal information page