Amnon Ta-Shma
Orcid: 0000-0001-8186-3622Affiliations:
- Tel Aviv University, Israel
According to our database1,
Amnon Ta-Shma
authored at least 95 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on cs.tau.ac.il
On csauthors.net:
Bibliography
2024
Electron. Colloquium Comput. Complex., 2024
2023
2022
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy.
SIAM J. Comput., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
2020
Electron. Colloquium Comput. Complex., 2020
Proceedings of the 35th Computational Complexity Conference, 2020
2019
2018
Electron. Colloquium Comput. Complex., 2018
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions.
Electron. Colloquium Comput. Complex., 2018
Proceedings of the 33rd Computational Complexity Conference, 2018
2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
Electron. Colloquium Comput. Complex., 2017
Comput. Complex., 2017
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
2016
Electron. Colloquium Comput. Complex., 2016
Electron. Colloquium Comput. Complex., 2016
2015
J. Cryptol., 2015
Inf. Process. Lett., 2015
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
2014
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences.
ACM Trans. Algorithms, 2014
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014
Proceedings of the 9th Annual International Conference of the Alliance of Digital Humanities Organizations, 2014
2013
Electron. Colloquium Comput. Complex., 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
2012
CoRR, 2012
Towards the Impossibility of Non-Signalling Privacy Amplification from Time-Like Ordering Constraints
CoRR, 2012
Proceedings of the 5th International Conference on Electronic Voting 2012, 2012
Proceedings of the 27th Conference on Computational Complexity, 2012
2011
IEEE Trans. Inf. Theory, 2011
SIAM J. Comput., 2011
2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
2009
2008
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008
2007
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy.
Theory Comput., 2007
Quantum Inf. Process., 2007
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances.
Comput. Complex., 2007
Proceedings of the 2007 USENIX/ACCURATE Electronic Voting Technology Workshop, 2007
Proceedings of the Approximation, 2007
2006
IEEE Trans. Inf. Theory, 2006
New connections between derandomization, worst-case complexity and average-case complexity.
Electron. Colloquium Comput. Complex., 2006
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
Proceedings of the STACS 2005, 2005
2004
Electron. Colloquium Comput. Complex., 2004
Proceedings of the Financial Cryptography, 2004
2003
SIAM J. Comput., 2003
Comput. Complex., 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003
2002
2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
2000
SIAM J. Discret. Math., 2000
An <i>O</i>(log(<i>n</i>)<sup>4/3</sup>) space algorithm for (<i>s, t</i>) connectivity in undirected graphs.
J. ACM, 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
1999
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Information Security, Second International Workshop, 1999
Proceedings of the Financial Cryptography, 1999
Proceedings of the Advances in Cryptology, 1999
1997
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
1995
Electron. Colloquium Comput. Complex., 1995