Umesh V. Vazirani

	2009
74		Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani: The detectability lemma and quantum gap amplification. STOC 2009: 417-426
73		Sanjeev Arora, Satish Rao, Umesh V. Vazirani: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2): (2009)
72		Rohit Khandekar, Satish Rao, Umesh V. Vazirani: Graph partitioning using single commodity flows. J. ACM 56(4): (2009)
	2008
71		Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi: On partitioning graphs via single commodity flows. STOC 2008: 461-470
70		Sanjeev Arora, Satish Rao, Umesh V. Vazirani: Geometry, flows, and graph-partitioning algorithms. Commun. ACM 51(10): 96-105 (2008)
	2007
69		Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani: Quantum Algorithms for Hidden Nonlinear Structures. FOCS 2007: 395-404
68		Umesh V. Vazirani: Keynote Speech: Quantum Physics and the Nature of Computation. IPDPS 2007: 15-16
67		Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani: AdWords and generalized online matching. J. ACM 54(5): (2007)
	2006
66		Rohit Khandekar, Satish Rao, Umesh V. Vazirani: Graph partitioning using single commodity flows. STOC 2006: 385-390
65		Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani: Computing with highly mixed states. J. ACM 53(3): 507-531 (2006)
	2005
64		Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani: AdWords and Generalized On-line Matching. FOCS 2005: 264-273
63		Umesh V. Vazirani: Quantum Physics and the Nature of Computation. HiPC 2005: 6
	2004
62		Sanjeev Arora, Satish Rao, Umesh V. Vazirani: Expander flows, geometric embeddings and graph partitioning. STOC 2004: 222-231
61		Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani: Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem. Combinatorica 24(1): 137-154 (2004)
	2003
60		Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson: The Quantum Communication Complexity of Sampling. SIAM J. Comput. 32(6): 1570-1585 (2003)
	2002
59		Umesh V. Vazirani: Quantum Algorithms. LATIN 2002: 12-13
58		Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense quantum coding and quantum finite automata. J. ACM 49(4): 496-511 (2002)
	2001
57		Umesh V. Vazirani: Quantum Algorithms. FCT 2001: 45-46
56		Wim van Dam, Michele Mosca, Umesh V. Vazirani: How Powerful is Adiabatic Quantum Computation?. FOCS 2001: 279-287
55		Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani: Quantum walks on graphs. STOC 2001: 50-59
54		Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani: Quantum mechanical algorithms for the nonabelian hidden subgroup problem. STOC 2001: 68-74
	2000
53		Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani: Computing with highly mixed states (extended abstract). STOC 2000: 697-704
52		Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao: Quantum bit escrow. STOC 2000: 705-714
51		Umesh V. Vazirani: Fourier Transforms and Quantum Computation. Theoretical Aspects of Computer Science 2000: 208-220
	1999
50		Leonard J. Schulman, Umesh V. Vazirani: Molecular Scale Heat Engines and Scalable Quantum Computation. STOC 1999: 322-329
49		Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. STOC 1999: 376-383
48		Umesh V. Vazirani: Go-With-The-Winners Heuristic. WADS 1999: 217-218
	1998
47		Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson: The Quantum Communication Complexity of Sampling. FOCS 1998: 342-351
46		Umesh V. Vazirani: Quantum Computation and Information. FSTTCS 1998: 367
45		Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata CoRR quant-ph/9804043: (1998)
44		Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani: On Syntactic versus Computational Views of Approximability. SIAM J. Comput. 28(1): 164-191 (1998)
	1997
43		Umesh V. Vazirani: Introduction to Special Section on Quantum Computation. SIAM J. Comput. 26(5): 1409-1410 (1997)
42		Ethan Bernstein, Umesh V. Vazirani: Quantum Complexity Theory. SIAM J. Comput. 26(5): 1411-1473 (1997)
41		Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh V. Vazirani: Strengths and Weaknesses of Quantum Computing. SIAM J. Comput. 26(5): 1510-1523 (1997)
	1996
40		Mark Jerrum, Umesh V. Vazirani: A Mildly Exponential Approximation Algorithm for the Permanent. Algorithmica 16(4/5): 392-401 (1996)
	1995
39		Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani: On Syntactic versus Computational Views of Approximability Electronic Colloquium on Computational Complexity (ECCC) 2(23): (1995)
38		David Aldous, Umesh V. Vazirani: A Markovian Extension of Valiant's Learning Model Inf. Comput. 117(2): 181-186 (1995)
37		Michael J. Kearns, Umesh V. Vazirani: Computational Learning Theory. SIGACT News 26(1): 43-45 (1995)
	1994
36		David Aldous, Umesh V. Vazirani: ``Go With the Winners'' Algorithms FOCS 1994: 492-501
35		Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani: On Syntactic versus Computational Views of Approximability FOCS 1994: 819-830
34		Rafail Ostrovsky, Sridhar Rajagopalan, Umesh V. Vazirani: Simple and efficient leader election in the full information model. STOC 1994: 234-242
33		Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani: Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). STOC 1994: 459-467
	1993
32		William S. Evans, Sridhar Rajagopalan, Umesh V. Vazirani: Choosing a Reliable Hypothesis. COLT 1993: 269-276
31		Ethan Bernstein, Umesh V. Vazirani: Quantum complexity theory. STOC 1993: 11-20
30		Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani: A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Combinatorics, Probability & Computing 2: 271-284 (1993)
29		Miklos Santha, Umesh V. Vazirani: Parallel searching of multidimensional cubes. Discrete Mathematics 114(1-3): 425-433 (1993)
	1992
28		Mark Jerrum, Umesh V. Vazirani: A Mildly Exponential Approximation Algorithm for the Permanent FOCS 1992: 320-326
	1990
27		David Aldous, Umesh V. Vazirani: A Markovian Extension of Valiant's Learning Model (Extended Abstract) FOCS 1990: 392-396
26		Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani: An Optimal Algorithm for On-line Bipartite Matching STOC 1990: 352-358
	1989
25		Nathan Linial, Umesh V. Vazirani: Graph Products and Chromatic Numbers FOCS 1989: 124-128
24		Umesh V. Vazirani, Vijay V. Vazirani: The Two-Processor Scheduling Problem is in Random NC. SIAM J. Comput. 18(6): 1140-1148 (1989)
	1988
23		Ming Li, Umesh V. Vazirani: On the Learnability of Finite Automata. COLT 1988: 359-370
22		Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani: Polytopes, Permanents and Graphs with Large Factors FOCS 1988: 412-421
	1987
21		Umesh V. Vazirani: Efficiency Considerations in Using Semi-random Sources (Extended Abstract) STOC 1987: 160-168
20		Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani: Matching Is as Easy as Matrix Inversion STOC 1987: 345-354
19		Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani: Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2: 113-129 (1987)
18		Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani: Matching is as easy as matrix inversion. Combinatorica 7(1): 105-113 (1987)
17		Umesh V. Vazirani: Strong communication complexity or generating quasirandom sequences form two communicating semi-random sources. Combinatorica 7(4): 375-392 (1987)
	1986
16		Umesh V. Vazirani, Vijay V. Vazirani: Sampling a Population with a Semi-Random Source. FSTTCS 1986: 443-452
15		Miklos Santha, Umesh V. Vazirani: Generating Quasi-random Sequences from Semi-random Sources. J. Comput. Syst. Sci. 33(1): 75-87 (1986)
	1985
14		Umesh V. Vazirani, Vijay V. Vazirani: Random Polynomial Time Is Equal to Slightly-random Polynomial Time FOCS 1985: 417-428
13		Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani: NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. FSTTCS 1985: 496-503
12		Umesh V. Vazirani, Vijay V. Vazirani: The Two-Processor Scheduling Problem is in R-NC STOC 1985: 11-21
11		Umesh V. Vazirani: Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract) STOC 1985: 366-378
	1984
10		Umesh V. Vazirani, Vijay V. Vazirani: Efficient and Secure Pseudo-Random Number Generation. CRYPTO 1984: 193-202
9		Miklos Santha, Umesh V. Vazirani: Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) FOCS 1984: 434-440
8		Umesh V. Vazirani, Vijay V. Vazirani: Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) FOCS 1984: 458-463
7		Christos H. Papadimitriou, Umesh V. Vazirani: On Two Geometric Problems Related to the Traveling Salesman Problem. J. Algorithms 5(2): 231-246 (1984)
	1983
6		Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani: Reducibility Among Protocols. CRYPTO 1983: 137-146
5		Umesh V. Vazirani, Vijay V. Vazirani: RSA Bits are 732+epsilon Secure. CRYPTO 1983: 369-375
4		Umesh V. Vazirani, Vijay V. Vazirani: Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design FOCS 1983: 23-30
3		Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani: Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) FOCS 1983: 453-459
2		Umesh V. Vazirani, Vijay V. Vazirani: A Natural Encoding Scheme Proved Probabilistic Polynomial Complete. Theor. Comput. Sci. 24: 291-300 (1983)
	1982
1		Umesh V. Vazirani, Vijay V. Vazirani: A Natural Encoding Scheme Proved Probabilistic Polynomial Complete FOCS 1982: 40-44

Coauthor Index

1	Dorit Aharonov	[52] [55] [74]
2	David Aldous	[27] [36] [38]
3	Andris Ambainis	[45] [47] [49] [53] [55] [58] [60] [65]
4	Itai Arad	[74]
5	Sanjeev Arora	[33] [62] [70] [73]
6	Charles H. Bennett	[41]
7	Ethan Bernstein	[31] [41] [42]
8	Manuel Blum	[6]
9	Gilles Brassard	[41]
10	Andrew M. Childs	[69]
11	Paul Dagum	[22]
12	Wim van Dam	[56]
13	Martin E. Dyer	[30]
14	William S. Evans	[32]
15	Alan M. Frieze	[30]
16	Michelangelo Grigni	[54] [61]
17	Mark Jerrum	[28] [40]
18	Ravi Kannan (Ravindran Kannan)	[30]
19	Ajai Kapoor	[30]
20	Richard M. Karp	[3] [19] [26]
21	Michael J. Kearns	[37]
22	Julia Kempe	[55]
23	Rohit Khandekar	[66] [72]
24	Sanjeev Khanna	[35] [39] [44]
25	Dexter Kozen	[13]
26	Zeph Landau	[74]
27	Frank Thomson Leighton (Tom Leighton)	[3] [19]
28	Ming Li	[23]
29	Nathan Linial (Nati Linial)	[25]
30	Michael Luby	[22]
31	Aranyak Mehta	[64] [67]
32	Milena Mihail	[22]
33	Michele Mosca	[56]
34	Rajeev Motwani	[35] [39] [44]
35	Ketan Mulmuley	[18] [20]
36	Ashwin Nayak	[45] [49] [58]
37	Lorenzo Orecchia	[71]
38	Rafail Ostrovsky	[34]
39	Christos H. Papadimitriou	[7]
40	Ljubomir Perkovic	[30]
41	Yuval Rabani	[33]
42	Sridhar Rajagopalan	[32] [34]
43	Satish Rao	[62] [66] [70] [72] [73]
44	Ronald L. Rivest	[3] [19]
45	Amin Saberi	[64] [67]
46	Miklos Santha	[9] [15] [29]
47	Leonard J. Schulman	[47] [50] [53] [54] [60] [61] [65] [69] [71]
48	Madhu Sudan	[35] [39] [44]
49	Amnon Ta-Shma	[45] [47] [49] [52] [58] [60]
50	Clark D. Thomborson (Clark D. Thompson)	[3] [19]
51	Monica Vazirani	[54] [61]
52	Vijay V. Vazirani	[1] [2] [3] [4] [5] [6] [8] [10] [12] [13] [14] [16] [18] [19] [20] [24] [26] [64] [67]
53	Nisheeth K. Vishnoi	[71]
54	Avi Wigderson	[47] [60]
55	Andrew Chi-Chih Yao	[52]

Colors in the list of coauthors