13214 search results - page 14 / 2643 » Pseudorandomness for network algorithms |
ESORICS
2007
Springer
15 years 5 months ago
2007
Springer
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
105
click to vote
PDP
2007
IEEE
15 years 6 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
101
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
ISQED
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper presents a hybrid BIST architecture and methods for optimizing it to test systems-on-chip in a cost effective way. The proposed self-test architecture can be implemente...