World's Best Scientists 2026 revealed!
Amnon Ta-Shma

Amnon Ta-Shma

D-Index & Metrics

Computer Science

D-Index
39
Citations
4705
World Ranking
9904
National Ranking
161

Overview

Amnon Ta-Shma is affiliated with Tel Aviv University in Israel. Their research primarily spans the field of Computer Science, with significant focus on Artificial Intelligence and Computational Theory and Mathematics.

Their key research topics include:

  • Complexity and Algorithms in Graphs
  • Coding theory and cryptography
  • Cryptography and Data Security
  • Semigroups and automata theory
  • Algorithms and Data Compression
  • Machine Learning and Algorithms
  • Polynomial and algebraic computation

Amnon Ta-Shma has published several papers in notable venues. Their recent works include:

  • Near-optimal erasure list-decodable codes, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • List-Decoding with Double Samplers, 2021, SIAM Journal on Computing
  • Expander Random Walks: The General Case and Limitations, 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • On Hitting-Set Generators for Polynomials that Vanish Rarely, 2022, Computational Complexity
  • On Hitting-Set Generators for Polynomials That Vanish Rarely, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

The frequent publication venues for their work are:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SIAM Journal on Computing
  • Computational Complexity

Amnon Ta-Shma has collaborated with various coauthors on their research, including:

  • Dean Doron
  • Gil Cohen
  • Roei Tell
  • Avraham Ben-Aroya
  • Irit Dinur

Best Publications

  • Adiabatic quantum state generation and statistical zero knowledge

    Dorit Aharonov;Amnon Ta-Shma

  • Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators

    Jaikumar Radhakrishnan;Amnon Ta-Shma

  • Dense quantum coding and quantum finite automata

    Andris Ambainis;Ashwin Nayak;Amnon Ta-Shma;Umesh Vazirani

  • Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences

    Amnon Ta-Shma;Uri Zwick

  • Extracting Randomness

    Noam Nisan;Amnon Ta-Shma

  • Loss-less condensers, unbalanced expanders, and extractors

    Amnon Ta-Shma;Christopher Umans;David Zuckerman

  • Dense quantum coding and a lower bound for 1-way quantum automata

    Andris Ambainis;Ashwin Nayak;Ammon Ta-Shma;Umesh Vazirani

  • Extractors from Reed-Muller codes

    Amnon Ta-Shma;David Zuckerman;Shmuel Safra

  • Normal subgroup reconstruction and quantum computation using group representations

    Sean Hallgren;Alexander Russell;Amnon Ta-Shma

  • Quantum bit escrow

    Dorit Aharonov;Amnon Ta-Shma;Umesh V. Vazirani;Andrew C. Yao

  • Extractor codes

    A. Ta-Shma;D. Zuckerman

  • The hidden subgroup problem and quantum computation using group representations

    Sean Hallgren;Alexander Russell;Amnon Ta-Shma

  • Auditable, Anonymous Electronic Cash

    Tomas Sander;Amnon Ta-Shma

  • Lossless Condensers, Unbalanced Expanders, And Extractors

    Amnon Ta-Shma;Christopher Umans;David Zuckerman

  • If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances

    Dan Gutfreund;Ronen Shaltiel;Amnon Ta-Shma

  • Adiabatic Quantum State Generation

    Dorit Aharonov;Amnon Ta-Shma

  • Interaction in quantum communication and the complexity of set disjointness

    Hartmut Klauck;Ashwin Nayak;Amnon Ta-Shma;David Zuckerman

  • The quantum communication complexity of sampling

    A. Ambainis;L.J. Schulman;A. Ta-Shma;U. Vazirani

  • Symmetric logspace is closed under complement

    Noam Nisan;Amnon Ta-Shma

  • The Quantum Communication Complexity of Sampling

    Andris Ambainis;Leonard J. Schulman;Amnon Ta-Shma;Umesh Vazirani

  • Extractor codes

    Amnon Ta-Shma;David Zucherman

Frequent Co-Authors

David Zuckerman
David Zuckerman The University of Texas at Austin
Umesh Vazirani
Umesh Vazirani University of California, Berkeley
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Andris Ambainis
Andris Ambainis University of Latvia
Dorit Aharonov
Dorit Aharonov Hebrew University of Jerusalem
Avi Wigderson
Avi Wigderson Institute for Advanced Study
Omer Reingold
Omer Reingold Stanford University
Uri Zwick
Uri Zwick Tel Aviv University
Amos Fiat
Amos Fiat Tel Aviv University
Oded Regev
Oded Regev Courant Institute of Mathematical Sciences

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science online opens doors to flexible, affordable education and diverse career opportunities. Online associate degree programs are a great starting point, offering foundational skills in programming, networks, and systems. These programs are ideal if you’re looking for entry-level roles or plan to transfer to a bachelor’s degree later.

Affordability is often a major concern for students. Finding cheap online colleges can help minimize student debt while still receiving a solid education. Many reputable institutions offer high-quality computer science degrees online at a lower cost.

If you’re concerned about your academic history, some online colleges that accept 2.0 gpa provide great options for students with lower GPAs. These schools offer support services and flexible admission criteria, making it possible for more learners to enter the tech field.

Computer science also connects with broader disciplines. For instance, tech skills can be paired with fields like environmental science to offer unique career paths. Discovering what can you do with an environmental science degree shows how multidisciplinary education can open even more job opportunities—such as data analysis, research, and sustainability roles that need tech expertise.

Best Scientists Citing Amnon Ta-Shma

Trending Scientists

Recently Published Articles