default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Viderman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]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: 238-246- [i17]Alex Shtoff, Michael Viderman, Naama Haramaty-Krasne, Oren Somekh, Ariel Raviv, Tularam Ban:
Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendation. CoRR abs/2408.00801 (2024)
2010 – 2019
- 2018
- [c14]Michael Viderman:
Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness. APPROX-RANDOM 2018: 58:1-58:14 - [c13]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: 655-662 - [i16]Noa Avigdor-Elgrabli, Alex Libov, Michael Viderman, Ran Wolff:
Interpreting Complex Regression Models. CoRR abs/1802.09225 (2018) - 2016
- [j8]Eli Ben-Sasson, Michael Viderman:
A combinatorial characterization of smooth LTCs and applications. Random Struct. Algorithms 49(2): 280-307 (2016) - 2015
- [j7]Eli Ben-Sasson, Michael Viderman:
Composition of semi-LTCs by two-wise tensor products. Comput. Complex. 24(3): 601-643 (2015) - [j6]Michael Viderman:
A combination of testability and decodability by tensor products. Random Struct. Algorithms 46(3): 572-598 (2015) - [i15]Michael Viderman:
Explicit Strong LTCs with inverse poly-log rate and constant soundness. Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- [j5]Michael Viderman:
LP decoding of codes with expansion parameter above 2/3. Inf. Process. Lett. 113(7): 225-228 (2013) - [j4]Michael Viderman:
Linear-time decoding of regular expander codes. ACM Trans. Comput. Theory 5(3): 10:1-10:25 (2013) - [c12]Yonatan Goldhirsh, Michael Viderman:
Testing Membership in Counter Automaton Languages. APPROX-RANDOM 2013: 543-558 - [c11]Yuval Ishai, Amit Sahai, Michael Viderman, Mor Weiss:
Zero Knowledge LTCs and Their Applications. APPROX-RANDOM 2013: 607-622 - [c10]Michael Viderman:
Strong LTCs with Inverse Polylogarithmic Rate and Soundness. CCC 2013: 255-265 - [c9]Michael Viderman:
Strong LTCs with Inverse Poly-Log Rate and Constant Soundness. FOCS 2013: 330-339 - [i14]Michael Viderman:
Strong LTCs with inverse poly-log rate and constant soundness. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [b1]Michael Viderman:
Towards lower bounds on locally testable codes. Technion - Israel Institute of Technology, Israel, 2012 - [j3]Eli Ben-Sasson, Michael Viderman:
Towards lower bounds on locally testable codes via density arguments. Comput. Complex. 21(2): 267-309 (2012) - [c8]Michael Viderman:
A Combination of Testability and Decodability by Tensor Products. APPROX-RANDOM 2012: 651-662 - [c7]Michael Viderman:
Linear time decoding of regular expander codes. ITCS 2012: 168-182 - [i13]Michael Viderman:
LP decoding of expander codes: a simpler proof. CoRR abs/1206.2568 (2012) - [i12]Eli Ben-Sasson, Michael Viderman:
A Combinatorial Characterization of smooth LTCs and Applications. Electron. Colloquium Comput. Complex. TR12 (2012) - [i11]Michael Viderman:
Strong LTCs with inverse polylogarithmic rate and soundness. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c6]Eli Ben-Sasson, Michael Viderman:
Towards Lower Bounds on Locally Testable Codes via Density Arguments. CCC 2011: 66-76 - [i10]Michael Viderman:
A Combination of Testability and Decodability by Tensor Products. CoRR abs/1105.5806 (2011) - [i9]Eli Ben-Sasson, Michael Viderman:
Composition of semi-LTCs by two-wise Tensor Products. Electron. Colloquium Comput. Complex. TR11 (2011) - [i8]Michael Viderman:
Linear time decoding of regular expander codes. Electron. Colloquium Comput. Complex. TR11 (2011) - [i7]Michael Viderman:
A Combination of Testability and Decodability by Tensor Products. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j2]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. SIAM J. Comput. 39(7): 3230-3247 (2010) - [c5]Eli Ben-Sasson, Michael Viderman:
Low Rate Is Insufficient for Local Testability. APPROX-RANDOM 2010: 420-433 - [c4]Tali Kaufman, Michael Viderman:
Locally Testable vs. Locally Decodable Codes. APPROX-RANDOM 2010: 670-682 - [i6]Eli Ben-Sasson, Michael Viderman:
Low Rate Is Insufficient for Local Testability. Electron. Colloquium Comput. Complex. TR10 (2010) - [i5]Eli Ben-Sasson, Michael Viderman:
Towards lower bounds on locally testable codes via density arguments. Electron. Colloquium Comput. Complex. TR10 (2010) - [i4]Tali Kaufman, Michael Viderman:
Locally Testable vs. Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i3]Michael Viderman:
A Note on high-rate Locally Testable Codes with sublinear query complexity. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j1]Eli Ben-Sasson, Michael Viderman:
Tensor Products of Weakly Smooth Codes are Robust. Theory Comput. 5(1): 239-255 (2009) - [c3]Eli Ben-Sasson, Michael Viderman:
Composition of Semi-LTCs by Two-Wise Tensor Products. APPROX-RANDOM 2009: 378-391 - [c2]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. CCC 2009: 52-61 - [i2]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. Electron. Colloquium Comput. Complex. TR09 (2009) - [i1]Eli Ben-Sasson, Michael Viderman:
Tensor Products of Weakly Smooth Codes are Robust. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c1]Eli Ben-Sasson, Michael Viderman:
Tensor Products of Weakly Smooth Codes Are Robust. APPROX-RANDOM 2008: 290-302
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
