Dan Kunkle

kunkle@gmail.com

I am a PhD candidate in computer science at the College of Computer and Information Science at Northeastern University in Boston. My adviser is Prof. Gene Cooperman.

A high-level description of our disk-based computing methods are described in a recent CACM Viewpoint article, Solving Rubik's Cube: Disk is the New RAM (PDF). Basically, we seek: methods that efficiently use high-latency storage as main memory; and general techniques for constructing latency tolerant algorithms and software. With these, we make available to the programmer several orders of magnitude more space for the same system price.

I am currently planning on finishing my Ph.D. around the spring of 2009, and will be looking for employment between now and then. If you have a really great job for me, let me know.

My research interests include: high performance and disk-based computing; combinatorial optimization; and adaptive systems.

Links to: my adviser, college, and university.

Publications

A list of my refereed publications follows. See also, my resume, and DBLP entry.

- 2008 -

D. Kunkle and G. Cooperman. ``Solving Rubik's Cube: Disk is the New RAM'', Communications of the ACM (CACM), New York, Volume 51, Issue 4, April 2008.
[Publisher] [PDF]

D. Kunkle, D. Zhang, and G. Cooperman. ``On Mining Frequent Generalized Itemsets and Essential Generalized Association Rules without Redundancy'', Journal of Computer Science and Technology (JCST), P. R. China, 23(1): 77--102, Jan. 2008.
[Publisher] [PDF]

- 2007 -

D. Kunkle and G. Cooperman. ``Twenty-Six Moves Suffice for Rubik's Cube'', Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '07), ACM Press, 235--242, 2007.
[Publisher] [PDF]

E. Robinson, D. Kunkle, and G. Cooperman. ``A Comparative Analysis of Parallel Disk-Based Methods for Enumerating Implicit Graphs'', International Workshop on Parallel Symbolic Computation (PASCO '07), London, Ontario, 78--87, 2007.
[Publisher] [PDF]

- 2006 -

D. Kunkle, D. Zhang, and G. Cooperman. ``Efficient Mining of Max Frequent Patterns in a Generalized Environment'' (poster paper), Proceedings of the 15th ACM Conference on Information and Knowledge Management (CIKM '06), Arlington, VA, 810--811, 2006.
[Publisher] [PDF]

- 2005 -

S. Boyle, S. Guerin, and D. Kunkle. ``An Application of Multi-agent Simulation to Policy Appraisal in the Criminal Justice System in England'', in Computational Economics: A Perspective from Computational Intelligence, Idea Group Publishing, Pennsylvania, 2005.
[Publisher]

- 2004 -

M. Agar, S. Guerin, R. Holmes, and D. Kunkle. ``Epidemiology or Marketing? The Paradigm-Busting Use of Complexity and Ethnography'', Proceedings of Agent 2004: Social Dynamics: Interaction, Reflexivity and Emergence, Chicago, October 2004.
[Publisher] [PDF]

M. Gambhir, S. Guerin, S. Kauffman, D. Kunkle. ``Steps Toward a Possible Theory of Organization'', Proceedings of the International Conference on Complex Systems (ICCS '04), Boston, May, 2004.
[Publisher] [PDF]

S. Guerin and D. Kunkle. ``Emergence of Constraint in Self-organizing Systems'', Journal of Nonlinear Dynamics, Psychology, and Life Sciences, Vol. 8, No. 2, April, 2004.
[Publisher] [PDF]

- 2003 -

P. Anderson, J. Arney, S. Inverso, D. Kunkle, T. Lebo, and C. Merrigan. ``A Genetic Algorithm Search for Improved Halftone Masks''. Proceedings of Artificial Neural Networks in Engineering (ANNIE '03), St. Louis, November 2003.
[Publisher] [PDF]

S. Boyle, S. Guerin, J. Pratt, and D. Kunkle. ``Application of Agent-Based Simulation to Policy Appraisal in the Criminal Justice System in England'', Proceedings of Agent 2003: Challenges in Social Simulation, Chicago, October 2003.
[Publisher]

And...

My fleeting condition of celebrity.

My Erdös number is three. I have published with Erdös-2 authors Peter Anderson and Gene Cooperman.

 

Home page of Dan Kunkle, aka Daniel Kunkle, aka Daniel R. Kunkle - Year 2008.