Michael Viderman

42 papers A* 1A 5Journal 26Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	tensorFM: Low-Rank Approximations of Cross-Order Feature Interactions. CoRR Alessio Mazzetto, Mohammad Mahdi Khalili, Laura Fee Nern, Michael Viderman, Alex Shtoff, Krzysztof Dembczynski
2024	A	`conf`	Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendation. RecSys Alex Shtoff, Michael Viderman, Naama Haramaty-Krasne, Oren Somekh, Ariel Raviv, Tularam Ban
2024	J	`jnl`	Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendation. CoRR Alex Shtoff, Michael Viderman, Naama Haramaty-Krasne, Oren Somekh, Ariel Raviv, Tularam Ban
2018	—	`conf`	Automated Extractions for Machine Generated Mail. WWW (Companion Volume) Dotan Di Castro, Iftah Gamzu, Irena Grabovitch-Zuyev, Liane Lewin-Eytan, Abhinav Pundir, Nil Ratan Sahoo, Michael Viderman
2018	—	`conf`	Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness. APPROX-RANDOM Michael Viderman
2018	J	`jnl`	Interpreting Complex Regression Models. CoRR Noa Avigdor-Elgrabli, Alex Libov, Michael Viderman, Ran Wolff
2016	J	`jnl`	A combinatorial characterization of smooth LTCs and applications. Random Struct. Algorithms Eli Ben-Sasson, Michael Viderman
2015	J	`jnl`	A combination of testability and decodability by tensor products. Random Struct. Algorithms Michael Viderman
2015	J	`jnl`	Composition of semi-LTCs by two-wise tensor products. Comput. Complex. Eli Ben-Sasson, Michael Viderman
2015	J	`jnl`	Explicit Strong LTCs with inverse poly-log rate and constant soundness. Electron. Colloquium Comput. Complex. Michael Viderman
2013	J	`jnl`	LP decoding of codes with expansion parameter above 2/3. Inf. Process. Lett. Michael Viderman
2013	J	`jnl`	Linear-time decoding of regular expander codes. ACM Trans. Comput. Theory Michael Viderman
2013	A*	`conf`	Strong LTCs with Inverse Poly-Log Rate and Constant Soundness. FOCS Michael Viderman
2013	A	`conf`	Strong LTCs with Inverse Polylogarithmic Rate and Soundness. CCC Michael Viderman
2013	J	`jnl`	Strong LTCs with inverse poly-log rate and constant soundness. Electron. Colloquium Comput. Complex. Michael Viderman
2013	—	`conf`	Testing Membership in Counter Automaton Languages. APPROX-RANDOM Yonatan Goldhirsh, Michael Viderman
2013	—	`conf`	Zero Knowledge LTCs and Their Applications. APPROX-RANDOM Yuval Ishai, Amit Sahai, Michael Viderman, Mor Weiss
2012	—	`conf`	A Combination of Testability and Decodability by Tensor Products. APPROX-RANDOM Michael Viderman
2012	J	`jnl`	A Combinatorial Characterization of smooth LTCs and Applications. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2012	J	`jnl`	LP decoding of expander codes: a simpler proof CoRR Michael Viderman
2012	A	`conf`	Linear time decoding of regular expander codes. ITCS Michael Viderman
2012	J	`jnl`	Strong LTCs with inverse polylogarithmic rate and soundness. Electron. Colloquium Comput. Complex. Michael Viderman
2012	J	`jnl`	Towards lower bounds on locally testable codes via density arguments. Comput. Complex. Eli Ben-Sasson, Michael Viderman
2012	—	`—`	Towards lower bounds on locally testable codes. Michael Viderman
2011	J	`jnl`	A Combination of Testability and Decodability by Tensor Products CoRR Michael Viderman
2011	J	`jnl`	A Combination of Testability and Decodability by Tensor Products. Electron. Colloquium Comput. Complex. Michael Viderman
2011	J	`jnl`	Composition of semi-LTCs by two-wise Tensor Products. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2011	J	`jnl`	Linear time decoding of regular expander codes. Electron. Colloquium Comput. Complex. Michael Viderman
2011	A	`conf`	Towards Lower Bounds on Locally Testable Codes via Density Arguments. CCC Eli Ben-Sasson, Michael Viderman
2010	J	`jnl`	A Note on high-rate Locally Testable Codes with sublinear query complexity. Electron. Colloquium Comput. Complex. Michael Viderman
2010	J	`jnl`	Locally Testable Codes Require Redundant Testers. SIAM J. Comput. Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
2010	—	`conf`	Locally Testable vs. Locally Decodable Codes. APPROX-RANDOM Tali Kaufman, Michael Viderman
2010	J	`jnl`	Locally Testable vs. Locally Decodable Codes. Electron. Colloquium Comput. Complex. Tali Kaufman, Michael Viderman
2010	—	`conf`	Low Rate Is Insufficient for Local Testability. APPROX-RANDOM Eli Ben-Sasson, Michael Viderman
2010	J	`jnl`	Low Rate Is Insufficient for Local Testability. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2010	J	`jnl`	Towards lower bounds on locally testable codes via density arguments. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2009	—	`conf`	Composition of Semi-LTCs by Two-Wise Tensor Products. APPROX-RANDOM Eli Ben-Sasson, Michael Viderman
2009	A	`conf`	Locally Testable Codes Require Redundant Testers. CCC Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
2009	J	`jnl`	Locally Testable Codes Require Redundant Testers. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
2009	J	`jnl`	Tensor Products of Weakly Smooth Codes are Robust. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2009	J	`jnl`	Tensor Products of Weakly Smooth Codes are Robust. Theory Comput. Eli Ben-Sasson, Michael Viderman
2008	—	`conf`	Tensor Products of Weakly Smooth Codes Are Robust. APPROX-RANDOM Eli Ben-Sasson, Michael Viderman