Daniel Kunkle

According to our database, Daniel Kunkle authored at least 13 papers between 2006 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

An efficient programming model for memory-intensive recursive algorithms using parallel disks.

Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen A. Linton

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks

Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen A. Linton

CoRR, 2011

2010

Fast multiplication of large permutations for disk, flash memory and RAM.

Vlad Slavici, Xin Dong, Daniel Kunkle, Gene Cooperman

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Parallel disk-based computation for large, monolithic binary decision diagrams.

Daniel Kunkle, Vlad Slavici, Gene Cooperman

Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Roomy: a system for space limited computations.

Daniel Kunkle

Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

2009

Harnessing parallel disks to solve Rubik's cube.

Daniel Kunkle, Gene Cooperman

J. Symb. Comput., 2009

Biased tadpoles: a fast algorithm for centralizers in large matrix groups.

Daniel Kunkle, Gene Cooperman

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008

Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy.

Daniel Kunkle, Donghui Zhang, Gene Cooperman

J. Comput. Sci. Technol., 2008

Solving Rubik's Cube: disk is the new RAM.

Daniel Kunkle, Gene Cooperman

Commun. ACM, 2008

A Load Balancing Framework for Clustered Storage Systems.

Daniel Kunkle, Jiri Schindler

Proceedings of the High Performance Computing, 2008

2007

A comparative analysis of parallel disk-based Methods for enumerating implicit graphs.

Eric Robinson, Daniel Kunkle, Gene Cooperman

Proceedings of the Parallel Symbolic Computation, 2007

Twenty-six moves suffice for Rubik's cube.

Daniel Kunkle, Gene Cooperman

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

Efficient mining of max frequent patterns in a generalized environment.

Daniel Kunkle, Donghui Zhang, Gene Cooperman

Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006