Sciweavers

13214 search results - page 21 / 2643
» Pseudorandomness for network algorithms
Sort
View
103
Voted
NETWORKS
2007
15 years 5 months ago
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
Katerina Asdre, Stavros D. Nikolopoulos
CTRSA
2010
Springer
169views Cryptology» more  CTRSA 2010»
16 years 11 days ago
Hash Function Combiners in TLS and SSL
Abstract. The TLS and SSL protocols are widely used to ensure secure communication over an untrusted network. Therein, a client and server first engage in the so-called handshake ...
Marc Fischlin, Anja Lehmann, Daniel Wagner
DFT
2009
IEEE
106views VLSI» more  DFT 2009»
16 years 8 days ago
Reducing Test Point Area for BIST through Greater Use of Functional Flip-Flops to Drive Control Points
Recently, a new test point insertion method for pseudo-random built-in self-test (BIST) was proposed in [Yang 09] which tries to use functional flip-flops to drive control test po...
Joon-Sung Yang, Benoit Nadeau-Dostie, Nur A. Touba
DATE
2008
IEEE
85views Hardware» more  DATE 2008»
16 years 2 hour ago
Improved Visibility in One-to-Many Trace Concretization
We present an improved algorithm for concretization of abstract eres in abstraction refinement-based invariant checking. The algorithm maps each transition of the abstract error ...
Kuntal Nanshi, Fabio Somenzi