Vijay Vazirani (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Vijay Vazirani" in English language version.

refsWebsite

Global rank English rank

4doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

3ams.org

451^st place

277^th place

2books.google.com

3^rd place

2acm.org

1,185^th place

840^th place

2web.archive.org

1^st place

1d-nb.info

511^th place

7,028^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

1informs.org

low place

9,066^th place

acm.org

fellows.acm.org

ACM Fellows Award: Umesh Vazirani Archived December 14, 2007, at the Wayback Machine.
ACM Fellows Award: Vijay Vazirani Archived December 14, 2007, at the Wayback Machine.

ams.org

mathscinet.ams.org

Jerrum, Mark R.; Valiant, Leslie G.; Vazirani, Vijay V. (1986), "Random generation of combinatorial structures from a uniform distribution", Theoretical Computer Science, 43 (2–3): 169–188, doi:10.1016/0304-3975(86)90174-X, MR 0855970. See Bubley, Russ (2001), Randomized algorithms: approximation, generation, and counting, CPHC/BCS Distinguished Dissertations, Springer-Verlag, p. 120, doi:10.1007/978-1-4471-0695-1, ISBN 1-85233-325-1, MR 1986183, S2CID 266744010; Goldreich, Oded (2008), Computational Complexity: A Conceptual Perspective, Cambridge University Press, p. 229, ISBN 9781139472746.
Jain, Kamal; Vazirani, Vijay V. (2001), "Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation", Journal of the ACM, 48 (2): 274–296, doi:10.1145/375827.375845, MR 1868717, S2CID 2353092. See Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University Press, p. 191, ISBN 9781139498173
Mehta, Aranyak; Saberi, Amin; Vazirani, Umesh; Vazirani, Vijay (2007), "AdWords and generalized online matching", Journal of the ACM, 54 (5): Art. 22, 19, doi:10.1145/1284320.1284321, MR 2359264, S2CID 8481313

books.google.com

Jerrum, Mark R.; Valiant, Leslie G.; Vazirani, Vijay V. (1986), "Random generation of combinatorial structures from a uniform distribution", Theoretical Computer Science, 43 (2–3): 169–188, doi:10.1016/0304-3975(86)90174-X, MR 0855970. See Bubley, Russ (2001), Randomized algorithms: approximation, generation, and counting, CPHC/BCS Distinguished Dissertations, Springer-Verlag, p. 120, doi:10.1007/978-1-4471-0695-1, ISBN 1-85233-325-1, MR 1986183, S2CID 266744010; Goldreich, Oded (2008), Computational Complexity: A Conceptual Perspective, Cambridge University Press, p. 229, ISBN 9781139472746.
Jain, Kamal; Vazirani, Vijay V. (2001), "Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation", Journal of the ACM, 48 (2): 274–296, doi:10.1145/375827.375845, MR 1868717, S2CID 2353092. See Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University Press, p. 191, ISBN 9781139498173

d-nb.info

Deutsche Nationalbibliothek

doi.org

Three of his papers on the subject from that time period have over 100 citations each, according to Google scholar: Micali, S.; Vazirani, V. V. (1980), "An $\scriptstyle O({\sqrt {|V|}}\cdot |E|)$ algorithm for finding maximum matching in general graphs", Proc. 21st IEEE Symp. Foundations of Computer Science, pp. 17–27, doi:10.1109/SFCS.1980.12, S2CID 27467816; Mulmuley, Ketan; Vazirani, Umesh V.; Vazirani, Vijay V. (1987), "Matching is as easy as matrix inversion", Combinatorica, 7 (1): 105–113, doi:10.1007/BF02579206, S2CID 47370049; Karp, Richard M.; Vazirani, Umesh V.; Vazirani, Vijay V. (1990), "An optimal algorithm for on-line bipartite matching", Proc 22nd ACM Symp. Theory of Computing, pp. 352–358, doi:10.1145/100216.100262, ISBN 0-89791-361-2, S2CID 822904.
Jerrum, Mark R.; Valiant, Leslie G.; Vazirani, Vijay V. (1986), "Random generation of combinatorial structures from a uniform distribution", Theoretical Computer Science, 43 (2–3): 169–188, doi:10.1016/0304-3975(86)90174-X, MR 0855970. See Bubley, Russ (2001), Randomized algorithms: approximation, generation, and counting, CPHC/BCS Distinguished Dissertations, Springer-Verlag, p. 120, doi:10.1007/978-1-4471-0695-1, ISBN 1-85233-325-1, MR 1986183, S2CID 266744010; Goldreich, Oded (2008), Computational Complexity: A Conceptual Perspective, Cambridge University Press, p. 229, ISBN 9781139472746.
Jain, Kamal; Vazirani, Vijay V. (2001), "Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation", Journal of the ACM, 48 (2): 274–296, doi:10.1145/375827.375845, MR 1868717, S2CID 2353092. See Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University Press, p. 191, ISBN 9781139498173
Mehta, Aranyak; Saberi, Amin; Vazirani, Umesh; Vazirani, Vijay (2007), "AdWords and generalized online matching", Journal of the ACM, 54 (5): Art. 22, 19, doi:10.1145/1284320.1284321, MR 2359264, S2CID 8481313

informs.org

meetings.informs.org

"2022 INFORMS Annual Meeting Awards Hall". 2022 INFORMS Annual Meeting. 5 October 2022. Retrieved 2022-11-08.

mathgenealogy.org

Vijay Vazirani at the Mathematics Genealogy Project

semanticscholar.org

api.semanticscholar.org

Three of his papers on the subject from that time period have over 100 citations each, according to Google scholar: Micali, S.; Vazirani, V. V. (1980), "An $\scriptstyle O({\sqrt {|V|}}\cdot |E|)$ algorithm for finding maximum matching in general graphs", Proc. 21st IEEE Symp. Foundations of Computer Science, pp. 17–27, doi:10.1109/SFCS.1980.12, S2CID 27467816; Mulmuley, Ketan; Vazirani, Umesh V.; Vazirani, Vijay V. (1987), "Matching is as easy as matrix inversion", Combinatorica, 7 (1): 105–113, doi:10.1007/BF02579206, S2CID 47370049; Karp, Richard M.; Vazirani, Umesh V.; Vazirani, Vijay V. (1990), "An optimal algorithm for on-line bipartite matching", Proc 22nd ACM Symp. Theory of Computing, pp. 352–358, doi:10.1145/100216.100262, ISBN 0-89791-361-2, S2CID 822904.
Jerrum, Mark R.; Valiant, Leslie G.; Vazirani, Vijay V. (1986), "Random generation of combinatorial structures from a uniform distribution", Theoretical Computer Science, 43 (2–3): 169–188, doi:10.1016/0304-3975(86)90174-X, MR 0855970. See Bubley, Russ (2001), Randomized algorithms: approximation, generation, and counting, CPHC/BCS Distinguished Dissertations, Springer-Verlag, p. 120, doi:10.1007/978-1-4471-0695-1, ISBN 1-85233-325-1, MR 1986183, S2CID 266744010; Goldreich, Oded (2008), Computational Complexity: A Conceptual Perspective, Cambridge University Press, p. 229, ISBN 9781139472746.
Jain, Kamal; Vazirani, Vijay V. (2001), "Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation", Journal of the ACM, 48 (2): 274–296, doi:10.1145/375827.375845, MR 1868717, S2CID 2353092. See Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University Press, p. 191, ISBN 9781139498173
Mehta, Aranyak; Saberi, Amin; Vazirani, Umesh; Vazirani, Vijay (2007), "AdWords and generalized online matching", Journal of the ACM, 54 (5): Art. 22, 19, doi:10.1145/1284320.1284321, MR 2359264, S2CID 8481313

web.archive.org

ACM Fellows Award: Umesh Vazirani Archived December 14, 2007, at the Wayback Machine.
ACM Fellows Award: Vijay Vazirani Archived December 14, 2007, at the Wayback Machine.