Results 1  10
of
1,032,160
Roundbyround fault detectors: Unifying synchrony and asynchrony
 In Proc of the 17th ACM Symp. Principles of Distributed Computing (PODC
, 1998
"... and insights. 1 Introduction For many years, researchers studying synchronous messagepassing systems have considered algorithms composed of rounds of computation. In each round, a process sends a message to the others and then waits to receive messages from the other processes. The synchronous natu ..."
Abstract

Cited by 54 (9 self)
 Add to MetaCart
and insights. 1 Introduction For many years, researchers studying synchronous messagepassing systems have considered algorithms composed of rounds of computation. In each round, a process sends a message to the others and then waits to receive messages from the other processes. The synchronous
The Inherent Price of Indulgence
, 2002
"... This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of roundbyround fault detectors. ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of roundbyround fault detectors.
Proving FirstOrder Equality Theorems with HyperLinking
, 1995
"... Lee and Plaisted recently developed a new automated theorem proving strategy called hyperlinking. As part of his dissertation, Lee developed a roundbyround implementation of the hyperlinking strategy, which competes well with other automated theorem provers on a wide range of theorem proving p ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Lee and Plaisted recently developed a new automated theorem proving strategy called hyperlinking. As part of his dissertation, Lee developed a roundbyround implementation of the hyperlinking strategy, which competes well with other automated theorem provers on a wide range of theorem proving
The Inherent Price of Indulgence
 Proc. 21st ACM Symposium on Principles of Distributed Computing, (PODC'02), ACM Press
, 2002
"... This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of roundbyround fault detectors. ..."
Abstract
 Add to MetaCart
This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of roundbyround fault detectors.
unknown title
"... The paper “A modular approach to sharedmemory consensus, with application to the probabilisticwrite model ” defines a class of ratifier objects as part of its decomposition of consensus. These objects are equivalent to the adoptcommit protocols from Eli Gafni’s “Roundbyround fault detectors (ext ..."
Abstract
 Add to MetaCart
The paper “A modular approach to sharedmemory consensus, with application to the probabilisticwrite model ” defines a class of ratifier objects as part of its decomposition of consensus. These objects are equivalent to the adoptcommit protocols from Eli Gafni’s “Roundbyround fault detectors
Subconsensus tasks: Renaming is weaker than set agreement
 IN SHLOMI DOLEV, EDITOR, DISC, VOLUME 4167 OF LECTURE
, 2006
"... We consider the the relative power of two important synchronization problems: set agreement and renaming. We show that renaming is strictly weaker than set agreement, in a roundbyround model of computation. We introduce new techniques, including previously unknown connections between properties of ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
We consider the the relative power of two important synchronization problems: set agreement and renaming. We show that renaming is strictly weaker than set agreement, in a roundbyround model of computation. We introduce new techniques, including previously unknown connections between properties
Similarity estimation techniques from rounding algorithms
 In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract

Cited by 436 (6 self)
 Add to MetaCart
sensitive hashing scheme for a collection of subsets with the set similarity measure sim(A, B) = A∩B A∪B . We show that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects
The earth is round (p < .05
 American Psychologist
, 1994
"... After 4 decades of severe criticism, the ritual of null hypothesis significance testing—mechanical dichotomous decisions around a sacred.05 criterion—still persists. This article reviews the problems with this practice, including its nearuniversal misinterpretation ofp as the probability that Ho is ..."
Abstract

Cited by 346 (0 self)
 Add to MetaCart
After 4 decades of severe criticism, the ritual of null hypothesis significance testing—mechanical dichotomous decisions around a sacred.05 criterion—still persists. This article reviews the problems with this practice, including its nearuniversal misinterpretation ofp as the probability that Ho is false, the misinterpretation that its complement is the probability of successful replication, and the mistaken assumption that if one rejects Ho one thereby affirms the theory that led to the test. Exploratory data analysis and the use of graphic methods, a steady improvement in and a movement toward standardization in measurement, an emphasis on estimating effect sizes using confidence intervals, and the informed use of available statistical methods is suggested. For generalization, psychologists must finally rely, as has been done in all the older sciences,
Differential Cryptanalysis of DESlike Cryptosystems
 CRYPTO'91
, 1991
"... The Data Encryption Standard (DES) is the best known and most widely used cryptosystem for civilian applications. It was developed at IBM and adopted by the National Buraeu of Standards in the mid 70's, and has successfully withstood all the attacks published so far in the open literature. In t ..."
Abstract

Cited by 676 (9 self)
 Add to MetaCart
. In this paper we develop a new type of cryptanalytic attack which can break the reduced variant of DES with eight rounds in a few minutes on a PC and can break any reduced variant of DES (with up to 15 rounds) in less than 2 56 operations. The new attack can be applied to a variety of DESlike substitution
Vivaldi: A Decentralized Network Coordinate System
 In SIGCOMM
, 2004
"... Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract

Cited by 593 (5 self)
 Add to MetaCart
Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a
Results 1  10
of
1,032,160