173 search results - page 4 / 35 » random 1999 |
ICRA
1999
IEEE
13 years 11 months ago
1999
IEEE
CORR
1999
Springer
13 years 7 months ago
1999
Springer
We investigate simplified models of computer data networks and examine how the
RANDOM
1999
Springer
13 years 11 months ago
1999
Springer
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...
SIGCSE
1999
ACM
13 years 11 months ago
1999
ACM
We describe an approach for incorporating randomization in the teaching of data structures and algorithms. The proofs we include are quite simple and can easily
AML
1999
13 years 7 months ago
1999
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...