|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 14 keywords
|
|
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
On the Hitting Times of Quantum Versus Random Walks.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak |
Inverting a Permutation is as Hard as Unordered Search. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Ashwin Nayak |
A short proof of the Quantum Substate Theorem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha |
Search via Quantum Walk. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao |
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rahul Jain, Ashwin Nayak |
The space complexity of recognizing well-parenthesized expressions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ashwin Nayak |
Inverting a permutation is as hard as unordered search. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rahul Jain, Ashwin Nayak, Yi Su |
A separation between divergence and Holevo information for ensembles. |
Mathematical Structures in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak |
Inverting a permutation is as hard as unordered search |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rahul Jain, Ashwin Nayak |
The space complexity of recognizing well-parenthesized expressions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Claire Mathieu, Ashwin Nayak |
Recognizing well-parenthesized expressions in the streaming model. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Claire Mathieu, Ashwin Nayak |
Recognizing well-parenthesized expressions in the streaming model. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak |
Foreword from the Guest Editors. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Claire Mathieu, Ashwin Nayak |
Recognizing well-parenthesized expressions in the streaming model |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Matthew Andrew, Ashwin Nayak, Rajmohan Rajaraman |
Special Section on Foundations of Computer Science. |
SIAM J. Comput. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
On the hitting times of quantum versus random walks. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak |
Quantum Algorithm for Checking Matrix Identities. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Ashwin Nayak, Yi Su |
A Separation between Divergence and Holevo Information for Ensembles. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Hartmut Klauck, Ashwin Nayak |
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
rectangle bounds, subdistribution bounds, information theory, communication complexity, direct product |
| 1 | Rahul Jain, Hartmut Klauck, Ashwin Nayak |
Direct Product Theorems for Communication Complexity via Subdistribution Bounds. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak |
Quantum Complexity of Testing Group Commutativity. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak, Pranab Sen |
Invertible quantum operations and perfect encryption of quantum states. |
Quantum Information & Computation |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
Interaction in Quantum Communication. |
IEEE Transactions on Information Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha |
Search via quantum walk. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
amplitude amplification, phase gap, recursive amplitude amplification, reflection operator, spectral gap, search, Markov chain, phase estimation, hitting time, quantum walk |
| 1 | Ashwin Nayak, Julia Salzman |
Limits on the ability of quantum states to convey classical messages. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
Holevo bound, Inner Product function, entanglement-assisted quantum channel, shared entanglement, superdense coding, lower bounds, information theory, Communication complexity, privacy amplification, quantum communication |
| 1 | Frédéric Magniez, Ashwin Nayak |
Quantum Complexity of Testing Group Commutativity. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ashwin Nayak |
Weak coin flipping with small bias. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
Dense quantum coding and quantum finite automata. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
Automaton size, quantum computation, encoding, communication complexity, finite automata, quantum communication |
| 1 | Ashwin Nayak, Julia Salzman |
On Communication over an Entanglement-Assisted Quantum Channel. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak, Julia Salzman |
On communication over an entanglement-assisted quantum channel. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
entanglement-assisted quantum channel, communication complexity, quantum communication |
| 1 | Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous |
One-dimensional quantum walks. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
Interaction in quantum communication and the complexity of set disjointness. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
Interaction in Quantum Communication Complexity |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Ashwin Nayak, Alistair Sinclair, Uri Zwick |
Spatial Codes and the Hardness of String Folding Problems. |
Journal of Computational Biology |
1999 |
DBLP BibTeX RDF |
|
| 1 | Ashwin Nayak |
Optimal lower bounds for quantum automata and random access codes |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Ashwin Nayak |
Optimal Lower Bounds for Quantum Automata and Random Access Codes. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak, Felix Wu |
The Quantum Query Complexity of Approximating the Median and Related Statistics. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak, Felix Wu |
The quantum query complexity of approximating the median and related statistics |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Ashwin Nayak, Alistair Sinclair, Uri Zwick |
Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")