( en | de | ru )

 

Disambiguation of "Ta-Shma, Amnon"

Author of the publication

copydeleteadd this publication to your clipboard
On approximating the eigenvalues of stochastic matrices in probabilistic logspace.

, , and . Electron. Colloquium Comput. Complex., (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Amnon Sonnenberg

Amnon Sonnenberg

Amnon Sonnenberg

Amnon Rosenfeld

Amnôn Nôy

 

Other publications of authors with the same name

The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent., and . FSTTCS, volume 29 of LIPIcs, page 327-338. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)On the Power of Quantum, One Round, Two Prover Interactive Proof Systems., and . Quantum Inf. Process., 6 (6): 445-459 (2007)New connections between derandomization, worst-case complexity and average-case complexity., and . Electron. Colloquium Comput. Complex., (2006)Improveing the alphabet size in high noise, almost optimal rate list decodable codes, and . Electron. Colloquium Comput. Complex., (2004)On approximating the eigenvalues of stochastic matrices in probabilistic logspace., , and . Electron. Colloquium Comput. Complex., (2016)Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends., , and . Electron. Colloquium Comput. Complex., (2018)On Extracting Randomness From Weak Random Sources. Electron. Colloquium Comput. Complex., (1995)Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes., and . Electron. Colloquium Comput. Complex., (2013)Towards the Impossibility of Non-Signalling Privacy Amplification from Time-Like Ordering Constraints, , and . CoRR, (2012)On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy., , and . Theory of Computing, 3 (1): 45-60 (2007)