Jonathan Mosheiff
Jonathan Mosheiff
Postdoctoral Fellow, Carnegie Mellon University
Verified email at andrew.cmu.edu - Homepage
Title
Cited by
Cited by
Year
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
15*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
152018
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
102021
Abelian groups are polynomially stable
O Becker, J Mosheiff
International Mathematics Research Notices, 2020
102020
On the weight distribution of random binary linear codes
N Linial, J Mosheiff
Random Structures & Algorithms 56 (1), 5-36, 2020
82020
Prime languages
O Kupferman, J Mosheiff
Information and Computation 240, 90-107, 2015
42015
Testability of relations between permutations
O Becker, A Lubotzky, J Mosheiff
arXiv preprint arXiv:2011.05234, 2020
3*2020
Threshold rates for properties of random codes
V Guruswami, J Mosheiff, N Resch, S Silas, M Wootters
IEEE Transactions on Information Theory, 2021
2*2021
On the rigidity of sparse random graphs
N Linial, J Mosheiff
Journal of Graph Theory 85 (2), 466-480, 2017
22017
Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity
V Guruswami, J Mosheiff
arXiv preprint arXiv:2109.11725, 2021
2021
-Spread Properties of Sparse Matrices
V Guruswami, P Manohar, J Mosheiff
arXiv preprint arXiv:2108.13578, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–11