- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j14 |      | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha: On the Hitting Times of Quantum Versus Random Walks. Algorithmica 63(1-2): 91-116 (2012) |
| j13 | | Rahul Jain, Ashwin Nayak: Short Proofs of the Quantum Substate Theorem. IEEE Transactions on Information Theory 58(6): 3664-3669 (2012) |
| 2011 | ||
| j12 | | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha: Search via Quantum Walk. SIAM J. Comput. 40(1): 142-164 (2011) |
| j11 | | Ashwin Nayak: Inverting a Permutation is as Hard as Unordered Search. Theory of Computing 7(1): 19-25 (2011) |
| c15 | | Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao: Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) 2011: 317-329 |
| i13 | | |
| 2010 | ||
| j10 | | Rahul Jain, Ashwin Nayak, Yi Su: A separation between divergence and Holevo information for ensembles. Mathematical Structures in Computer Science 20(5): 977-993 (2010) |
| c14 | | Frédéric Magniez, Claire Mathieu, Ashwin Nayak: Recognizing well-parenthesized expressions in the streaming model. STOC 2010: 261-270 |
| i12 | | Rahul Jain, Ashwin Nayak: The space complexity of recognizing well-parenthesized expressions. CoRR abs/1004.3165 (2010) |
| i11 | | |
| i10 | | Rahul Jain, Ashwin Nayak: The space complexity of recognizing well-parenthesized expressions. Electronic Colloquium on Computational Complexity (ECCC) 17: 71 (2010) |
| i9 | | Ashwin Nayak: Inverting a permutation is as hard as unordered search. Electronic Colloquium on Computational Complexity (ECCC) 17: 121 (2010) |
| i8 | | Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao: Improved bounds for the randomized decision tree complexity of recursive majority. Electronic Colloquium on Computational Complexity (ECCC) 17: 192 (2010) |
| 2009 | ||
| j9 | | |
| j8 | | Matthew Andrew, Ashwin Nayak, Rajmohan Rajaraman: Special Section on Foundations of Computer Science. SIAM J. Comput. 39(2): 545 (2009) |
| c13 | | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha: On the hitting times of quantum versus random walks. SODA 2009: 86-95 |
| i7 | | Frédéric Magniez, Claire Mathieu, Ashwin Nayak: Recognizing well-parenthesized expressions in the streaming model. CoRR abs/0911.3291 (2009) |
| i6 | | Frédéric Magniez, Claire Mathieu, Ashwin Nayak: Recognizing well-parenthesized expressions in the streaming model. Electronic Colloquium on Computational Complexity (ECCC) 16: 119 (2009) |
| 2008 | ||
| c12 | | Rahul Jain, Hartmut Klauck, Ashwin Nayak: Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC 2008: 599-608 |
| c11 | | Rahul Jain, Ashwin Nayak, Yi Su: A Separation between Divergence and Holevo Information for Ensembles. TAMC 2008: 526-541 |
| r1 | | |
| 2007 | ||
| j7 | | Frédéric Magniez, Ashwin Nayak: Quantum Complexity of Testing Group Commutativity. Algorithmica 48(3): 221-232 (2007) |
| j6 | | Ashwin Nayak, Pranab Sen: Invertible quantum operations and perfect encryption of quantum states. Quantum Information & Computation 7(1): 103-110 (2007) |
| j5 | | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication. IEEE Transactions on Information Theory 53(6): 1970-1982 (2007) |
| c10 | | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha: Search via quantum walk. STOC 2007: 575-584 |
| i5 | | Rahul Jain, Hartmut Klauck, Ashwin Nayak: Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electronic Colloquium on Computational Complexity (ECCC) 14(064) (2007) |
| 2006 | ||
| j4 | | Ashwin Nayak, Julia Salzman: Limits on the ability of quantum states to convey classical messages. J. ACM 53(1): 184-206 (2006) |
| 2005 | ||
| c9 | | Frédéric Magniez, Ashwin Nayak: Quantum Complexity of Testing Group Commutativity. ICALP 2005: 1312-1324 |
| 2004 | ||
| j3 | | Iordanis Kerenidis, Ashwin Nayak: Weak coin flipping with small bias. Inf. Process. Lett. 89(3): 131-135 (2004) |
| 2002 | ||
| j2 | | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense quantum coding and quantum finite automata. J. ACM 49(4): 496-511 (2002) |
| c8 | | Ashwin Nayak, Julia Salzman: On Communication over an Entanglement-Assisted Quantum Channel. IEEE Conference on Computational Complexity 2002: 19 |
| c7 | | Ashwin Nayak, Julia Salzman: On communication over an entanglement-assisted quantum channel. STOC 2002: 698-704 |
| 2001 | ||
| c6 | | Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous: One-dimensional quantum walks. STOC 2001: 37-49 |
| c5 | | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in quantum communication and the complexity of set disjointness. STOC 2001: 124-133 |
| 2000 | ||
| i4 | | Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication Complexity. CoRR quant-ph/0005106 (2000) |
| 1999 | ||
| j1 | | Ashwin Nayak, Alistair Sinclair, Uri Zwick: Spatial Codes and the Hardness of String Folding Problems. Journal of Computational Biology 6(1): 13-36 (1999) |
| c4 | | |
| c3 | | 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 |
| c2 | | |
| i3 | | Ashwin Nayak: Optimal lower bounds for quantum automata and random access codes. CoRR quant-ph/9904093 (1999) |
| 1998 | ||
| c1 | | Ashwin Nayak, Alistair Sinclair, Uri Zwick: Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). SODA 1998: 639-648 |
| i2 | | 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) |
| i1 | | Ashwin Nayak, Felix Wu: The quantum query complexity of approximating the median and related statistics. CoRR quant-ph/9804066 (1998) |
Data released under the ODC-BY 1.0 license — See also our legal information page