Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Kothari, Robin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An optimal quantum algorithm for the oracle identification problem
Robin Kothari
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 482-493
Time-efficient quantum walks for 3-distinctness
Aleksandrs Belovs
,
Andrew M. Childs
,
Stacey Jeffery
,
Robin Kothari
,
Frédéric Magniez
Lecture Notes in Computer Science
7965
, 2013, pp. 105-122
The quantum query complexity of read-many formulas
Andrew M. Childs
,
Shelby Kimmel
,
Robin Kothari
Lecture Notes in Computer Science
7501
, 2012, pp. 337-348
Quantum query complexity of minor-closed graph properties
Andrew M. Childs
,
Robin Kothari
SIAM Journal on Computing
41
(6), 2012, pp. 1426-1450
Improving quantum query complexity of Boolean matrix multiplication using graph collision
Stacey Jeffery
,
Robin Kothari
,
Frédéric Magniez
Lecture Notes in Computer Science
7391
, 2012, pp. 522-532
Quantum query complexity of minor-closed graph properties
Andrew M. Childs
,
Robin Kothari
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 661-672