Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Robin
    Last name: Kothari
    DBLP: 77/8774
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 37  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain 0001, Robin Kothari, Troy Lee.
    Separating Quantum Communication and Approximate Rank.
    32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia 2017 (0) 2017
    Conference paper
    Robin Kothari, Ashwin Nayak.
    Quantum Algorithms for Matrix Multiplication and Product Verification.
    Encyclopedia of Algorithms 2016 (0) 2016
    Conference paper
    Shalev Ben-David, Robin Kothari.
    Randomized query complexity of sabotaged and composed functions.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain 0001, Robin Kothari, Troy Lee, Miklos Santha.
    Separations in communication complexity using cheat sheets and information complexity.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain 0001, Robin Kothari, Troy Lee, Miklos Santha.
    Separations in communication complexity using cheat sheets and information complexity.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Scott Aaronson, Shalev Ben-David, Robin Kothari.
    Separations in query complexity using cheat sheets.
    Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016 2016 (0) 2016
    Conference paper
    Shalev Ben-David, Robin Kothari.
    Randomized query complexity of sabotaged and composed functions.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Journal article
    Stacey Jeffery, Robin Kothari, François Le Gall, Frédéric Magniez.
    Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.
    Algorithmica 2016, Volume 76 (0) 2016
    Conference paper
    Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain 0001, Robin Kothari, Troy Lee.
    Separating quantum communication and approximate rank.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain 0001, Robin Kothari, Troy Lee, Miklos Santha.
    Separations in Communication Complexity Using Cheat Sheets and Information Complexity.
    IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016
    Conference paper
    Andris Ambainis, Martins Kokainis, Robin Kothari.
    Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions.
    31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan 2016 (0) 2016
    Conference paper
    Shalev Ben-David, Robin Kothari.
    Randomized Query Complexity of Sabotaged and Composed Functions.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Journal article
    Robin Kothari, David Racicot-Desloges, Miklos Santha.
    Separating decision tree complexity from subcube partition complexity.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Robin Kothari, David Racicot-Desloges, Miklos Santha.
    Separating Decision Tree Complexity from Subcube Partition Complexity.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA 2015 (0) 2015
    Conference paper
    Scott Aaronson, Shalev Ben-David, Robin Kothari.
    Separations in query complexity using cheat sheets.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Scott Aaronson, Shalev Ben-David, Robin Kothari.
    Separations in query complexity using cheat sheets.
    Electronic Colloquium on Computational Complexity (ECCC) 2015, Volume 22 (0) 2015
    Conference paper
    Robin Kothari.
    Nearly optimal separations between communication (or query) complexity and partitions.
    Electronic Colloquium on Computational Complexity (ECCC) 2015, Volume 22 (0) 2015
    Conference paper
    Robin Kothari.
    Nearly optimal separations between communication (or query) complexity and partitions.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Dominic W. Berry, Andrew M. Childs, Robin Kothari.
    Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters.
    IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015 2015 (0) 2015
    Conference paper
    Robin Kothari.
    An optimal quantum algorithm for the oracle identification problem.
    31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France 2014 (0) 2014
    Conference paper
    Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma.
    Exponential improvement in precision for simulating sparse Hamiltonians.
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Journal article
    Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez.
    A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Rötteler.
    Easy and hard functions for the Boolean hidden shift problem
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Alessandro Cosentino, Robin Kothari, Adam Paetznick.
    Dequantizing read-once quantum formulas
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Stacey Jeffery, Robin Kothari, Frédéric Magniez.
    Nested Quantum Walks with Quantum Data Structures.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Show item 1 to 25 of 37  

    Your query returned 37 matches in the database.