Sciweavers

4498 search results - page 35 / 900
» How to Invent Functions
Sort
View
CP
2004
Springer
14 years 1 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
13 years 11 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
FSE
2006
Springer
117views Cryptology» more  FSE 2006»
13 years 11 months ago
How Far Can We Go on the x64 Processors?
This paper studies the state-of-the-art software optimization methodology for symmetric cryptographic primitives on the new 64-bit x64 processors, AMD Athlon64 (AMD64) and Intel Pe...
Mitsuru Matsui
HT
1991
ACM
13 years 11 months ago
What's Eliza Doing in the Chinese Room? Incoherent Hyperdocuments - and How to Avoid Them
Research on understanding linear texts has shown that comprehension and navigation mainly depend on the reader’s ability to construct a coherent mental representation. While the...
Manfred Thüring, Jörg M. Haake, Jör...
ASIACRYPT
2009
Springer
13 years 11 months ago
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas ...