( en | de | ru )

 

Disambiguation of "Sanwalani, Vishal"

Author of the publication

copydeleteadd this publication to your clipboard
The chromatic and clique numbers of random scaled sector graphs.

, , , and . Theor. Comput. Sci., 349 (1): 40-51 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vishal Agrawal

Vishal Suthar

Vishal Vaibhav

Vishal Varma

Vishal Goel

 

Other publications of authors with the same name

MAX k-CUT and Approximating the Chromatic Number of Random Graphs., , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 200-211. Springer, (2003)Fast asynchronous Byzantine agreement and leader election with full information., , , , and . ACM Trans. Algorithms, 6 (4): 68:1-68:28 (2010)Counting connected graphs and hypergraphs via the probabilistic method., , and . Random Struct. Algorithms, 31 (3): 288-329 (2007)Fast asynchronous byzantine agreement and leader election with full information., , , , and . SODA, page 1038-1047. SIAM, (2008)The chromatic and clique numbers of random scaled sector graphs., , , and . Theor. Comput. Sci., 349 (1): 40-51 (2005)MAX k-CUT and approximating the chromatic number of random graphs., , and . Random Struct. Algorithms, 28 (3): 289-322 (2006)Scalable leader election., , , and . SODA, page 990-999. ACM Press, (2006)Counting Connected Graphs and Hypergraphs via the Probabilistic Method., , and . APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 322-333. Springer, (2004)Towards Secure and Scalable Computation in Peer-to-Peer Networks., , , and . FOCS, page 87-98. IEEE Computer Society, (2006)