The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Amnon Ta-Shma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
    On the Error Parameter of Dispersers. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:294-305 [Conf]
  2. Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
    Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:33-47 [Conf]
  3. Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
    If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:243-257 [Conf]
  4. Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
    Non-interactive Timestamping in the Bounded Storage Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:460-476 [Conf]
  5. Tomas Sander, Amnon Ta-Shma
    Auditable, Anonymous Electronic Cash Extended Abstract. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:555-572 [Conf]
  6. Ron Berman, Amos Fiat, Amnon Ta-Shma
    Provable Unlinkability against Traffic Analysis. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2004, pp:266-280 [Conf]
  7. Tomas Sander, Amnon Ta-Shma
    Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 1999, pp:46-61 [Conf]
  8. Tomas Sander, Amnon Ta-Shma, Moti Yung
    Blind, Auditable Membership Proofs. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2000, pp:53-71 [Conf]
  9. Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
    The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:342-351 [Conf]
  10. Jaikumar Radhakrishnan, Amnon Ta-Shma
    Tight Bounds for Depth-two Superconcentrators. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:585-594 [Conf]
  11. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
    Extractors from Reed-Muller Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:638-647 [Conf]
  12. Amnon Ta-Shma, Christopher Umans
    Better lossless condensers through derandomized curve samplers. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:177-186 [Conf]
  13. Tomas Sander, Amnon Ta-Shma
    On Anonymous Electronic Cash and Crime. [Citation Graph (0, 0)][DBLP]
    ISW, 1999, pp:202-206 [Conf]
  14. Eran Rom, Amnon Ta-Shma
    Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:557-568 [Conf]
  15. Dorit Aharonov, Amnon Ta-Shma
    Adiabatic quantum state generation and statistical zero knowledge. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:20-29 [Conf]
  16. Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao
    Quantum bit escrow. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:705-714 [Conf]
  17. 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]
  18. Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou
    SL <= L4/3. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:230-239 [Conf]
  19. Sean Hallgren, Alexander Russell, Amnon Ta-Shma
    Normal subgroup reconstruction and quantum computation using group representations. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:627-635 [Conf]
  20. 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]
  21. Noam Nisan, Amnon Ta-Shma
    Symmetric logspace is closed under complement. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:140-146 [Conf]
  22. Amnon Ta-Shma
    On Extracting Randomness From Weak Random Sources (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:276-285 [Conf]
  23. Amnon Ta-Shma
    Almost Optimal Dispersers. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:196-202 [Conf]
  24. Amnon Ta-Shma, Christopher Umans, David Zuckerman
    Loss-less condensers, unbalanced expanders, and extractors. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:143-152 [Conf]
  25. Amnon Ta-Shma, David Zuckerman
    Extractor codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:193-199 [Conf]
  26. Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
    Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:3-4, pp:85-130 [Journal]
  27. Noam Nisan, Amnon Ta-Shma
    Symmetric Logspace is Closed Under Complement. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1995, v:1995, n:, pp:- [Journal]
  28. Amnon Ta-Shma
    Almost Optimal Dispersers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:1, pp:123-145 [Journal]
  29. Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in Quantum Communication Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  30. 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]
  31. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
    Extractors from Reed-Muller Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:36, pp:- [Journal]
  32. Eran Rom, Amnon Ta-Shma
    Improveing the alphabet size in high noise, almost optimal rate list decodable codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:069, pp:- [Journal]
  33. Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
    On the Error Parameter of Dispersers [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:061, pp:- [Journal]
  34. Amnon Ta-Shma
    On Extracting Randomness From Weak Random Sources [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:58, pp:- [Journal]
  35. Amnon Ta-Shma
    Storing information with extractors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:5, pp:267-274 [Journal]
  36. Amnon Ta-Shma
    A Note on PCP vs. MIP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:3, pp:135-140 [Journal]
  37. Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou
    An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:2, pp:294-311 [Journal]
  38. 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]
  39. Noam Nisan, Amnon Ta-Shma
    Extracting Randomness: A Survey and New Constructions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:148-173 [Journal]
  40. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
    Extractors from Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:5, pp:786-812 [Journal]
  41. Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
    The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1570-1585 [Journal]
  42. Sean Hallgren, Alexander Russell, Amnon Ta-Shma
    The Hidden Subgroup Problem and Quantum Computation Using Group Representations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:4, pp:916-934 [Journal]
  43. Dorit Aharonov, Amnon Ta-Shma
    Adiabatic Quantum State Generation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:47-82 [Journal]
  44. Jaikumar Radhakrishnan, Amnon Ta-Shma
    Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:1, pp:2-24 [Journal]
  45. Amnon Ta-Shma, David Zuckerman
    Extractor codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3015-3025 [Journal]
  46. Eran Rom, Amnon Ta-Shma
    Improving the Alphabet-Size in Expander-Based Code Constructions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3695-3700 [Journal]
  47. 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]
  48. Dan Gutfreund, Amnon Ta-Shma
    Worst-Case to Average-Case Reductions Revisited. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:569-583 [Conf]
  49. Amnon Ta-Shma, Uri Zwick
    Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:599-608 [Conf]
  50. Amnon Ta-Shma, Christopher Umans, David Zuckerman
    Lossless Condensers, Unbalanced Expanders, And Extractors. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:213-240 [Journal]

  51. Quantum Expanders: Motivation and Constructions. [Citation Graph (, )][DBLP]


  52. Constructing Small-Bias Sets from Algebraic-Geometric Codes. [Citation Graph (, )][DBLP]


  53. A combinatorial construction of almost-ramanujan graphs using the zig-zag product. [Citation Graph (, )][DBLP]


  54. Short seed extractors against quantum storage. [Citation Graph (, )][DBLP]


  55. If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. [Citation Graph (, )][DBLP]


  56. New connections between derandomization, worst-case complexity and average-case complexity. [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.022secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002