Resolving message complexity of Byzantine Agreement and beyond

Author(s):  
Z. Galil ◽  
A. Mayer ◽  
Moti Yung
1992 ◽  
Vol 5 (4) ◽  
pp. 175-186 ◽  
Author(s):  
Eugene S. Amdur ◽  
Samuel M. Weber ◽  
Vassos Hadzilacos

2018 ◽  
Vol 30 (4) ◽  
pp. 196-206 ◽  
Author(s):  
Byungho Park ◽  
Rachel L. Bailey

Abstract. In an effort to quantify message complexity in such a way that predictions regarding the moment-to-moment cognitive and emotional processing of viewers would be made, Lang and her colleagues devised the coding system information introduced (or ii). This coding system quantifies the number of structural features that are known to consume cognitive resources and considers it in combination with the number of camera changes (cc) in the video, which supply additional cognitive resources owing to their elicitation of an orienting response. This study further validates ii using psychophysiological responses that index cognitive resource allocation and recognition memory. We also pose two novel hypotheses regarding the confluence of controlled and automatic processing and the effect of cognitive overload on enjoyment of messages. Thirty television advertisements were selected from a pool of 172 (all 20 s in length) based on their ii/cc ratio and ratings for their arousing content. Heart rate change over time showed significant deceleration (indicative of increased cognitive resource allocation) for messages with greater ii/cc ratios. Further, recognition memory worsened as ii/cc increased. It was also found that message complexity increases both automatic and controlled allocations to processing, and that the most complex messages may have created a state of cognitive overload, which was received as enjoyable by the participants in this television context.


Author(s):  
Ittai Abraham ◽  
T-H. Hubert Chan ◽  
Danny Dolev ◽  
Kartik Nayak ◽  
Rafael Pass ◽  
...  

2006 ◽  
Vol 17 (03) ◽  
pp. 677-701 ◽  
Author(s):  
YUNG H. TSIN

A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nhT) message complexity, where hT < n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m ∈ Θ(n2)). The previously best known distributed algorithm has a worst-case O(n3) time and message complexity.


2005 ◽  
Vol 28 (1) ◽  
pp. 75-92 ◽  
Author(s):  
K.Q. Yan ◽  
S.C. Wang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document