We study the message complexity of the Election Problem in Hypercube networks , when the processors have a \Sense of Direction", i.e., the capability to distinguish between adjacent communication links according to some globally consistent scheme. We present two models of Sense of Direction, which diier regarding the way the labeling of the links in the network is done: either by matching based...

This study examines the relationships between the 2016 presidential election, indirect sexism and women’s self-perceptions, attitudes and psychological well-being. Specifically, this study employs a two by two factorial design with between-subject factors of salient indirect sexism (salient indirect sexism manipulation or control) and the election (before or after) and investigates whether thos...

This study examines the proposition that political business cycle theory is relevant to private foreign lenders to developing countries. We find that: credit rating agencies downgrade developing country ratings more often in election years, and do so by approximately one rating level; bond spreads are higher in the 60 days before an election compared to spreads in the 60 days after an election;...

This study examines the proposition that political business cycle theory is relevant to private foreign lenders to developing countries. We find that: credit rating agencies downgrade developing country ratings more often in election years, and do so by approximately one rating level; bond spreads are higher in the 60 days before an election compared to spreads in the 60 days after an election;...

Leader election in a network plays an important role in the area of distributed algorithm design. Structural properties of the network as well as presence of direction on the edges of the network greatly affects the complexity of the leader election problem which is primarily measure by the message complexity of the protocol. Our purpose in the present paper is to adapt the existing distributed...

This paper addresses a problem arising in automated proof of invariants of transition systems, for example transition systems modelling distributed programs. Most of the time, the actual properties we want to prove are too weak to hold inductively, and auxiliary invariants need to be introduced. The problem is how to find these extra invariants. We propose a method where we find minimal counter...

The dual graph model describes a radio network that contains both reliable and unreliable links. In recent years, this model has received significant attention by the distributed algorithms community [1,4,8–10,12,14,16]. Due to results in [10], it is known that leader election plays a key role in enabling efficient computation in this difficult setting: a leader can synchronize the network in s...

In an electronic voting protocol, a distributed scheme can be used for forbidding the malicious acts of the voting administrator and the counter during the election, but it cannot prevent them from collaborating to trace the ballots and destroy their privacy after the election. We present a distributed anonymous quantum key distribution scheme and further construct a distributed quantum electio...