Prasad Chebolu, Ph.D. - Publications
Affiliations: | 2008 | Carnegie Mellon University, Pittsburgh, PA |
Area:
MathematicsYear | Citation | Score | |||
---|---|---|---|---|---|
2012 | Chebolu P, Cryan M, Martin R. Exact counting of Euler tours for generalized series-parallel graphs Journal of Discrete Algorithms. 10: 110-122. DOI: 10.1016/J.Jda.2011.03.011 | 0.566 | |||
2012 | Chebolu P, Goldberg LA, Martin R. The complexity of approximately counting stable roommate assignments Journal of Computer and System Sciences. 78: 1579-1605. DOI: 10.1016/J.Jcss.2012.02.003 | 0.437 | |||
2010 | Chebolu P, Frieze A, Melsted P. Finding a maximum matching in a sparse random graph in O ( n ) expected time Journal of the Acm. 57: 24. DOI: 10.1145/1734213.1734218 | 0.632 | |||
2009 | Chebolu P, Frieze A, Melsted P, Sorkin GB. Average-case analyses of Vickrey costs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5687: 434-447. DOI: 10.1007/978-3-642-03685-9_33 | 0.497 | |||
2008 | Chebolu P, Frieze A. Hamilton cycles in random lifts of directed graphs Siam Journal On Discrete Mathematics. 22: 520-540. DOI: 10.1137/060670808 | 0.619 | |||
2008 | Chebolu P, Frieze A, Melsted P. Finding a maximum matching in a sparse random graph in O(n) expected time Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5125: 161-172. DOI: 10.1007/978-3-540-70575-8_14 | 0.688 | |||
2008 | Chebolu P, Melsted P. PageRank and the Random Surfer Model Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1010-1018. | 0.587 | |||
2006 | Burgin K, Chebolu P, Cooper C, Frieze AM. Hamilton cycles in random lifts of graphs European Journal of Combinatorics. 27: 1282-1293. DOI: 10.1016/J.Ejc.2006.05.005 | 0.646 | |||
Show low-probability matches. |