Sciweavers

7758 search results - page 30 / 1552
» On the Number of Distributive Lattices
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 2 months ago
Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tr...
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
15 years 5 months ago
Fast Bounds on the Distribution of Smooth Numbers
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Scott T. Parsell, Jonathan Sorenson
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 6 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
CORR
2008
Springer
146views Education» more  CORR 2008»
15 years 2 months ago
A distributed algorithm for computing and updating the process number of a forest
David Coudert, Florian Huc, Dorian Mazauric