3208 search results - page 457 / 642 » A Lower Bound for Primality |
144
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
184
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
169
click to vote
NDSS
2008
IEEE
16 years 29 days ago
2008
IEEE
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
175
click to vote
TCC
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
163
click to vote
PODC
2005
ACM
16 years 4 days ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...