Vishal Sanwalani, Ph.D.
Affiliations: | 2005 | University of New Mexico, Albuquerque, NM, United States |
Area:
Computer ScienceGoogle:
"Vishal Sanwalani"Parents
Sign in to add mentor| Cristopher Moore | grad student | 2005 | Univ. of New Mexico | |
| (Applications of the probabilistic method to random graphs.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Kapron B, Kempe D, King V, et al. (2008) Fast asynchronous Byzantine agreement and leader election with full information Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1038-1047 |
| Coja-Oghlan A, Moore C, Sanwalani V. (2007) Counting connected graphs and hypergraphs via the probabilistic method Random Structures and Algorithms. 31: 288-329 |
| Kalapala V, Sanwalani V, Clauset A, et al. (2006) Scale invariance in road networks. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics. 73: 026130 |
| King V, Saia J, Sanwalani V, et al. (2006) Towards secure and scalable computation in peer-to-peer networks Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 87-96 |
| Coja-Oghlan A, Moore C, Sanwalani V. (2006) MAXk-CUT and approximating the chromatic number of random graphs Random Structures and Algorithms. 28: 289-322 |
| Díaz J, Sanwalani V, Serna M, et al. (2005) The chromatic and clique numbers of random scaled sector graphs Theoretical Computer Science. 349: 40-51 |