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 | 
List-decodability with large radius for Reed-Solomon codes
A. Ferber, M.A. Kwan, L. Sauermann, in:, 62nd Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2022, pp. 720–726.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
A. Ferber, M.A. Kwan, L. Sauermann, in:, 62nd Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2022, pp. 720–726.
2022 | Journal Article | IST-REx-ID: 10775 |
List-decodability with large radius for Reed-Solomon codes
A. Ferber, M.A. Kwan, L. Sauermann, IEEE Transactions on Information Theory 68 (2022) 3823–3828.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
A. Ferber, M.A. Kwan, L. Sauermann, IEEE Transactions on Information Theory 68 (2022) 3823–3828.
2022 | Journal Article | IST-REx-ID: 11443 |
Extension complexity of low-dimensional polytopes
M.A. Kwan, L. Sauermann, Y. Zhao, Transactions of the American Mathematical Society 375 (2022) 4209–4250.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
M.A. Kwan, L. Sauermann, Y. Zhao, Transactions of the American Mathematical Society 375 (2022) 4209–4250.
2022 | Journal Article | IST-REx-ID: 11740 |
Phase transition in cohomology groups of non-uniform random simplicial complexes
O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics 29 (2022).
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics 29 (2022).
2022 | Journal Article | IST-REx-ID: 12151 |
On a question of Vera T. Sós about size forcing of graphons
O. Cooley, M. Kang, O. Pikhurko, Acta Mathematica Hungarica 168 (2022) 1–26.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
O. Cooley, M. Kang, O. Pikhurko, Acta Mathematica Hungarica 168 (2022) 1–26.
2022 | Conference Paper | IST-REx-ID: 12432
Solving the Hamilton cycle problem fast on average
M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.
View
| DOI
| WoS
M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.
2022 | Journal Article | IST-REx-ID: 12286 |
Loose cores and cycles in random hypergraphs
O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29 (2022).
[Published Version]
View
| Files available
| DOI
| WoS
O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29 (2022).