2009 |
25 | EE | Frédéric Magniez,
Ashwin Nayak,
Peter C. Richter,
Miklos Santha:
On the hitting times of quantum versus random walks.
SODA 2009: 86-95 |
2008 |
24 | EE | Rahul Jain,
Hartmut Klauck,
Ashwin Nayak:
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract.
STOC 2008: 599-608 |
23 | EE | Rahul Jain,
Ashwin Nayak,
Yi Su:
A Separation between Divergence and Holevo Information for Ensembles.
TAMC 2008: 526-541 |
22 | EE | Ashwin Nayak:
Quantum Algorithm for Checking Matrix Identities.
Encyclopedia of Algorithms 2008 |
2007 |
21 | EE | Frédéric Magniez,
Ashwin Nayak,
Jeremie Roland,
Miklos Santha:
Search via quantum walk.
STOC 2007: 575-584 |
20 | EE | Frédéric Magniez,
Ashwin Nayak:
Quantum Complexity of Testing Group Commutativity.
Algorithmica 48(3): 221-232 (2007) |
19 | EE | Rahul Jain,
Hartmut Klauck,
Ashwin Nayak:
Direct Product Theorems for Communication Complexity via Subdistribution Bounds.
Electronic Colloquium on Computational Complexity (ECCC) 14(064): (2007) |
18 | EE | Hartmut Klauck,
Ashwin Nayak,
Amnon Ta-Shma,
David Zuckerman:
Interaction in Quantum Communication.
IEEE Transactions on Information Theory 53(6): 1970-1982 (2007) |
2006 |
17 | EE | Ashwin Nayak,
Julia Salzman:
Limits on the ability of quantum states to convey classical messages.
J. ACM 53(1): 184-206 (2006) |
2005 |
16 | EE | Frédéric Magniez,
Ashwin Nayak:
Quantum Complexity of Testing Group Commutativity.
ICALP 2005: 1312-1324 |
2004 |
15 | EE | Iordanis Kerenidis,
Ashwin Nayak:
Weak coin flipping with small bias.
Inf. Process. Lett. 89(3): 131-135 (2004) |
2002 |
14 | EE | Ashwin Nayak,
Julia Salzman:
On Communication over an Entanglement-Assisted Quantum Channel.
IEEE Conference on Computational Complexity 2002: 19 |
13 | EE | Ashwin Nayak,
Julia Salzman:
On communication over an entanglement-assisted quantum channel.
STOC 2002: 698-704 |
12 | EE | Andris Ambainis,
Ashwin Nayak,
Amnon Ta-Shma,
Umesh V. Vazirani:
Dense quantum coding and quantum finite automata.
J. ACM 49(4): 496-511 (2002) |
2001 |
11 | EE | Hartmut Klauck,
Ashwin Nayak,
Amnon Ta-Shma,
David Zuckerman:
Interaction in quantum communication and the complexity of set disjointness.
STOC 2001: 124-133 |
10 | EE | Andris Ambainis,
Eric Bach,
Ashwin Nayak,
Ashvin Vishwanath,
John Watrous:
One-dimensional quantum walks.
STOC 2001: 37-49 |
2000 |
9 | EE | Ashwin Nayak,
Amnon Ta-Shma,
David Zuckerman:
Interaction in Quantum Communication Complexity
CoRR quant-ph/0005106: (2000) |
1999 |
8 | EE | Ashwin Nayak:
Optimal Lower Bounds for Quantum Automata and Random Access Codes.
FOCS 1999: 369-377 |
7 | EE | Andris Ambainis,
Ashwin Nayak,
Amnon Ta-Shma,
Umesh V. Vazirani:
Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata.
STOC 1999: 376-383 |
6 | EE | Ashwin Nayak,
Felix Wu:
The Quantum Query Complexity of Approximating the Median and Related Statistics.
STOC 1999: 384-393 |
5 | EE | Ashwin Nayak:
Optimal lower bounds for quantum automata and random access codes
CoRR quant-ph/9904093: (1999) |
4 | | Ashwin Nayak,
Alistair Sinclair,
Uri Zwick:
Spatial Codes and the Hardness of String Folding Problems.
Journal of Computational Biology 6(1): 13-36 (1999) |
1998 |
3 | | Ashwin Nayak,
Alistair Sinclair,
Uri Zwick:
Spatial Codes and the Hardness of String Folding Problems (Extended Abstract).
SODA 1998: 639-648 |
2 | EE | Andris Ambainis,
Ashwin Nayak,
Amnon Ta-Shma,
Umesh V. Vazirani:
Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata
CoRR quant-ph/9804043: (1998) |
1 | EE | Ashwin Nayak,
Felix Wu:
The quantum query complexity of approximating the median and related statistics
CoRR quant-ph/9804066: (1998) |