8 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.DC2011★ 8 cited
Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks
Vlad Slavici, Daniel Kunkle, Gene Cooperman +1
Finite state automata (FSA) are ubiquitous in computer science. Two of the most important algorithms for FSA processing are the conversion of a non-deterministic finite automaton (…
cs.DC2010★ 2 cited
Roomy: A System for Space Limited Computations
Daniel Kunkle
There are numerous examples of problems in symbolic algebra in which the required storage grows far beyond the limitations even of the distributed RAM of a cluster. Often this limi…