Sciweavers

2996 search results - page 214 / 600
» Numberings and Randomness
Sort
View
CRYPTO
2003
Springer
93views Cryptology» more  CRYPTO 2003»
15 years 11 months ago
Universal Composition with Joint State
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
Ran Canetti, Tal Rabin
STOC
1999
ACM
85views Algorithms» more  STOC 1999»
15 years 11 months ago
A Theorem on Sensitivity and Applications in Private Computation
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
Anna Gál, Adi Rosén
ANSS
2004
IEEE
15 years 10 months ago
Markov Model Based Congestion Control for TCP
The Random Early Detection (RED) scheme for congestion control in TCP is well known over a decade. Due to a number of control parameters in RED, it cannot make acceptable packet-d...
Shan Suthaharan
DAC
2004
ACM
15 years 10 months ago
Probabilistic regression suites for functional verification
Random test generators are often used to create regression suites on-the-fly. Regression suites are commonly generated by choosing several specifications and generating a number o...
Shai Fine, Shmuel Ur, Avi Ziv
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 10 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis