I am a postdoc at Carnegie Mellon University's School of Computer Science, working with Prof. Venkat Guruswami.
Before that I was a postdoc at the Faculty of Mathematics and Computer Science at the Weizmann Institute, working with Prof. Irit Dinur.
I did my PhD at the School of Computer Science and Engineering of The Hebrew University under the guidance of Prof. Nati Linial.
During my PhD, I was an Adams Fellow.
I have a B.Sc in Mathematics and Computer Science, and an M.Sc in computer science, both from the Hebrew University. My M.Sc advisor was Prof. Orna Kupferman.
I have a broad interest in theoretical computer science and combinatorics. My recent focus has been on codes, property testing, and applications of group theory to computer science. I am also interested in graph theory and the analysis of boolean functions.
Here is my CV.
Stability and Testability: Equations in Permutations. Oren Becker, Alexander Lubotzky and Jonathan Mosheiff. Preprint. [pdf].
Sharp Threshold Rates for Random Codes. Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas and Mary Wootters. ITCS (2021). [pdf].
LDPC Codes Achieve List Decoding Capacity. Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas and Mary Wootters. FOCS (2020), Invited to FOCS special issue at SICOMP. [pdf].
Bounds for List-Decoding and List-Recovery of Random Linear Codes Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas and Mary Wootters. RANDOM (2020). [pdf].
Abelian Groups are Polynomially Stable. Oren Becker and Jonathan Mosheiff. International Mathematics Research Notices (2020). [pdf].
Two-machine Flow Shop and Open Shop Scheduling Problems with a Single Maintenance Window. "Gur Mosheiov, Assaf Sarig, Vitaly Strusevich and Jonathan Mosheiff. European Journal of Operational Research (2018).[pdf].