ask others

Robin Kothari

> Home > Persons

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

showing all ?? records

2010 – today

see FAQ

What is the meaning of the colors in the publication lists?

2017
[j4]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/siamcomp/ChildsKS17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/siamcomp/ChildsKS17
Andrew M. Childs, Robin Kothari, Rolando D. Somma:
Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision. SIAM J. Comput. 46(6): 1920-1950 (2017)
[c17]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/coco/AnshuBGJKL17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/coco/AnshuBGJKL17
Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating Quantum Communication and Approximate Rank. Computational Complexity Conference 2017: 24:1-24:33
[i18]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1710-09079
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1710-09079
Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. CoRR abs/1710.09079 (2017)
[i17]
- view
  - electronic edition @ weizmann.ac.il
- export record
  dblp key:
  - journals/eccc/BunKT17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/eccc/BunKT17
Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 24: 169 (2017)
2016
[j3]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/JefferyKGM16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/JefferyKGM16
Stacey Jeffery, Robin Kothari, François Le Gall, Frédéric Magniez:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. Algorithmica 76(1): 1-16 (2016)
[c16]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/coco/AmbainisKK16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/coco/AmbainisKK16
Andris Ambainis, Martins Kokainis, Robin Kothari:
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions. Conference on Computational Complexity 2016: 4:1-4:14
[c15]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/AnshuBBG0KLS16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/AnshuBBG0KLS16
Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564
[c14]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/Ben-DavidK16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/Ben-DavidK16
Shalev Ben-David, Robin Kothari:
Randomized Query Complexity of Sabotaged and Composed Functions. ICALP 2016: 60:1-60:14
[c13]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/AaronsonBK16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/AaronsonBK16
Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. STOC 2016: 863-876
[r1]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - reference/algo/KothariN16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/reference/algo/KothariN16
Robin Kothari, Ashwin Nayak:
Quantum Algorithms for Matrix Multiplication and Product Verification. Encyclopedia of Algorithms 2016: 1673-1677
[i16]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/AnshuBBGJKLS16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/AnshuBBGJKLS16
Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. CoRR abs/1605.01142 (2016)
[i15]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/Ben-DavidK16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/Ben-DavidK16
Shalev Ben-David, Robin Kothari:
Randomized query complexity of sabotaged and composed functions. CoRR abs/1605.09071 (2016)
[i14]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/AnshuBG0KL16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/AnshuBG0KL16
Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating quantum communication and approximate rank. CoRR abs/1611.05754 (2016)
[i13]
- view
  - electronic edition @ hpi-web.de
- export record
  dblp key:
  - journals/eccc/AnshuBBGJKLS16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/eccc/AnshuBBGJKLS16
Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. Electronic Colloquium on Computational Complexity (ECCC) 23: 72 (2016)
[i12]
- view
  - electronic edition @ hpi-web.de
- export record
  dblp key:
  - journals/eccc/Ben-DavidK16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/eccc/Ben-DavidK16
Shalev Ben-David, Robin Kothari:
Randomized query complexity of sabotaged and composed functions. Electronic Colloquium on Computational Complexity (ECCC) 23: 87 (2016)
2015
[c12]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/approx/KothariRS15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/approx/KothariRS15
Robin Kothari, David Racicot-Desloges, Miklos Santha:
Separating Decision Tree Complexity from Subcube Partition Complexity. APPROX-RANDOM 2015: 915-930
[c11]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/BerryCK15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/BerryCK15
Dominic W. Berry, Andrew M. Childs, Robin Kothari:
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. FOCS 2015: 792-809
[i11]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/KothariRS15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/KothariRS15
Robin Kothari, David Racicot-Desloges, Miklos Santha:
Separating decision tree complexity from subcube partition complexity. CoRR abs/1504.01339 (2015)
[i10]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/AaronsonBK15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/AaronsonBK15
Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. CoRR abs/1511.01937 (2015)
[i9]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/Kothari15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/Kothari15
Robin Kothari:
Nearly optimal separations between communication (or query) complexity and partitions. CoRR abs/1512.01210 (2015)
[i8]
- view
  - electronic edition @ hpi-web.de
- export record
  dblp key:
  - journals/eccc/AaronsonBK15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/eccc/AaronsonBK15
Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. Electronic Colloquium on Computational Complexity (ECCC) 22: 175 (2015)
[i7]
- view
  - electronic edition @ hpi-web.de
- export record
  dblp key:
  - journals/eccc/Kothari15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/eccc/Kothari15
Robin Kothari:
Nearly optimal separations between communication (or query) complexity and partitions. Electronic Colloquium on Computational Complexity (ECCC) 22: 195 (2015)
2014
[b1]
- view
  - electronic edition via handle.net
  - electronic edition @ base-search.net
- export record
  dblp key:
  - phd/basesearch/Kothari14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/phd/basesearch/Kothari14
Robin Kothari:
Efficient algorithms in quantum query complexity. University of Waterloo, Ontario, Canada 2014
[c10]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/stacs/Kothari14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stacs/Kothari14
Robin Kothari:
An optimal quantum algorithm for the oracle identification problem. STACS 2014: 482-493
[c9]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/BerryCCKS14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/BerryCCKS14
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma:
Exponential improvement in precision for simulating sparse Hamiltonians. STOC 2014: 283-292
2013
[c8]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/BelovsCJKM13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/BelovsCJKM13
Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Time-Efficient Quantum Walks for 3-Distinctness. ICALP (1) 2013: 105-122
[c7]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/soda/JefferyKM13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/soda/JefferyKM13
Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Nested Quantum Walks with Quantum Data Structures. SODA 2013: 1474-1485
[c6]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/tqc/ChildsKOR13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/tqc/ChildsKOR13
Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and Hard Functions for the Boolean Hidden Shift Problem. TQC 2013: 50-79
[c5]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/tqc/CosentinoKP13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/tqc/CosentinoKP13
Alessandro Cosentino, Robin Kothari, Adam Paetznick:
Dequantizing Read-once Quantum Formulas. TQC 2013: 80-92
[i6]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1302-7316
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1302-7316
Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez:
A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates. CoRR abs/1302.7316 (2013)
[i5]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1304-4642
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1304-4642
Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and hard functions for the Boolean hidden shift problem. CoRR abs/1304.4642 (2013)
[i4]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1304-5164
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1304-5164
Alessandro Cosentino, Robin Kothari, Adam Paetznick:
Dequantizing read-once quantum formulas. CoRR abs/1304.5164 (2013)
[i3]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/Kothari13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/Kothari13
Robin Kothari:
An optimal quantum algorithm for the oracle identification problem. CoRR abs/1311.7685 (2013)
2012
[j2]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/siamcomp/ChildsK12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/siamcomp/ChildsK12
Andrew M. Childs, Robin Kothari:
Quantum Query Complexity of Minor-Closed Graph Properties. SIAM J. Comput. 41(6): 1426-1450 (2012)
[c4]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/esa/ChildsKK12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/esa/ChildsKK12
Andrew M. Childs, Shelby Kimmel, Robin Kothari:
The Quantum Query Complexity of Read-Many Formulas. ESA 2012: 337-348
[c3]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/JefferyKM12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/JefferyKM12
Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. ICALP (1) 2012: 522-532
2011
[c2]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/stacs/ChildsK11
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stacs/ChildsK11
Andrew M. Childs, Robin Kothari:
Quantum query complexity of minor-closed graph properties. STACS 2011: 661-672
[i2]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1112-0548
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1112-0548
Andrew M. Childs, Shelby Kimmel, Robin Kothari:
The quantum query complexity of read-many formulas. CoRR abs/1112.0548 (2011)
2010
[j1]
- view
  - electronic edition @ rintonpress.com
- export record
  dblp key:
  - journals/qic/ChildsK10
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/qic/ChildsK10
Andrew M. Childs, Robin Kothari:
Limitations on the simulation of non-sparse Hamiltonians. Quantum Information & Computation 10(7&8): 669-684 (2010)
[c1]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/tqc/ChildsK10
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/tqc/ChildsK10
Andrew M. Childs, Robin Kothari:
Simulating Sparse Hamiltonians with Star Decompositions. TQC 2010: 94-103
[i1]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1011-1443
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1011-1443
Andrew M. Childs, Robin Kothari:
Quantum query complexity of minor-closed graph properties. CoRR abs/1011.1443 (2010)

Coauthor Index

see FAQ

maintained by

at