 | 2011 |
|---|
| 13 |       | 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 |
|---|
| 12 | | Vlad Slavici,
Xin Dong,
Daniel Kunkle,
Gene Cooperman:
Fast multiplication of large permutations for disk, flash memory and RAM.
ISSAC 2010: 355-362 |
| 11 | | Daniel Kunkle:
Roomy: a system for space limited computations.
PASCO 2010: 22-25 |
| 10 | | Daniel Kunkle,
Vlad Slavici,
Gene Cooperman:
Parallel disk-based computation for large, monolithic binary decision diagrams.
PASCO 2010: 63-72 |
| 9 | | Daniel Kunkle:
Roomy: A System for Space Limited Computations
CoRR abs/1006.1926: (2010) |
| 2009 |
|---|
| 8 | | Daniel Kunkle,
Gene Cooperman:
Biased tadpoles: a fast algorithm for centralizers in large matrix groups.
ISSAC 2009: 223-230 |
| 7 | | Daniel Kunkle,
Gene Cooperman:
Harnessing parallel disks to solve Rubik's cube.
J. Symb. Comput. 44(7): 872-890 (2009) |
| 2008 |
|---|
| 6 | | Daniel Kunkle,
Jiri Schindler:
A Load Balancing Framework for Clustered Storage Systems.
HiPC 2008: 57-72 |
| 5 | | Daniel Kunkle,
Gene Cooperman:
Solving Rubik's Cube: disk is the new RAM.
Commun. ACM 51(4): 31-33 (2008) |
| 4 | | 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) |
| 2007 |
|---|
| 3 | | Daniel Kunkle,
Gene Cooperman:
Twenty-six moves suffice for Rubik's cube.
ISSAC 2007: 235-242 |
| 2 | | Eric Robinson,
Daniel Kunkle,
Gene Cooperman:
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs.
PASCO 2007: 78-87 |
| 2006 |
|---|
| 1 | | Daniel Kunkle,
Donghui Zhang,
Gene Cooperman:
Efficient mining of max frequent patterns in a generalized environment.
CIKM 2006: 810-811 |
Data released under the ODC-BY 1.0 license — See also our legal information page