We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
In a recent study a series of model checkers, among which Spin [5], SMV [9], and a newer system called XMC [10], were compared on performance. The measurements used for this compar...
Abstract. We describe a translation from a dialect of SDL-88 to PROMELA, the input language of the SPIN model checker. The fairly straightforward translation covers data types as w...
We analyse transaction logs for a large full-text document collection for Computer Science researchers. We report insights gained from this analysis and identify resulting search ...
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...