Vishal Sanwalani

According to our database, Vishal Sanwalani authored at least 7 papers between 2003 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Fast asynchronous Byzantine agreement and leader election with full information.

Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani

ACM Trans. Algorithms, 2010

2007

Counting connected graphs and hypergraphs via the probabilistic method.

Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani

Random Struct. Algorithms, 2007

2006

MAX <i>k</i>-CUT and approximating the chromatic number of random graphs.

Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani

Random Struct. Algorithms, 2006

Scalable leader election.

Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Towards Secure and Scalable Computation in Peer-to-Peer Networks.

Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

The chromatic and clique numbers of random scaled sector graphs.

Josep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis

Theor. Comput. Sci., 2005

2003

MAX k-CUT and Approximating the Chromatic Number of Random Graphs.

Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003