— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...