Travelled to:1 × Greece
1 × Portugal
1 × Switzerland
2 × Canada
3 × USA
Collaborated with:F.Magniez H.Klauck M.Santha J.Salzman A.Ta-Shma F.Wu A.Ambainis C.Mathieu R.Jain D.Xiao J.Roland D.Zuckerman U.V.Vazirani E.Bach A.Vishwanath J.Watrous
Talks about:quantum (8) complex (5) communic (3) bound (3) walk (2) subdistribut (1) parenthes (1) dimension (1) interact (1) disjoint (1)
Person: Ashwin Nayak
DBLP: Nayak:Ashwin
Contributed to:
2011
2010200820072005200220011999Wrote 10 papers:
- ICALP-v1-2011-MagniezNSX #bound #complexity #random #recursion
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (FM, AN, MS, DX), pp. 317–329.
- STOC-2010-MagniezMN #streaming
- Recognizing well-parenthesized expressions in the streaming model (FM, CM, AN), pp. 261–270.
- STOC-2008-JainKN #bound #communication #complexity #theorem
- Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract (RJ, HK, AN), pp. 599–608.
- STOC-2007-MagniezNRS #quantum
- Search via quantum walk (FM, AN, JR, MS), pp. 575–584.
- ICALP-2005-MagniezN #commutative #complexity #quantum #testing
- Quantum Complexity of Testing Group Commutativity (FM, AN), pp. 1312–1324.
- STOC-2002-NayakS #communication #on the #quantum
- On communication over an entanglement-assisted quantum channel (AN, JS), pp. 698–704.
- STOC-2001-AmbainisBNVW #quantum
- One-dimensional quantum walks (AA, EB, AN, AV, JW), pp. 37–49.
- STOC-2001-KlauckNTZ #communication #complexity #interactive #quantum #set
- Interaction in quantum communication and the complexity of set disjointness (HK, AN, ATS, DZ), pp. 124–133.
- STOC-1999-AmbainisNTV #automaton #bound #quantum
- Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.
- STOC-1999-NayakW #approximate #complexity #quantum #query #statistics
- The Quantum Query Complexity of Approximating the Median and Related Statistics (AN, FW), pp. 384–393.