The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Umesh V. Vazirani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  68. Quantum Algorithms for Hidden Nonlinear Structures. [Citation Graph (, )][DBLP]


  69. On partitioning graphs via single commodity flows. [Citation Graph (, )][DBLP]


  70. The detectability lemma and quantum gap amplification. [Citation Graph (, )][DBLP]


  71. Geometry, flows, and graph-partitioning algorithms. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002