| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Umesh V. Vazirani, Thomas Vidick |
Certifiable quantum dice: or, true random number generation secure against quantum adversaries.  |
STOC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani |
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Quantum State Description Complexity (Invited Talk). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, Satish Rao, Umesh V. Vazirani |
Expander flows, geometric embeddings and graph partitioning. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
Graph partitioning, semidefinite programs, multicommodity flows, expanders, expansion, graph separators |
| 1 | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
Graph partitioning using single commodity flows. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
Edge-separator, single commodity max-flow, sparse cut, spectral method |
| 1 | Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani |
The detectability lemma and quantum gap amplification. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
QMA, detectability lemma, gap amplification, local hamiltonians, quantum computation, PCP |
| 1 | Sanjeev Arora, Satish Rao, Umesh V. Vazirani |
Geometry, flows, and graph-partitioning algorithms. |
Commun. ACM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjoy Dasgupta, Christos H. Papadimitriou, Umesh V. Vazirani |
Algorithms. |
|
2008 |
RDF |
|
| 1 | Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi |
On partitioning graphs via single commodity flows. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
edge-separator, single-commodity max-flow, graph partitioning, spectral method, sparsest cut, matrix exponential |
| 1 | Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani |
AdWords and generalized online matching. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
search engines, online algorithms, Keyword auctions |
| 1 | Umesh V. Vazirani |
Keynote Speech: Quantum Physics and the Nature of Computation. |
IPDPS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani |
Quantum Algorithms for Hidden Nonlinear Structures. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani |
Computing with highly mixed states. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
Quantum Computation |
| 1 | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
Graph partitioning using single commodity flows. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
edge-separator, single commodity max-flow, sparse cut, spectral method |
| 1 | Umesh V. Vazirani |
Quantum Physics and the Nature of Computation. |
HiPC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani |
AdWords and Generalized On-line Matching. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani |
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 81P68, 68Q17 |
| 1 | Sanjeev Arora, Satish Rao, Umesh V. Vazirani |
Expander flows, geometric embeddings and graph partitioning. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson |
The Quantum Communication Complexity of Sampling. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
Dense quantum coding and quantum finite automata. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
Automaton size, quantum computation, encoding, communication complexity, finite automata, quantum communication |
| 1 | Umesh V. Vazirani |
Quantum Algorithms. |
LATIN |
2002 |
DBLP BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Quantum Algorithms. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim van Dam, Michele Mosca, Umesh V. Vazirani |
How Powerful is Adiabatic Quantum Computation?. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani |
Quantum walks on graphs. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani |
Quantum mechanical algorithms for the nonabelian hidden subgroup problem. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao |
Quantum bit escrow. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
quantum bit commitment, quantum coin tossing, quantum cryptography |
| 1 | Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani |
Computing with highly mixed states (extended abstract). |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Fourier Transforms and Quantum Computation. |
Theoretical Aspects of Computer Science |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Go-With-The-Winners Heuristic. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonard J. Schulman, Umesh V. Vazirani |
Molecular Scale Heat Engines and Scalable Quantum Computation. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani |
On Syntactic versus Computational Views of Approximability. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson |
The Quantum Communication Complexity of Sampling. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Quantum Computation and Information. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Introduction to Special Section on Quantum Computation. |
SIAM J. Comput. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh V. Vazirani |
Strengths and Weaknesses of Quantum Computing. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ethan Bernstein, Umesh V. Vazirani |
Quantum Complexity Theory. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Jerrum, Umesh V. Vazirani |
A Mildly Exponential Approximation Algorithm for the Permanent. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani |
On Syntactic versus Computational Views of Approximability |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | David Aldous, Umesh V. Vazirani |
A Markovian Extension of Valiant's Learning Model |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Kearns, Umesh V. Vazirani |
Computational Learning Theory. |
SIGACT News |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani |
On Syntactic versus Computational Views of Approximability |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
computational classes, computational views, approximation classes, MAX SNP, structural results, approximability, syntactic |
| 1 | David Aldous, Umesh V. Vazirani |
``Go With the Winners'' Algorithms |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
worst case running time, Go with the winners, randomized optimization algorithms, rigorous analysis, deep leaf, probability of success, searching, tree, worst-case |
| 1 | Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani |
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Sridhar Rajagopalan, Umesh V. Vazirani |
Simple and efficient leader election in the full information model. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha, Umesh V. Vazirani |
Parallel searching of multidimensional cubes. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | William S. Evans, Sridhar Rajagopalan, Umesh V. Vazirani |
Choosing a Reliable Hypothesis. |
COLT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ethan Bernstein, Umesh V. Vazirani |
Quantum complexity theory. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Jerrum, Umesh V. Vazirani |
A Mildly Exponential Approximation Algorithm for the Permanent |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
worst-case time complexity, matrix permanent, mildly exponential approximation algorithm, permanent |
| 1 | David Aldous, Umesh V. Vazirani |
A Markovian Extension of Valiant's Learning Model (Extended Abstract) |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
weaker probabilistic model, Valiant learning model, Markovian extension, Occam algorithms, performance, classification, random walk |
| 1 | Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani |
An Optimal Algorithm for On-line Bipartite Matching |
STOC |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
The Two-Processor Scheduling Problem is in Random NC. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Linial, Umesh V. Vazirani |
Graph Products and Chromatic Numbers |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
three-chromatic graph, graph, vertices, chromatic numbers, polynomial-time approximation algorithms |
| 1 | Ming Li, Umesh V. Vazirani |
On the Learnability of Finite Automata. |
COLT |
1988 |
DBLP BibTeX RDF |
|
| 1 | Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani |
Polytopes, Permanents and Graphs with Large Factors |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
large factors, k-slice, graph, bipartite graph, polytope, perfect matchings |
| 1 | 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 |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani |
Matching is as easy as matrix inversion. |
Combinatorica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Strong communication complexity or generating quasirandom sequences form two communicating semi-random sources. |
Combinatorica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani |
Matching Is as Easy as Matrix Inversion |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Efficiency Considerations in Using Semi-random Sources (Extended Abstract) |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha, Umesh V. Vazirani |
Generating Quasi-random Sequences from Semi-random Sources. |
J. Comput. Syst. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
Sampling a Population with a Semi-Random Source. |
FSTTCS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
Random Polynomial Time Is Equal to Slightly-random Polynomial Time |
FOCS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani |
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. |
FSTTCS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
The Two-Processor Scheduling Problem is in R-NC |
STOC |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract) |
STOC |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos H. Papadimitriou, Umesh V. Vazirani |
On Two Geometric Problems Related to the Traveling Salesman Problem. |
J. Algorithms |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
Efficient and Secure Pseudo-Random Number Generation. |
CRYPTO |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha, Umesh V. Vazirani |
Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
A Natural Encoding Scheme Proved Probabilistic Polynomial Complete. |
Theor. Comput. Sci. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani |
Reducibility Among Protocols. |
CRYPTO |
1983 |
DBLP BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
RSA Bits are 732+epsilon Secure. |
CRYPTO |
1983 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design |
FOCS |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani, Vijay V. Vazirani |
A Natural Encoding Scheme Proved Probabilistic Polynomial Complete |
FOCS |
1982 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")