18 search results - page 1 / 4 » Generating a Random Sink-free Orientation in Quadratic Time |
COMBINATORICS
2002
13 years 4 months ago
2002
A sink-free orientation of a finite undirected graph is a choice of orientation
STOC
2003
ACM
14 years 4 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
ICST
2008
IEEE
13 years 11 months ago
2008
IEEE
Intuition suggests that random testing of object-oriented programs should exhibit a high difference in the number of defects detected by two different runs over the same amount of...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
ICCAD
2004
IEEE
14 years 1 months ago
2004
IEEE
While process variations are becoming more significant with each new IC technology generation, they are often modeled via linear regression models so that the resulting performanc...