Sciweavers

3305 search results - page 561 / 661
» Can we Rely on SQL
Sort
View
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev
FOCS
2008
IEEE
14 years 3 months ago
Almost-Natural Proofs
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...
Timothy Y. Chow
INFOCOM
2007
IEEE
14 years 3 months ago
Gossiping with Multiple Messages
Abstract— This paper investigates the dissemination of multiple pieces of information in large networks where users contact each other in a random uncoordinated manner, and users...
Sujay Sanghavi, Bruce Hajek, Laurent Massouli&eacu...
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
14 years 3 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
ISSTA
2006
ACM
14 years 2 months ago
Test input generation for java containers using state matching
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
Willem Visser, Corina S. Pasareanu, Radek Pel&aacu...