Alex Shtoff, Michael Viderman, Naama Haramaty-Krasne, Oren Somekh, Ariel Raviv, Tularam Ban.
Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendation. RecSys 2024.
https://dl.acm.org/doi/10.1145/3640457.3688097
Noa Avigdor-Elgrabli, Alex Libov, Michael Viderman and Ran Wolff. Interpreting complex regression models.
http://arxiv.org/abs/1802.09225
Michael Viderman. Explicit Strong LTCs with inverse poly-log rate and constant soundness. RANDOM 2018.
http://eccc.hpi-web.de/report/2015/020/
Dotan Di Castro, Iftah Gamzu, Irena Grabovitch-Zuyev, Liane Lewin-Eytan, Abhinav Pundir, Nil Ratan Sahoo and Michael Viderman
Automated Extractions for Machine Generated Mail. WWW (Companion Volume) 2018.
https://dl.acm.org/citation.cfm?id=3184558.3186582
Yuval Ishai, Amit Sahai, Michael Viderman and Mor Weiss. Zero Knowledge LTCs and Their Applications. RANDOM 2013.
http://link.springer.com/chapter/10.1007%2F978-3-642-40328-6_42
Michael Viderman. Strong LTCs with inverse poly-log rate and constant soundness. FOCS 2013.
http://eccc.hpi-web.de/report/2013/022/
Yonatan Goldhirsh and Michael Viderman. Testing Membership in Counter Automaton Languages. RANDOM 2013.
Michael Viderman. Strong LTCs with inverse polylogarithmic rate and soundness. CCC 2013.
http://eccc.hpi-web.de/report/2012/168/
Eli Ben-Sasson and Michael Viderman. A Combinatorial Characterization of smooth LTCs and Applications. Random Structures and Algorithms 2016.
http://eccc.hpi-web.de/report/2012/159/
Michael Viderman. LP decoding of codes with expansion parameter above 2/3. Arxiv 2012.
Information Processing Letters, Volume 113, Issue 7, 15 April 2013, Pages 225–228.
http://arxiv.org/abs/1206.2568
Michael Viderman. A Combination of Testability and Decodability by Tensor Products. Random Structures and Algorithms 2013.
The previous version appeared in RANDOM 2012.
http://eccc.hpi-web.de/report/2011/087/
Michael Viderman. Linear time decoding of regular expander codes. ACM Transactions on Computation Theory 2013.
The previous version appeared in ITCS 2012.
http://eccc.hpi-web.de/report/2011/058/
Eli Ben-Sasson and Michael Viderman. Towards lower bounds on locally testable codes via density arguments. Computational Complexity 2012.
The previous version appeared in CCC 2011.
http://eccc.hpi-web.de/report/2010/200/
Eli Ben-Sasson and Michael Viderman. Low Rate Is Insufficient for Local Testability. RANDOM 2010.
http://eccc.hpi-web.de/report/2010/004/
Tali Kaufman and Michael Viderman. Locally Testable vs. Locally Decodable Codes. RANDOM 2010.
http://eccc.hpi-web.de/report/2010/130/
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan and Michael Viderman. Locally Testable Codes Require Redundant Testers. SICOMP 2010.
The previous version appeared in CCC 2009.
http://eccc.hpi-web.de/report/2009/126/
Eli Ben-Sasson and Michael Viderman. Composition of semi-LTCs by two-wise Tensor Products. Computational Complexity 2013.
The previous version appeared in RANDOM 2009.
http://eccc.hpi-web.de/report/2011/070/
Eli Ben-Sasson and Michael Viderman.Tensor Products of Weakly Smooth Codes are Robust. Theory of Computing Journal 2009.
The previous version appeared in RANDOM 2008.
http://theoryofcomputing.org/articles/v005a012/
Notes
Michael Viderman. A Note on high-rate Locally Testable Codes with sublinear query complexity. ECCC 2010.