Jonathan Mosheiff

Orcid: 0000-0002-7947-1205

According to our database1, Jonathan Mosheiff authored at least 16 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes.
CoRR, 2024

2022
Bounds for List-Decoding and List-Recovery of Random Linear Codes.
IEEE Trans. Inf. Theory, 2022

Sparsity and 𝓁<sub>p</sub>-Restricted Isometry.
CoRR, 2022

Testability in group theory.
CoRR, 2022

Punctured Low-Bias Codes Behave Like Random Linear Codes.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

ℓ<sub>p</sub>-Spread and Restricted Isometry Properties of Sparse Random Matrices.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity.
Electron. Colloquium Comput. Complex., 2021

𝓁<sub>p</sub>-Spread Properties of Sparse Matrices.
CoRR, 2021

Sharp Threshold Rates for Random Codes.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Testability of relations between permutations.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
On the weight distribution of random binary linear codes.
Random Struct. Algorithms, 2020

Stability and testability: equations in permutations.
CoRR, 2020

2019
LDPC Codes Achieve List-Decoding Capacity.
Electron. Colloquium Comput. Complex., 2019

2018
Two-machine flow shop and open shop scheduling problems with a single maintenance window.
Eur. J. Oper. Res., 2018

2017
On the Rigidity of Sparse Random Graphs.
J. Graph Theory, 2017

2015
Prime languages.
Inf. Comput., 2015


  Loading...