Sciweavers

10271 search results - page 529 / 2055
» Computer Science
Sort
View
RANDOM
1999
Springer
15 years 11 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
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...
Seth Pettie, Vijaya Ramachandran
SPIN
1999
Springer
15 years 11 months ago
The Engineering of a Model Checker: The Gnu i-Protocol Case Study Revisited
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...
Gerard J. Holzmann
SPIN
1999
Springer
15 years 11 months ago
Embedding a Dialect of SDL in PROMELA
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...
Heikki Tuominen
DL
1998
Springer
105views Digital Library» more  DL 1998»
15 years 11 months ago
Usage Analysis of a Digital Library
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 ...
Steve Jones, Sally Jo Cunningham, Rodger J. McNab
FOCS
1997
IEEE
15 years 11 months ago
On the Power of Quantum Finite State Automata
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...
Attila Kondacs, John Watrous