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