83 search results - page 13 / 17 » Linear probing with constant independence |
SODA
2001
ACM
13 years 11 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
WOB
2003
13 years 11 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
CSDA
2008
13 years 10 months ago
2008
Abstract. To study the relationship between the levels of chemical pollutants and the number of daily total hospital admissions for respiratory diseases and to find the effect of t...
ECCC
2010
13 years 10 months ago
2010
![Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/pseudorandom_generators_for_cc0_p_and_the_fourier_spectrum_of_low_degree_polynomials_over_finite_fields_ECCC_2010.jpg "Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields")
In this paper we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp ga...
IACR
2011
12 years 9 months ago
2011
We consider the question of how to store a value secretly on devices that continually leak information about their internal state to an external attacker. If the secret value is s...