Vishal Sanwalani
Loading Google Thumbnails...
| 2010 |
|---|
| 9 | Fast asynchronous Byzantine agreement and leader election with full information. Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload |
| 2008 |
|---|
| 8 | Fast asynchronous byzantine agreement and leader election with full information. Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani. SODA 2008, 1038-1047. Web SearchBibTeXDownload |
| 2007 |
|---|
| 7 | Counting connected graphs and hypergraphs via the probabilistic method. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. Random Struct. Algorithms (31): 288-329 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 6 | Towards Secure and Scalable Computation in Peer-to-Peer Networks. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee. FOCS 2006, 87-98. Web SearchBibTeXDownload |
| 5 | MAX k-CUT and approximating the chromatic number of random graphs. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. Random Struct. Algorithms (28): 289-322 (2006). Web SearchBibTeXDownload |
| 4 | Scalable leader election. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee. SODA 2006, 990-999. Web SearchBibTeXDownload |
| 2005 |
|---|
| 3 | The chromatic and clique numbers of random scaled sector graphs. Josep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis. Theor. Comput. Sci. (349): 40-51 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 2 | Counting Connected Graphs and Hypergraphs via the Probabilistic Method. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. APPROX-RANDOM 2004, 322-333. Web SearchBibTeXDownload |
| 2003 |
|---|
| 1 | MAX k-CUT and Approximating the Chromatic Number of Random Graphs. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. ICALP 2003, 200-211. Web SearchBibTeXDownload |
from DBLP and Google Scholar
