Jonathan Mosheiff

41 papers A* 4A 5B 2Journal 29Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Let's Have Both! Optimal List-Recoverability With Polynomial Randomness via Alphabet Permutation Codes. IEEE Trans. Inf. Theory Sergey A. Komech, Jonathan Mosheiff
2025	J	`jnl`	Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes. CoRR Sergey Komech, Jonathan Mosheiff
2025	J	`jnl`	List-Recovery of Random Linear Codes Over Small Fields. IEEE Trans. Inf. Theory Dean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro
2025	A	`conf`	List-Recovery of Random Linear Codes over Small Fields. APPROX/RANDOM Dean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro
2025	J	`jnl`	List-Recovery of Random Linear Codes over Small Fields. CoRR Dean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro
2025	A	`conf`	Low-Degree Polynomials Are Good Extractors. APPROX/RANDOM Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro
2025	A*	`conf`	Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent. FOCS Matan Levi, Jonathan Mosheiff, Nikhil Shagrithaya
2025	B	`conf`	Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. ISIT Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan
2024	J	`jnl`	Local Properties of Reed-Solomon Codes and Random Linear Codes. CoRR Matan Levi, Jonathan Mosheiff, Nikhil Shagrithaya
2024	J	`jnl`	Low-Degree Polynomials Are Good Extractors. CoRR Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro
2024	J	`jnl`	Low-Degree Polynomials Are Good Extractors. Electron. Colloquium Comput. Complex. Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro
2024	J	`jnl`	Low-Density Parity-Check Codes Achieve List-Decoding Capacity. SIAM J. Comput. Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
2024	J	`jnl`	Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. CoRR Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan
2024	A	`conf`	When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? APPROX/RANDOM Dean Doron, Jonathan Mosheiff, Mary Wootters
2024	J	`jnl`	When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? CoRR Dean Doron, Jonathan Mosheiff, Mary Wootters
2024	J	`jnl`	When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? Electron. Colloquium Comput. Complex. Dean Doron, Jonathan Mosheiff, Mary Wootters
2022	J	`jnl`	Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Trans. Inf. Theory Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2022	A*	`conf`	Punctured Low-Bias Codes Behave Like Random Linear Codes. FOCS Venkatesan Guruswami, Jonathan Mosheiff
2022	J	`jnl`	Sparsity and 𝓁 CoRR Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
2022	J	`jnl`	Testability in group theory. CoRR Oren Becker, Alexander Lubotzky, Jonathan Mosheiff
2022	J	`jnl`	Threshold Rates for Properties of Random Codes. IEEE Trans. Inf. Theory Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2022	A	`conf`	ℓ CCC Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
2021	J	`jnl`	Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity. CoRR Venkatesan Guruswami, Jonathan Mosheiff
2021	J	`jnl`	Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Jonathan Mosheiff
2021	A	`conf`	Sharp Threshold Rates for Random Codes. ITCS Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2021	A*	`conf`	Testability of relations between permutations. FOCS Oren Becker, Alexander Lubotzky, Jonathan Mosheiff
2021	J	`jnl`	𝓁 CoRR Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
2020	—	`conf`	Bounds for List-Decoding and List-Recovery of Random Linear Codes. APPROX-RANDOM Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2020	J	`jnl`	Bounds for list-decoding and list-recovery of random linear codes. CoRR Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2020	A*	`conf`	LDPC Codes Achieve List Decoding Capacity. FOCS Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
2020	J	`jnl`	On the weight distribution of random binary linear codes. Random Struct. Algorithms Nati Linial, Jonathan Mosheiff
2020	J	`jnl`	Sharp threshold rates for random codes. CoRR Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2020	J	`jnl`	Stability and testability: equations in permutations. CoRR Oren Becker, Alexander Lubotzky, Jonathan Mosheiff
2019	J	`jnl`	LDPC Codes Achieve List Decoding Capacity. CoRR Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
2019	J	`jnl`	LDPC Codes Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
2018	J	`jnl`	On the weight distribution of random binary linear codes. CoRR Nati Linial, Jonathan Mosheiff
2018	J	`jnl`	Two-machine flow shop and open shop scheduling problems with a single maintenance window. Eur. J. Oper. Res. Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich, Jonathan Mosheiff
2017	J	`jnl`	On the Rigidity of Sparse Random Graphs. J. Graph Theory Nati Linial, Jonathan Mosheiff
2015	J	`jnl`	On the Rigidity of Sparse Random Graphs. CoRR Nati Linial, Jonathan Mosheiff
2015	J	`jnl`	Prime languages. Inf. Comput. Orna Kupferman, Jonathan Mosheiff
2013	B	`conf`	Prime Languages. MFCS Orna Kupferman, Jonathan Mosheiff