We stand with Ukraine  

Michael Viderman

Orcid: 0009-0008-8555-1042

According to our database1, Michael Viderman authored at least 21 papers between 2009 and 2024.

Collaborative distances:

Timeline

2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
1
2
2
4
2
4
1
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendation.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Noa Avigdor-Elgrabli
,
Alex Libov
,
Michael Viderman
,
Ran Wolff
CoRR, 2018

Automated Extractions for Machine Generated Mail.
[BibTeX]
[DOI]
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

2015
Explicit Strong LTCs with inverse poly-log rate and constant soundness.
[BibTeX]
[DOI]
Michael Viderman
Electron. Colloquium Comput. Complex., 2015

Composition of semi-LTCs by two-wise tensor products.
[BibTeX]
[DOI]
Eli Ben-Sasson
,
Michael Viderman
Comput. Complex., 2015

2013
LP decoding of codes with expansion parameter above 2/3.
[BibTeX]
[DOI]
Michael Viderman
Inf. Process. Lett., 2013

Strong LTCs with inverse poly-log rate and constant soundness.
[BibTeX]
[DOI]
Michael Viderman
Electron. Colloquium Comput. Complex., 2013

Zero Knowledge LTCs and Their Applications.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Yonatan Goldhirsh
,
Michael Viderman
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Towards lower bounds on locally testable codes.
[BibTeX]
[DOI]
Michael Viderman
PhD thesis, 2012

Strong LTCs with inverse polylogarithmic rate and soundness.
[BibTeX]
[DOI]
Michael Viderman
Electron. Colloquium Comput. Complex., 2012

A Combinatorial Characterization of smooth LTCs and Applications.
[BibTeX]
[DOI]
Eli Ben-Sasson
,
Michael Viderman
Electron. Colloquium Comput. Complex., 2012

LP decoding of expander codes: a simpler proof
[BibTeX]
[DOI]
Michael Viderman
CoRR, 2012

Towards lower bounds on locally testable codes via density arguments.
[BibTeX]
[DOI]
Eli Ben-Sasson
,
Michael Viderman
Comput. Complex., 2012

2011
A Combination of Testability and Decodability by Tensor Products.
[BibTeX]
[DOI]
Michael Viderman
Electron. Colloquium Comput. Complex., 2011

Linear time decoding of regular expander codes.
[BibTeX]
[DOI]
Michael Viderman
Electron. Colloquium Comput. Complex., 2011

2010
Locally Testable Codes Require Redundant Testers.
[BibTeX]
[DOI]
Eli Ben-Sasson
,
Venkatesan Guruswami
,
Tali Kaufman
,
Madhu Sudan
,
Michael Viderman
SIAM J. Comput., 2010

A Note on high-rate Locally Testable Codes with sublinear query complexity.
[BibTeX]
[DOI]
Michael Viderman
Electron. Colloquium Comput. Complex., 2010

Locally Testable vs. Locally Decodable Codes.
[BibTeX]
[DOI]
Tali Kaufman
,
Michael Viderman
Electron. Colloquium Comput. Complex., 2010

Low Rate Is Insufficient for Local Testability.
[BibTeX]
[DOI]
Eli Ben-Sasson
,
Michael Viderman
Electron. Colloquium Comput. Complex., 2010

2009
Tensor Products of Weakly Smooth Codes are Robust.
[BibTeX]
[DOI]
Eli Ben-Sasson
,
Michael Viderman
Electron. Colloquium Comput. Complex., 2009


  Loading...