Michael Viderman

Publication Activity (10 Years)

Years Active: 2008-2018
Publications (10 Years): 4

Top Topics

Low Density Parity Check

Decoding Process

Error Correction

Top Venues

Electron. Colloquium Comput. Complex.

Comput. Complex.

Publications

Dotan Di Castro, Iftah Gamzu, Irena Grabovitch-Zuyev, Liane Lewin-Eytan, Abhinav Pundir, Nil Ratan Sahoo, Michael Viderman
Automated Extractions for Machine Generated Mail. WWW (Companion Volume) (2018)
Noa Avigdor-Elgrabli, Alex Libov, Michael Viderman, Ran Wolff
Interpreting Complex Regression Models. CoRR (2018)
Michael Viderman
Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness. APPROX-RANDOM (2018)
Eli Ben-Sasson, Michael Viderman
A combinatorial characterization of smooth LTCs and applications. Random Struct. Algorithms 49 (2) (2016)
Michael Viderman
Explicit Strong LTCs with inverse poly-log rate and constant soundness. Electron. Colloquium Comput. Complex. 22 (2015)
Eli Ben-Sasson, Michael Viderman
Composition of semi-LTCs by two-wise tensor products. Comput. Complex. 24 (3) (2015)
Michael Viderman
A combination of testability and decodability by tensor products. Random Struct. Algorithms 46 (3) (2015)
Michael Viderman
Linear-time decoding of regular expander codes. ACM Trans. Comput. Theory 5 (3) (2013)
Michael Viderman
Strong LTCs with Inverse Poly-Log Rate and Constant Soundness. FOCS (2013)
Michael Viderman
LP decoding of codes with expansion parameter above 2/3. Inf. Process. Lett. 113 (7) (2013)
Michael Viderman
Strong LTCs with inverse poly-log rate and constant soundness. Electron. Colloquium Comput. Complex. 20 (2013)
Michael Viderman
Strong LTCs with Inverse Polylogarithmic Rate and Soundness. Computational Complexity Conference (2013)
Yonatan Goldhirsh, Michael Viderman
Testing Membership in Counter Automaton Languages. APPROX-RANDOM (2013)
Yuval Ishai, Amit Sahai, Michael Viderman, Mor Weiss
Zero Knowledge LTCs and Their Applications. APPROX-RANDOM (2013)
Eli Ben-Sasson, Michael Viderman
A Combinatorial Characterization of smooth LTCs and Applications. Electron. Colloquium Comput. Complex. 19 (2012)
Michael Viderman
Strong LTCs with inverse polylogarithmic rate and soundness. Electron. Colloquium Comput. Complex. 19 (2012)
Michael Viderman
A Combination of Testability and Decodability by Tensor Products. APPROX-RANDOM (2012)
Eli Ben-Sasson, Michael Viderman
Towards lower bounds on locally testable codes via density arguments. Comput. Complex. 21 (2) (2012)
Michael Viderman
LP decoding of expander codes: a simpler proof CoRR (2012)
Michael Viderman
Linear time decoding of regular expander codes. ITCS (2012)
Michael Viderman
A Combination of Testability and Decodability by Tensor Products CoRR (2011)
Eli Ben-Sasson, Michael Viderman
Composition of semi-LTCs by two-wise Tensor Products. Electron. Colloquium Comput. Complex. 18 (2011)
Eli Ben-Sasson, Michael Viderman
Towards Lower Bounds on Locally Testable Codes via Density Arguments. Computational Complexity Conference (2011)
Michael Viderman
Linear time decoding of regular expander codes. Electron. Colloquium Comput. Complex. 18 (2011)
Michael Viderman
A Combination of Testability and Decodability by Tensor Products. Electron. Colloquium Comput. Complex. 18 (2011)
Eli Ben-Sasson, Michael Viderman
Low Rate Is Insufficient for Local Testability. Electron. Colloquium Comput. Complex. 17 (2010)
Eli Ben-Sasson, Michael Viderman
Towards lower bounds on locally testable codes via density arguments. Electron. Colloquium Comput. Complex. 17 (2010)
Eli Ben-Sasson, Michael Viderman
Low Rate Is Insufficient for Local Testability. APPROX-RANDOM (2010)
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
Locally Testable Codes Require Redundant Testers. SIAM J. Comput. 39 (7) (2010)
Tali Kaufman, Michael Viderman
Locally Testable vs. Locally Decodable Codes. APPROX-RANDOM (2010)
Tali Kaufman, Michael Viderman
Locally Testable vs. Locally Decodable Codes. Electron. Colloquium Comput. Complex. 17 (2010)
Michael Viderman
A Note on high-rate Locally Testable Codes with sublinear query complexity. Electron. Colloquium Comput. Complex. 17 (2010)
Eli Ben-Sasson, Michael Viderman
Tensor Products of Weakly Smooth Codes are Robust. Electron. Colloquium Comput. Complex. 16 (2009)
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
Locally Testable Codes Require Redundant Testers. Computational Complexity Conference (2009)
Eli Ben-Sasson, Michael Viderman
Tensor Products of Weakly Smooth Codes are Robust. Theory Comput. 5 (1) (2009)
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
Locally Testable Codes Require Redundant Testers. Electron. Colloquium Comput. Complex. 16 (2009)
Eli Ben-Sasson, Michael Viderman
Composition of Semi-LTCs by Two-Wise Tensor Products. APPROX-RANDOM (2009)
Eli Ben-Sasson, Michael Viderman
Tensor Products of Weakly Smooth Codes Are Robust. APPROX-RANDOM (2008)