Fast Asynchronous Byzantine Agreement and Leader Election with Full Information (2008)
Bruce Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani
We resolve two long-standing open problems in distributed computation by showing that both Byzantine agreement and Leader Election can be solved in sub-exponential time in the asynchronous full...
Abstract Scalable Leader Election (2008)
Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
In the leader election problem, there are n processors of which (1 ā b)n are good. The problem is to design a distributed protocol to elect a good leader from the set of all processors. In this...
Vishal Sanwalani, Maria Serna, Paul Spirakis
Random scaled sector digraphs were introduced as a generalization of random geometric graphs, to model networks of sensors using optical communication. In this work, we study the value of the...
Towards secure and scalable computation in peer-to-peer networks (2006)
Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem requires that all...
Scale Invariance in Road Networks (2005)
Kalapala, Vamsi, Sanwalani, Vishal, Clauset, Aaron, Moore, Cristopher
We study the topological and geographic structure of the national road networks of the United States, England and Denmark. By transforming these networks into their dual representation, where roads...
Applications of the probabilistic method to random graphs / (2005)
Chapters prepared jointly with other authors.