MAX k-CUT and Approximating the Chromatic Number of Random Graphs. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (ICALP, 2003)

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)

Towards Secure and Scalable Computation in Peer-to-Peer Networks. - Valerie King; Jared Saia; Vishal Sanwalani; Erik Vee (FOCS, 2006)

Scalable leader election. - Valerie King; Jared Saia; Vishal Sanwalani; Erik Vee (SODA, 2006)

MAX k-CUT and approximating the chromatic number of random graphs. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (Random Struct. Algorithms, 2006)

Counting connected graphs and hypergraphs via the probabilistic method. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (Random Struct. Algorithms, 2007)

Fast asynchronous Byzantine agreement and leader election with full information. - Bruce M. Kapron; David Kempe 001; Valerie King; Jared Saia; Vishal Sanwalani (ACM Trans. Algorithms, 2010)