Umesh V. Vazirani
Affiliations: University of California, Berkeley, USA
According to our database^{1},
Umesh V. Vazirani
authored at least 95 papers
between 1983 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on scopus.com

on viaf.org

on id.loc.gov

on dnb.info

on isni.org

on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
2023
Publickey pseudoentanglement and the hardness of learning ground state entanglement structure.
CoRR, 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
2022
CoRR, 2022
CoRR, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
2021
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device.
J. ACM, 2021
CoRR, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
2020
CoRR, 2020
Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract).
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
2019
Games Econ. Behav., 2019
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality.
CoRR, 2019
Commun. ACM, 2019
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019
2018
CoRR, 2018
Approximate LowWeight Check Codes and Circuit Lower Bounds for Noisy Ground States.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
2014
Proc. Natl. Acad. Sci. USA, 2014
Proceedings of the Innovations in Theoretical Computer Science, 2014
An efficient algorithm for finding the ground state of 1D gapped local hamiltonians.
Proceedings of the Innovations in Theoretical Computer Science, 2014
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014
Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
Nat., 2013
A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games.
Proceedings of the Innovations in Theoretical Computer Science, 2013
Proceedings of the Innovations in Theoretical Computer Science, 2013
2012
Certifiable quantum dice: or, true random number generation secure against quantum adversaries.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
2011
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2009
J. ACM, 2009
J. ACM, 2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
2008
Commun. ACM, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Algorithms.
McGrawHill, ISBN: 9780073523408, 2008
2007
J. ACM, 2007
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
2006
J. ACM, 2006
2005
Proceedings of the High Performance Computing, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
2004
Comb., 2004
2003
SIAM J. Comput., 2003
2002
J. ACM, 2002
2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001
2000
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the IEEE International Symposium on Circuits and Systems, 2000
Proceedings of the Theoretical Aspects of Computer Science, 2000
1999
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
1998
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998
1997
SIAM J. Comput., 1997
SIAM J. Comput., 1997
SIAM J. Comput., 1997
1996
Algorithmica, 1996
1995
Inf. Comput., March, 1995
SIGACT News, 1995
Electron. Colloquium Comput. Complex., 1995
1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
MIT Press, ISBN: 9780262111935, 1994
1993
Discret. Math., 1993
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.
Comb. Probab. Comput., 1993
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993
1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
SIAM J. Comput., 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988
1987
Strong communication complexity or generating quasirandom sequences form two communicating semirandom sources.
Comb., 1987
Comb., 1987
Algorithmica, 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1986
J. Comput. Syst. Sci., 1986
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
1985
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
Towards a Strong Communication Complexity Theory or Generating QuasiRandom Sequences from Two Communicating Slightlyrandom Sources (Extended Abstract)
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
J. Algorithms, 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
Generating QuasiRandom Sequences from SlightlyRandom Sources (Extended Abstract)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
Proceedings of the Advances in Cryptology, 1984
1983
Theor. Comput. Sci., 1983
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
Reducibility Among Protocols.
Proceedings of the Advances in Cryptology, 1983
RSA Bits are 732+epsilon Secure.
Proceedings of the Advances in Cryptology, 1983