158 search results - page 31 / 32 » Depth as Randomness Deficiency |
DAC
2008
ACM
14 years 6 months ago
2008
ACM
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
IMSCCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Background: TATA box is one of the most important transcription factor binding sites. But the exact sequences of TATA box are still not very clear. Results: In this study, we cond...
SPAA
1997
ACM
13 years 9 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
EUROCRYPT
2007
Springer
13 years 9 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
FOCS
2007
IEEE
13 years 9 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...