default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Kunkle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c9]Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen A. 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 A. 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]Daniel Kunkle:
Roomy: a system for space limited computations. PASCO 2010: 22-25 - [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]Daniel Kunkle:
Roomy: A System for Space Limited Computations. CoRR abs/1006.1926 (2010)
2000 – 2009
- 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]Daniel Kunkle, Gene Cooperman:
Twenty-six moves suffice for Rubik's cube. ISSAC 2007: 235-242 - 2006
- [c1]Daniel Kunkle, Donghui Zhang, Gene Cooperman:
Efficient mining of max frequent patterns in a generalized environment. CIKM 2006: 810-811
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
