List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Explicit strong LTCs with inverse poly-log rate and constant soundness | 2021-08-04 | Paper |
| Linear time decoding of regular expander codes Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
| A combinatorial characterization of smooth LTCs and applications Random Structures & Algorithms | 2016-09-15 | Paper |
| Linear-time decoding of regular expander codes ACM Transactions on Computation Theory | 2015-09-24 | Paper |
| Composition of semi-LTCs by two-wise tensor products Computational Complexity | 2015-09-21 | Paper |
| A combination of testability and decodability by tensor products Random Structures & Algorithms | 2015-05-29 | Paper |
| Zero knowledge LTCs and their applications Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
| Testing membership in counter automaton languages Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
| LP decoding of codes with expansion parameter above \(2/3\) Information Processing Letters | 2013-03-20 | Paper |
| Towards lower bounds on locally testable codes via density arguments Computational Complexity | 2012-12-07 | Paper |
| A combination of testability and decodability by tensor products Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
| Tensor products of weakly smooth codes are robust Theory of Computing | 2011-05-24 | Paper |
| Locally Testable Codes Require Redundant Testers SIAM Journal on Computing | 2011-04-04 | Paper |
| Low Rate Is Insufficient for Local Testability Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
| Locally testable vs. locally decodable codes Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
| Composition of Semi-LTCs by Two-Wise Tensor Products Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
| Tensor Products of Weakly Smooth Codes Are Robust Lecture Notes in Computer Science | 2008-11-27 | Paper |
Research outcomes over time
This page was built for person: Michael Viderman
