Michael Viderman

According to our database, Michael Viderman authored at least 21 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendation.

Alex Shtoff, Michael Viderman, Naama Haramaty-Krasne, Oren Somekh, Ariel Raviv, Tularam Ban

Proceedings of the 18th ACM Conference on Recommender Systems, 2024

2018

Interpreting Complex Regression Models.

Noa Avigdor-Elgrabli, Alex Libov, Michael Viderman, Ran Wolff

CoRR, 2018

Automated Extractions for Machine Generated Mail.

Dotan Di Castro, Iftah Gamzu, Irena Grabovitch-Zuyev, Liane Lewin-Eytan, Abhinav Pundir, Nil Ratan Sahoo, Michael Viderman

Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness.

Michael Viderman

Proceedings of the Approximation, 2018

2013

LP decoding of codes with expansion parameter above 2/3.

Michael Viderman

Inf. Process. Lett., 2013

Strong LTCs with Inverse Poly-Log Rate and Constant Soundness.

Michael Viderman

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Strong LTCs with Inverse Polylogarithmic Rate and Soundness.

Michael Viderman

Proceedings of the 28th Conference on Computational Complexity, 2013

Zero Knowledge LTCs and Their Applications.

Yuval Ishai, Amit Sahai, Michael Viderman, Mor Weiss

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

Testing Membership in Counter Automaton Languages.

Yonatan Goldhirsh, Michael Viderman

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Towards lower bounds on locally testable codes.

Michael Viderman

PhD thesis, 2012

A Combinatorial Characterization of smooth LTCs and Applications.

Eli Ben-Sasson, Michael Viderman

Electron. Colloquium Comput. Complex., 2012

LP decoding of expander codes: a simpler proof

Michael Viderman

CoRR, 2012

Linear time decoding of regular expander codes.

Michael Viderman

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

A Combination of Testability and Decodability by Tensor Products.

Michael Viderman

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Towards Lower Bounds on Locally Testable Codes via Density Arguments.

Eli Ben-Sasson, Michael Viderman

Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

2010

A Note on high-rate Locally Testable Codes with sublinear query complexity.

Michael Viderman

Electron. Colloquium Comput. Complex., 2010

Locally Testable vs. Locally Decodable Codes.

Tali Kaufman, Michael Viderman

Proceedings of the Approximation, 2010

Low Rate Is Insufficient for Local Testability.

Eli Ben-Sasson, Michael Viderman

Proceedings of the Approximation, 2010

2009

Locally Testable Codes Require Redundant Testers.

Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

Composition of Semi-LTCs by Two-Wise Tensor Products.

Eli Ben-Sasson, Michael Viderman

Proceedings of the Approximation, 2009

2008

Tensor Products of Weakly Smooth Codes Are Robust.

Eli Ben-Sasson, Michael Viderman

Proceedings of the Approximation, 2008