Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
17 Publications
2022 | Conference Paper | IST-REx-ID: 11145 | 
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. In 62nd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022, pp. 720–726). Denver, CO, United States: IEEE. https://doi.org/10.1109/FOCS52979.2021.00075
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 10775 |
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2022.3148779
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11443 |
Kwan, M. A., Sauermann, L., & Zhao, Y. (2022). Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/8614
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11740 |
Cooley, O., Del Giudice, N., Kang, M., & Sprüssel, P. (2022). Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/10607
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 12151 |
Cooley, O., Kang, M., & Pikhurko, O. (2022). On a question of Vera T. Sós about size forcing of graphons. Acta Mathematica Hungarica. Springer Nature. https://doi.org/10.1007/s10474-022-01265-8
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In 63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/FOCS54457.2022.00091
View
| DOI
| WoS
2022 | Journal Article | IST-REx-ID: 12286 |
Cooley, O., Kang, M., & Zalla, J. (2022). Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics. https://doi.org/10.37236/10794
[Published Version]
View
| Files available
| DOI
| WoS