Ashwin Nayak
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
19
Venues
7
Active years
1998–2024
Best venue rank
A*
Where they publish
Papers
19 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | AAAI | MedAlign: A Clinician-Generated Dataset for Instruction Following with Electronic Medical Records. | Scott L. Fleming, Alejandro Lozano, William J. Haberkorn, Jenelle A. Jindal, Eduardo Pontes Reis, Rahul Thapa, Louis Blankemeier, Julian Z. Genkins, Ethan Steinberg, Ashwin Nayak, Birju S. Patel, Chia-Chun Chiang, Alison Callahan, Zepeng Huo, Sergios Gatidis, Scott J. Adams, Oluseyi Fayanju, Shreya J. Shah, Thomas Savage, Ethan Goh, Akshay S. Chaudhari, Nima Aghaeepour, Christopher D. Sharp, Michael A. Pfeffer, Percy Liang, Jonathan H. Chen, Keith E. Morse, Emma P. Brunskill, Jason A. Fries, Nigam H. Shah |
| 2021 | ISIT | One-Shot Quantum State Redistribution and Quantum Markov Chains. | Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette |
| 2020 | ICALP | Quantum Distributed Complexity of Set Disjointness on a Line. | Frdric Magniez, Ashwin Nayak |
| 2018 | STOC | Capacity approaching coding for low noise interactive quantum communication. | Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu |
| 2014 | FOCS | Noisy Interactive Quantum Communication. | Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger |
| 2011 | ICALP | Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. | Frdric Magniez, Ashwin Nayak, Miklos Santha, David Xiao |
| 2010 | STOC | Recognizing well-parenthesized expressions in the streaming model. | Frdric Magniez, Claire Mathieu, Ashwin Nayak |
| 2009 | SODA | On the hitting times of quantum versus random walks. | Frdric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
| 2008 | STOC | Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. | Rahul Jain, Hartmut Klauck, Ashwin Nayak |
| 2008 | TAMC | A Separation between Divergence and Holevo Information for Ensembles. | Rahul Jain, Ashwin Nayak, Yi Su |
| 2007 | STOC | Search via quantum walk. | Frdric Magniez, Ashwin Nayak, Jrmie Roland, Miklos Santha |
| 2005 | ICALP | Quantum Complexity of Testing Group Commutativity. | Frdric Magniez, Ashwin Nayak |
| 2002 | STOC | On communication over an entanglement-assisted quantum channel. | Ashwin Nayak, Julia Salzman |
| 2001 | STOC | One-dimensional quantum walks. | Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous |
| 2001 | STOC | Interaction in quantum communication and the complexity of set disjointness. | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
| 1999 | FOCS | Optimal Lower Bounds for Quantum Automata and Random Access Codes. | Ashwin Nayak |
| 1999 | STOC | Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
| 1999 | STOC | The Quantum Query Complexity of Approximating the Median and Related Statistics. | Ashwin Nayak, Felix Wu |
| 1998 | SODA | Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). | Ashwin Nayak, Alistair Sinclair, Uri Zwick |