3208 search results - page 309 / 642 » A Lower Bound for Primality |
162
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
191
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...
186
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
177
click to vote
ACL
2007
15 years 8 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
204
click to vote
CCCG
2007
15 years 8 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...