We study the problem of real-time leader election in a shared memory environment. This problem requires a single processor to be distinguished as the leader and requires an upper bound on the duration for which no leader is present. This processor can be used to provide services which must be continuously available. Coan and Thomas proposed a protocol for this problem which requires O(log N) ti...

We consider the problem of electing a leader on a ring of nameless processors by de terministic and self stabilizing protocols A processor can read the state of its neighbors and its own state to determine if it is enabled A central demon scheduler picks an enabled processor to make an atomic move In an atomic move the processor changes to a new state which is a function of its old state and th...

Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in netwo...

A Distributed system is an application which executes a collection of protocols to coordinate the actions of multiple processes on a network, such that all components cooperate together in order to perform a single or small set of related tasks. It is very difficult for processes to cooperate with each other because of failures of any of the process during communication. The leader election is ...

We conducted surveys before and after the 2012 U.S. Presidential election and prior to the NY City Mayoral election in 2013. The surveys were done using Amazon Turk. This poster describes the results of our analysis of the surveys and predicts the winner of the NY City Mayoral Election.

Positive Empirical Models of Election Fraud (that May Also also Measure Voters’ Strategic Behavior) A landmark in election forensics was the 2012 PNAS paper by Klimek, Yegorov, Hanel and Thurner, which presents the first positive empirical model of election fraud: positive in the sense that the model describes what a fraudulent election looks like and then estimates the amount of fraud (of whic...

Executive Summary The widespread adoption of e-election systems (that is, any IT system used for elections) in Australia has introduced many challenges in ensuring the quality and transparency of our elections. So far the development and operation of e-election systems has been in accordance with standard industry practice. However this is inappropriate for mission critical systems where securi...