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
[1]
Hilfe
Suche: Author="Nayak, Ashwin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recognizing well-parenthesized expressions in the streaming model
Frédéric Magniez
,
Claire Mathieu
,
Ashwin Nayak
SIAM Journal on Computing
43
(6), 2014, pp. 1880-1905
On the hitting times of quantum versus random walks
Frédéric Magniez
,
Ashwin Nayak
,
Peter C. Richter
,
Miklos Santha
Algorithmica
63
(1-2), 2012, pp. 91-116
Search via quantum walk
Frédéric Magniez
,
Ashwin Nayak
,
Jeremie Roland
,
Miklos Santha
SIAM Journal on Computing
40
(1), 2011, pp. 142-164
Improved bounds for the randomized decision tree complexity of recursive majority
Frédéric Magniez
,
Ashwin Nayak
,
Miklos Santha
,
David Xiao
Lecture Notes in Computer Science
6755
, 2011, pp. 317-329
Recognizing well-parenthesized expressions in the streaming model
Frédéric Magniez
,
Claire Mathieu
,
Ashwin Nayak
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 261-270
Direct product theorems for classical communication complexity via subdistribution bounds
Rahul Jain
,
Hartmut Klauck
,
Ashwin Nayak
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 599-608
Search via quantum walk
Frédéric Magniez
,
Ashwin Nayak
,
Jérémie Roland
,
Miklos Santha
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 575-584
Quantum complexity of testing group commutativity
Frédéric Magniez
,
Ashwin Nayak
Algorithmica
48
(3), 2007, pp. 221-232
Limits on the ability of quantum states to convey classical messages
Ashwin Nayak
,
Julia Salzman
Journal of the ACM
53
(1), 2006, pp. 184-206
Quantum complexity of testing group commutativity
Frédéric Magniez
,
Ashwin Nayak
Lecture Notes in Computer Science
3580
, 2005, pp. 1312-1324
Dense quantum coding and quantum finite automata
Andris Ambainis
,
Ashwin Nayak
,
Amnon Ta-Shma
,
Umesh Vazirani
Journal of the ACM
49
(4), 2002, pp. 496-511
On communication over an entanglement-assisted quantum channel
Ashwin Nayak
,
Julia Salzman
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 698-704
One-dimensional quantum walks
Andris Ambainis
,
Erich Bach
,
Ashwin Nayak
,
Ashvin Vishwanath
,
John Watrous
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 37-49
Interaction in quantum communication and the complexity of set disjointness
Hartmut Klauck
,
Ashwin Nayak
,
Amnon Ta-Shma
,
David Zuckerman
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 124-133
Dense quantum coding and a lower bound for 1-way quantum automata
Andris Ambainis
,
Ashwin Nayak
,
Amnon Ta-Shma
,
Umesh Vazirani
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 376-383
The quantum query complexity of approximating the median and related statistics
Ashwin Nayak
,
Felix Wu
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 384-393
Spatial codes and the hardness of string folding problems
Ashwin Nayak
,
Alistair Sinclair
,
Uri Zwick
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 639-648