2924 search results - page 161 / 585 » Lower Bounds in Distributed Computing |
103
Voted
ISCAS
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— We study leakage-power reduction in standby random access memories (SRAMs) during data-retention. An SRAM cell requires a minimum critical supply voltage (DRV) above wh...
110
Voted
CONEXT
2005
ACM
15 years 2 months ago
2005
ACM
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
99
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
152
click to vote
CSR
2011
Springer
14 years 4 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
DCC
2002
IEEE
15 years 18 days ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...