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.




9 Publications

2022 | Conference Paper | IST-REx-ID: 11145 | OA
A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” in 62nd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022, pp. 720–726.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2022 | Journal Article | IST-REx-ID: 10775 | OA
A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” IEEE Transactions on Information Theory, vol. 68, no. 6. IEEE, pp. 3823–3828, 2022.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2022 | Journal Article | IST-REx-ID: 11186 | OA
M. A. Kwan, A. Sah, and M. Sawhney, “Large deviations in random latin squares,” Bulletin of the London Mathematical Society, vol. 54, no. 4. Wiley, pp. 1420–1438, 2022.
View | Files available | DOI | arXiv
 
2022 | Journal Article | IST-REx-ID: 11443 | OA
M. A. Kwan, L. Sauermann, and Y. Zhao, “Extension complexity of low-dimensional polytopes,” Transactions of the American Mathematical Society, vol. 375, no. 6. American Mathematical Society, pp. 4209–4250, 2022.
View | DOI | Download Preprint (ext.) | arXiv
 
2022 | Journal Article | IST-REx-ID: 11706 | OA
A. Liebenau, L. Mattos, W. Mendonca dos Santos, and J. Skokan, “Asymmetric Ramsey properties of random graphs involving cliques and cycles,” Random Structures and Algorithms. Wiley, 2022.
View | DOI | Download Published Version (ext.)
 
2022 | Journal Article | IST-REx-ID: 11740 | OA
O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” Electronic Journal of Combinatorics, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.
View | Files available | DOI | arXiv
 
2022 | Journal Article | IST-REx-ID: 12151 | OA
O. Cooley, M. Kang, and O. Pikhurko, “On a question of Vera T. Sós about size forcing of graphons,” Acta Mathematica Hungarica, vol. 168. Springer Nature, pp. 1–26, 2022.
View | DOI | Download Preprint (ext.) | arXiv
 
2022 | Journal Article | IST-REx-ID: 12286 | OA
O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,” The Electronic Journal of Combinatorics, vol. 29, no. 4. The Electronic Journal of Combinatorics, 2022.
View | Files available | DOI
 
2022 | Conference Paper | IST-REx-ID: 12432
M. Anastos, “Solving the Hamilton cycle problem fast on average,” in 63rd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022–October, pp. 919–930.
View | DOI
 

Search

Filter Publications