Seguir
Jonathan Mosheiff
Jonathan Mosheiff
Assistant Professor, Ben-Gurion University
Dirección de correo verificada de bgu.ac.il - Página principal
Título
Citado por
Citado por
Año
Low-Density Parity-Check Codes Achieve List-Decoding Capacity
J Mosheiff, N Resch, N Ron-Zewi, S Silas, M Wootters
SIAM Journal on Computing, FOCS20-38-FOCS20-73, 2021
40*2021
Two-machine flow shop and open shop scheduling problems with a single maintenance window
G Mosheiov, A Sarig, VA Strusevich, J Mosheiff
European Journal of Operational Research 271 (2), 388-400, 2018
402018
Bounds for list-decoding and list-recovery of random linear codes
V Guruswami, R Li, J Mosheiff, N Resch, S Silas, M Wootters
IEEE Transactions on Information Theory, 2021
272021
Abelian groups are polynomially stable
O Becker, J Mosheiff
International Mathematics Research Notices, 2020
172020
Punctured low-bias codes behave like random linear codes
V Guruswami, J Mosheiff
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 36-45, 2022
152022
On the weight distribution of random binary linear codes
N Linial, J Mosheiff
Random Structures & Algorithms 56 (1), 5-36, 2020
132020
Threshold rates for properties of random codes
V Guruswami, J Mosheiff, N Resch, S Silas, M Wootters
IEEE Transactions on Information Theory 68 (2), 905-922, 2021
11*2021
Prime languages
O Kupferman, J Mosheiff
Information and Computation 240, 90-107, 2015
112015
On the rigidity of sparse random graphs
N Linial, J Mosheiff
Journal of Graph Theory 85 (2), 466-480, 2017
82017
𝓁_p-Spread and Restricted Isometry Properties of Sparse Random Matrices
V Guruswami, P Manohar, J Mosheiff
37th Computational Complexity Conference (CCC 2022), 2022
72022
Testability of relations between permutations
O Becker, A Lubotzky, J Mosheiff
2021 ieee 62nd annual symposium on foundations of computer science (focs …, 2022
5*2022
Testability in group theory
O Becker, A Lubotzky, J Mosheiff
Israel Journal of Mathematics 256 (1), 61-90, 2023
32023
Low-Degree Polynomials Are Good Extractors
O Alrabiah, J Goodman, J Mosheiff, J Ribeiro
arXiv preprint arXiv:2405.10297, 2024
12024
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
D Doron, J Mosheiff, M Wootters
arXiv preprint arXiv:2405.08584, 2024
12024
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
J Mosheiff, N Resch, K Shang, C Yuan
arXiv preprint arXiv:2402.11533, 2024
12024
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
D Aggarwal, S Guo, M Obremski, J Ribeiro, N Stephens-Davidowitz, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
12020
Local Properties of Reed-Solomon Codes and Random Linear Codes
M Levi, J Mosheiff, N Shagrithaya
arXiv preprint arXiv:2406.02238, 2024
2024
Sparsity and -Restricted Isometry
V Guruswami, P Manohar, J Mosheiff
arXiv preprint arXiv:2205.06738, 2022
2022
LIPIcs, Volume 176, APPROX/RANDOM 2020, Complete Volume}}
K Ahn, S Miracle, AP Streib, N Streib, Z Guo, R Gurjar, NH Bshouty, ...
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020
2020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–19