Sciweavers

269 search results - page 20 / 54
» random 2001
Sort
View
SODA
2001
ACM
80views Algorithms» more  SODA 2001»
15 years 1 months ago
On the discrete Bak-Sneppen model of self-organized criticality
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
Jérémy Barbay, Claire Kenyon
TC
2008
14 years 11 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
RANDOM
2001
Springer
15 years 4 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
EUROCRYPT
2001
Springer
15 years 4 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley
DNA
2001
Springer
15 years 4 months ago
The Fidelity of the Tag-Antitag System
In the universal DNA chip method, target RNAs are mapped onto a set of DNA tags. Parallel hybridization of these tags with an indexed, complementary antitag array then provides an ...
John A. Rose, Russell J. Deaton, Masami Hagiya, Ak...