406 search results - page 35 / 82 » Pseudorandomness and Combinatorial Constructions |
CORR
2011
Springer
13 years 6 months ago
2011
Springer
Abstract—In distributed storage systems built using commodity hardware, it is necessary to store multiple replicas of every data chunk in order to ensure system reliability. In s...
TCBB
2011
13 years 6 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
CSL
2007
Springer
14 years 5 months ago
2007
Springer
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...
GECCO
2008
Springer
14 years 2 days ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
DAGSTUHL
2007
14 years 13 days ago
2007
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher mo...