Vishal Sanwalani, Ph.D. - Publications
Affiliations: | 2005 | University of New Mexico, Albuquerque, NM, United States |
Area:
Computer ScienceYear | Citation | Score | |||
---|---|---|---|---|---|
2008 | Kapron B, Kempe D, King V, Saia J, Sanwalani V. Fast asynchronous Byzantine agreement and leader election with full information Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1038-1047. DOI: 10.1145/1824777.1824788 | 0.314 | |||
2007 | Coja-Oghlan A, Moore C, Sanwalani V. Counting connected graphs and hypergraphs via the probabilistic method Random Structures and Algorithms. 31: 288-329. DOI: 10.1002/Rsa.V31:3 | 0.53 | |||
2006 | Kalapala V, Sanwalani V, Clauset A, Moore C. Scale invariance in road networks. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics. 73: 026130. PMID 16605421 DOI: 10.1103/Physreve.73.026130 | 0.444 | |||
2006 | King V, Saia J, Sanwalani V, Vee E. Towards secure and scalable computation in peer-to-peer networks Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 87-96. DOI: 10.1109/FOCS.2006.77 | 0.318 | |||
2006 | Coja-Oghlan A, Moore C, Sanwalani V. MAXk-CUT and approximating the chromatic number of random graphs Random Structures and Algorithms. 28: 289-322. DOI: 10.1002/Rsa.V28:3 | 0.508 | |||
2005 | Díaz J, Sanwalani V, Serna M, Spirakis PG. The chromatic and clique numbers of random scaled sector graphs Theoretical Computer Science. 349: 40-51. DOI: 10.1016/J.Tcs.2005.09.050 | 0.603 | |||
Show low-probability matches. |