129 search results - page 5 / 26 » Uniform deterministic dictionaries |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The contribution is twofold. We first show the validity of the conjecture of D
TCS
2010
13 years 2 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
WADS
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, ou...
WAIFI
2007
Springer
14 years 1 months ago
2007
Springer
We propose a simple and efficient deterministic extractor for the (hyper)elliptic curve C, defined over Fq2 , where q is some power of an odd prime. Our extractor, for a given poi...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintain...