The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ashwin Nayak: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ashwin Nayak, Julia Salzman
    On Communication over an Entanglement-Assisted Quantum Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:19- [Conf]
  2. Ashwin Nayak
    Optimal Lower Bounds for Quantum Automata and Random Access Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:369-377 [Conf]
  3. Frédéric Magniez, Ashwin Nayak
    Quantum Complexity of Testing Group Commutativity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1312-1324 [Conf]
  4. Ashwin Nayak, Alistair Sinclair, Uri Zwick
    Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:639-648 [Conf]
  5. Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous
    One-dimensional quantum walks. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:37-49 [Conf]
  6. Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
    Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:376-383 [Conf]
  7. Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in quantum communication and the complexity of set disjointness. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:124-133 [Conf]
  8. Ashwin Nayak, Julia Salzman
    On communication over an entanglement-assisted quantum channel. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:698-704 [Conf]
  9. Ashwin Nayak, Felix Wu
    The Quantum Query Complexity of Approximating the Median and Related Statistics. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:384-393 [Conf]
  10. Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in Quantum Communication Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  11. Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
    Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  12. Ashwin Nayak, Felix Wu
    The quantum query complexity of approximating the median and related statistics [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  13. Ashwin Nayak
    Optimal lower bounds for quantum automata and random access codes [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  14. Iordanis Kerenidis, Ashwin Nayak
    Weak coin flipping with small bias. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:3, pp:131-135 [Journal]
  15. Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
    Dense quantum coding and quantum finite automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:4, pp:496-511 [Journal]
  16. Ashwin Nayak, Julia Salzman
    Limits on the ability of quantum states to convey classical messages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:1, pp:184-206 [Journal]
  17. Ashwin Nayak, Alistair Sinclair, Uri Zwick
    Spatial Codes and the Hardness of String Folding Problems. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:1, pp:13-36 [Journal]
  18. Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in Quantum Communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:1970-1982 [Journal]
  19. Frédéric Magniez, Ashwin Nayak, Jeremie Roland, Miklos Santha
    Search via quantum walk. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:575-584 [Conf]
  20. Frédéric Magniez, Ashwin Nayak
    Quantum Complexity of Testing Group Commutativity. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:3, pp:221-232 [Journal]

  21. On the hitting times of quantum versus random walks. [Citation Graph (, )][DBLP]


  22. Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. [Citation Graph (, )][DBLP]


  23. Recognizing well-parenthesized expressions in the streaming model. [Citation Graph (, )][DBLP]


  24. A Separation between Divergence and Holevo Information for Ensembles. [Citation Graph (, )][DBLP]


  25. Foreword from the Guest Editors. [Citation Graph (, )][DBLP]


  26. Recognizing well-parenthesized expressions in the streaming model [Citation Graph (, )][DBLP]


  27. The space complexity of recognizing well-parenthesized expressions [Citation Graph (, )][DBLP]


  28. Inverting a permutation is as hard as unordered search [Citation Graph (, )][DBLP]


  29. Direct Product Theorems for Communication Complexity via Subdistribution Bounds. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002