Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmnon Ta-Shma
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i36]Swastik Kopparty, Amnon Ta-Shma, Kedem Yakirevitch:
Character sums over AG codes. Electron. Colloquium Comput. Complex. TR24 (2024)- [i35]Amnon Ta-Shma, Ron Zadiario:
The Expander Hitting Property When the Sets Are Arbitrarily Unbalanced. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c55]Itay Cohen, Roy Roth, Amnon Ta-Shma:
HDX Condensers. FOCS 2023: 1649-1664 - [c54]Gil Cohen, Dean Doron
, Ori Sberlo, Amnon Ta-Shma:
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. STOC 2023: 35-45 - [e1]Amnon Ta-Shma:
38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK. LIPIcs 264, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-282-2 [contents] - [i34]Itay Cohen, Roy Roth, Amnon Ta-Shma:
HDX Condensers. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j37]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials that Vanish Rarely. Comput. Complex. 31(2): 16 (2022) - [j36]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy. SIAM J. Comput. 51(2): 17-31 (2022) - [c53]Dan Karliner, Amnon Ta-Shma:
Improved Local Testing for Multiplicity Codes. APPROX/RANDOM 2022: 11:1-11:19 - [c52]Itay Kalev, Amnon Ta-Shma:
Unbalanced Expanders from Multiplicity Codes. APPROX/RANDOM 2022: 12:1-12:14 - [c51]Dan Karliner, Roie Salama, Amnon Ta-Shma:
The Plane Test Is a Local Tester for Multiplicity Codes. CCC 2022: 14:1-14:33 - [c50]Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. ICALP 2022: 43:1-43:18 - [i33]Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma:
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. Electron. Colloquium Comput. Complex. TR22 (2022) - [i32]Itay Kalev, Amnon Ta-Shma:
Unbalanced Expanders from Multiplicity Codes. Electron. Colloquium Comput. Complex. TR22 (2022) - [i31]Dan Karliner, Roie Salama, Amnon Ta-Shma:
The plane test is a local tester for Multiplicity Codes. Electron. Colloquium Comput. Complex. TR22 (2022) - [i30]Dan Karliner, Amnon Ta-Shma:
Improved local testing for multiplicity codes. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j35]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List-Decoding with Double Samplers. SIAM J. Comput. 50(2): 301-349 (2021) - [c49]Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma:
Error Reduction for Weighted PRGs Against Read Once Branching Programs. CCC 2021: 22:1-22:17 - [c48]Gil Cohen, Noam Peri, Amnon Ta-Shma:
Expander random walks: a Fourier-analytic approach. STOC 2021: 1643-1655 - [i29]Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma:
Error Reduction For Weighted PRGs Against Read Once Branching Programs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i28]Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c47]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials That Vanish Rarely. APPROX-RANDOM 2020: 7:1-7:23 - [c46]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Near-Optimal Erasure List-Decodable Codes. CCC 2020: 1:1-1:27 - [i27]Gil Cohen, Noam Peri, Amnon Ta-Shma:
Expander Random Walks: A Fourier-Analytic Approach. Electron. Colloquium Comput. Complex. TR20 (2020) - [i26]Gonen Krak, Noam Parzanchevski, Amnon Ta-Shma:
Pr-ZSUBEXP is not contained in Pr-RP. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j34]Nir Aviv, Amnon Ta-Shma:
On the Entropy Loss and Gap of Condensers. ACM Trans. Comput. Theory 11(3): 15:1-15:14 (2019) - [c45]Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma:
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. APPROX-RANDOM 2019: 43:1-43:20 - [c44]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. SODA 2019: 2134-2153 - [i25]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials that Vanish Rarely. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c43]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A New Approach for Constructing Low-Error, Two-Source Extractors. CCC 2018: 3:1-3:19 - [i24]Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. CoRR abs/1806.04080 (2018) - [i23]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. CoRR abs/1808.00425 (2018) - [i22]Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma:
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. Electron. Colloquium Comput. Complex. TR18 (2018) - [i21]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends. Electron. Colloquium Comput. Complex. TR18 (2018) - [i20]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j33]Dean Doron, Amir Sarid, Amnon Ta-Shma:
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace. Comput. Complex. 26(2): 393-420 (2017) - [c42]Dean Doron, François Le Gall, Amnon Ta-Shma:
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers. APPROX-RANDOM 2017: 41:1-41:20 - [c41]Amnon Ta-Shma:
Explicit, almost optimal, epsilon-balanced codes. STOC 2017: 238-251 - [c40]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. STOC 2017: 1185-1194 - [i19]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate. Electron. Colloquium Comput. Complex. TR17 (2017) - [i18]Dean Doron, Francois Le Gall, Amnon Ta-Shma:
Probabilistic logarithmic-space algorithms for Laplacian solvers. Electron. Colloquium Comput. Complex. TR17 (2017) - [i17]Amnon Ta-Shma:
Explicit, almost optimal, epsilon-balanced codes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i16]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Explicit two-source extractors for near-logarithmic min-entropy. Electron. Colloquium Comput. Complex. TR16 (2016) - [i15]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Low-error two-source extractors for polynomial min-entropy. Electron. Colloquium Comput. Complex. TR16 (2016) - [i14]Dean Doron, Amir Sarid, Amnon Ta-Shma:
On approximating the eigenvalues of stochastic matrices in probabilistic logspace. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j32]Dean Doron, Amnon Ta-Shma:
On the de-randomization of space-bounded approximate counting problems. Inf. Process. Lett. 115(10): 750-753 (2015) - [j31]Ron Berman, Amos Fiat, Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski, Tomer Levinboim, Amnon Ta-Shma:
Provable Unlinkability Against Traffic Analysis with Low Message Overhead. J. Cryptol. 28(3): 623-640 (2015) - [c39]Dean Doron, Amnon Ta-Shma:
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace. ICALP (1) 2015: 419-431 - 2014
- [j30]Amnon Ta-Shma, Uri Zwick:
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences. ACM Trans. Algorithms 10(3): 12:1-12:15 (2014) - [c38]Idan Dershowitz, Nachum Dershowitz, Tomer Hasid, Amnon Ta-Shma:
Orthography and Biblical Criticism. DH 2014 - [c37]Efraim Gelman, Amnon Ta-Shma:
The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent. FSTTCS 2014: 327-338 - 2013
- [j29]Avraham Ben-Aroya, Amnon Ta-Shma:
Constructing Small-Bias Sets from Algebraic-Geometric Codes. Theory Comput. 9: 253-272 (2013) - [c36]Amnon Ta-Shma:
Inverting well conditioned matrices in quantum logspace. STOC 2013: 881-890 - [i13]Gil Cohen, Amnon Ta-Shma:
Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j28]Avraham Ben-Aroya, Amnon Ta-Shma:
Better short-seed quantum-proof extractors. Theor. Comput. Sci. 419: 17-25 (2012) - [c35]Amnon Ta-Shma, Christopher Umans:
Better Condensers and New Extractors from Parvaresh-Vardy Codes. CCC 2012: 309-315 - [c34]Jonathan Ben-Nun, Niko Fahri, Morgan Llewellyn, Ben Riva, Alon Rosen, Amnon Ta-Shma, Douglas Wikström:
A New Implementation of a Dual (Paper and Cryptographic) Voting System. Electronic Voting 2012: 315-329 - [i12]Rotem Arnon Friedman, Esther Hänggi, Amnon Ta-Shma:
Towards the Impossibility of Non-Signalling Privacy Amplification from Time-Like Ordering Constraints. CoRR abs/1205.3736 (2012) - [i11]Rotem Arnon Friedman, Amnon Ta-Shma:
On the limits of privacy amplification against non-signalling memory attacks. CoRR abs/1211.1125 (2012) - 2011
- [j27]Avraham Ben-Aroya, Amnon Ta-Shma:
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product. SIAM J. Comput. 40(2): 267-290 (2011) - [j26]Amnon Ta-Shma:
Short Seed Extractors against Quantum Storage. SIAM J. Comput. 40(3): 664-677 (2011) - [j25]Avraham Ben-Aroya, Amnon Ta-Shma:
Approximate Quantum Error Correction for Correlated Noise. IEEE Trans. Inf. Theory 57(6): 3982-3988 (2011) - 2010
- [j24]Avraham Ben-Aroya, Amnon Ta-Shma:
On the complexity of approximating the diamond norm. Quantum Inf. Comput. 10(1&2): 77-86 (2010) - [j23]Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma:
Quantum Expanders: Motivation and Construction. Theory Comput. 6(1): 47-79 (2010) - [c33]Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma:
Local List Decoding with a Constant Number of Queries. FOCS 2010: 715-722 - [i10]Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma:
Local list decoding with a constant number of queries. Electron. Colloquium Comput. Complex. TR10 (2010) - [i9]Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma:
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j22]Tal Moran, Ronen Shaltiel, Amnon Ta-Shma:
Non-interactive Timestamping in the Bounded-Storage Model. J. Cryptol. 22(2): 189-226 (2009) - [c32]Avraham Ben-Aroya, Amnon Ta-Shma:
Constructing Small-Bias Sets from Algebraic-Geometric Codes. FOCS 2009: 191-197 - [c31]Amnon Ta-Shma:
Short seed extractors against quantum storage. STOC 2009: 401-408 - 2008
- [c30]Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma:
Quantum Expanders: Motivation and Constructions. CCC 2008: 292-303 - [c29]Avraham Ben-Aroya, Amnon Ta-Shma:
A combinatorial construction of almost-ramanujan graphs using the zig-zag product. STOC 2008: 325-334 - 2007
- [j21]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. Comput. Complex. 16(4): 412-441 (2007) - [j20]Amnon Ta-Shma, Christopher Umans, David Zuckerman:
Lossless Condensers, Unbalanced Expanders, And Extractors. Comb. 27(2): 213-240 (2007) - [j19]Alex Rapaport, Amnon Ta-Shma:
On the Power of Quantum, One Round, Two Prover Interactive Proof Systems. Quantum Inf. Process. 6(6): 445-459 (2007) - [j18]Dorit Aharonov, Amnon Ta-Shma:
Adiabatic Quantum State Generation. SIAM J. Comput. 37(1): 47-82 (2007) - [j17]Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman:
Interaction in Quantum Communication. IEEE Trans. Inf. Theory 53(6): 1970-1982 (2007) - [j16]Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory Comput. 3(1): 45-60 (2007) - [c28]Dan Gutfreund, Amnon Ta-Shma:
Worst-Case to Average-Case Reductions Revisited. APPROX-RANDOM 2007: 569-583 - [c27]Amnon Ta-Shma, Uri Zwick:
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. SODA 2007: 599-608 - [c26]Ben Riva, Amnon Ta-Shma:
Bare-Handed Electronic Voting with Pre-processing. EVT 2007 - 2006
- [j15]Amnon Ta-Shma, David Zuckerman, Shmuel Safra:
Extractors from Reed-Muller codes. J. Comput. Syst. Sci. 72(5): 786-812 (2006) - [j14]Eran Rom, Amnon Ta-Shma:
Improving the Alphabet-Size in Expander-Based Code Constructions. IEEE Trans. Inf. Theory 52(8): 3695-3700 (2006) - [c25]Amnon Ta-Shma, Christopher Umans:
Better lossless condensers through derandomized curve samplers. FOCS 2006: 177-186 - [i8]Dan Gutfreund, Amnon Ta-Shma:
New connections between derandomization, worst-case complexity and average-case complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c24]Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma:
On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305 - [c23]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. CCC 2005: 243-257 - [c22]Eran Rom, Amnon Ta-Shma:
Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. STACS 2005: 557-568 - [i7]Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma:
On the Error Parameter of Dispersers. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j13]Amnon Ta-Shma, David Zuckerman:
Extractor codes. IEEE Trans. Inf. Theory 50(12): 3015-3025 (2004) - [c21]Tal Moran, Ronen Shaltiel, Amnon Ta-Shma:
Non-interactive Timestamping in the Bounded Storage Model. CRYPTO 2004: 460-476 - [c20]Ron Berman, Amos Fiat, Amnon Ta-Shma:
Provable Unlinkability against Traffic Analysis. Financial Cryptography 2004: 266-280 - [i6]Eran Rom, Amnon Ta-Shma:
Improveing the alphabet size in high noise, almost optimal rate list decodable codes. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j12]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma:
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Comput. Complex. 12(3-4): 85-130 (2003) - [j11]Sean Hallgren, Alexander Russell, Amnon Ta-Shma:
The Hidden Subgroup Problem and Quantum Computation Using Group Representations. SIAM J. Comput. 32(4): 916-934 (2003) - [j10]Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson:
The Quantum Communication Complexity of Sampling. SIAM J. Comput. 32(6): 1570-1585 (2003) - [c19]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma:
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. CCC 2003: 33-47 - [c18]Dorit Aharonov, Amnon Ta-Shma:
Adiabatic quantum state generation and statistical zero knowledge. STOC 2003: 20-29 - 2002
- [j9]Amnon Ta-Shma:
Almost Optimal Dispersers. Comb. 22(1): 123-145 (2002) - [j8]Amnon Ta-Shma:
Storing information with extractors. Inf. Process. Lett. 83(5): 267-274 (2002) - [j7]Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani:
Dense quantum coding and quantum finite automata. J. ACM 49(4): 496-511 (2002) - 2001
- [c17]Amnon Ta-Shma, David Zuckerman, Shmuel Safra:
Extractors from Reed-Muller Codes. FOCS 2001: 638-647 - [c16]Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman:
Interaction in quantum communication and the complexity of set disjointness. STOC 2001: 124-133 - [c15]Amnon Ta-Shma, Christopher Umans, David Zuckerman:
Loss-less condensers, unbalanced expanders, and extractors. STOC 2001: 143-152 - [c14]Amnon Ta-Shma, David Zuckerman:
Extractor codes. STOC 2001: 193-199 - [i5]Amnon Ta-Shma, David Zuckerman, Shmuel Safra:
Extractors from Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j6]Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou:
An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. J. ACM 47(2): 294-311 (2000) - [j5]Jaikumar Radhakrishnan, Amnon Ta-Shma:
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM J. Discret. Math. 13(1): 2-24 (2000) - [c13]Tomas Sander, Amnon Ta-Shma, Moti Yung:
Blind, Auditable Membership Proofs. Financial Cryptography 2000: 53-71 - [c12]Sean Hallgren, Alexander Russell, Amnon Ta-Shma:
Normal subgroup reconstruction and quantum computation using group representations. STOC 2000: 627-635 - [c11]Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao:
Quantum bit escrow. STOC 2000: 705-714 - [i4]Ashwin Nayak, Amnon Ta-Shma, David Zuckerman:
Interaction in Quantum Communication Complexity. CoRR quant-ph/0005106 (2000)
1990 – 1999
- 1999
- [j4]Noam Nisan, Amnon Ta-Shma:
Extracting Randomness: A Survey and New Constructions. J. Comput. Syst. Sci. 58(1): 148-173 (1999) - [j3]Amnon Ta-Shma:
Classical versus quantum communication complexity. SIGACT News 30(3): 25-34 (1999) - [c10]Tomas Sander, Amnon Ta-Shma:
Auditable, Anonymous Electronic Cash Extended Abstract. CRYPTO 1999: 555-572 - [c9]Tomas Sander, Amnon Ta-Shma:
Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems. Financial Cryptography 1999: 46-61 - [c8]Tomas Sander, Amnon Ta-Shma:
On Anonymous Electronic Cash and Crime. ISW 1999: 202-206 - [c7]Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani:
Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. STOC 1999: 376-383 - 1998
- [c6]Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson:
The Quantum Communication Complexity of Sampling. FOCS 1998: 342-351 - [c5]Amnon Ta-Shma:
Almost Optimal Dispersers. STOC 1998: 196-202 - [i3]Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani:
Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata. CoRR quant-ph/9804043 (1998) - 1997
- [c4]Jaikumar Radhakrishnan, Amnon Ta-Shma:
Tight Bounds for Depth-two Superconcentrators. FOCS 1997: 585-594 - [c3]Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou:
SL <= L4/3. STOC 1997: 230-239 - 1996
- [b1]Amnon Ta-Shma:
Refining randomness (כיצד לזקק אקראיות גסה.). Hebrew University of Jerusalem, Israel, 1996 - [j2]Amnon Ta-Shma:
A Note on PCP vs. MIP. Inf. Process. Lett. 58(3): 135-140 (1996) - [c2]