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.

Matthew Kwan

Aleksandr Grebennikov

Zhihan Jin

Lenka Kopfova

Kalina Petrova

Farhood Rostamkhani

Yiting Wang

Michael Anastos

Florestan Brunck

Oliver Cooley

Lyuben Lichev

Walner Mendonça

Benjamin Moore



59 Publications

2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging
M. Anastos, B. Auerbach, M.A. Baig, M. Cueto Noval, M.A. Kwan, G. Pascual Perez, K.Z. Pietrzak, in:, 22nd International Conference on Theory of Cryptography, Springer Nature, 2024, pp. 413–443.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
2024 | Published | Journal Article | IST-REx-ID: 17475 | OA
Exponentially many graphs are determined by their spectrum
I. Koval, M.A. Kwan, Quarterly Journal of Mathematics 75 (2024) 869–899.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 11706 | OA
Asymmetric Ramsey properties of random graphs involving cliques and cycles
A. Liebenau, L. Mattos, W. Mendonca dos Santos, J. Skokan, Random Structures and Algorithms 62 (2023) 1035–1055.
[Published Version] View | Files available | DOI | WoS
 
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
A note on long cycles in sparse random graphs
M. Anastos, Electronic Journal of Combinatorics 30 (2023).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
Fast algorithms for solving the Hamilton cycle problem with high probability
M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 14444 | OA
Substructures in Latin squares
M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256 (2023) 363–416.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 14499 | OA
Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (2023).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
Constructing Hamilton cycles and perfect matchings efficiently
M. Anastos, in:, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Masaryk University Press, 2023, pp. 36–41.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 15173 | OA
Enumerating matroids and linear spaces
M.A. Kwan, A. Sah, M. Sawhney, Comptes Rendus Mathematique 361 (2023) 565–575.
[Published Version] View | Files available | DOI | WoS | arXiv
 
earlier version | 2022 | Published | Conference Paper | IST-REx-ID: 11145 | OA
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
 
2022 | Published | Journal Article | IST-REx-ID: 11186 | OA
Large deviations in random latin squares
M.A. Kwan, A. Sah, M. Sawhney, Bulletin of the London Mathematical Society 54 (2022) 1420–1438.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 11443 | OA
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
 
2022 | Published | Journal Article | IST-REx-ID: 11740 | OA
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
 
2022 | Published | Journal Article | IST-REx-ID: 12151 | OA
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
 
2022 | Published | Journal Article | IST-REx-ID: 17077 | OA
Friendly bisections of random graphs
A. Ferber, M.A. Kwan, B. Narayanan, A. Sah, M. Sawhney, Communications of the American Mathematical Society 2 (2022) 380–416.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 10775 | OA
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
 
2022 | Published | Journal Article | IST-REx-ID: 12286 | OA
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
 
2022 | Published | 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, IEEE, 2022, pp. 919–930.
View | DOI | WoS
 

Search

Filter Publications

Display / Sort

Export / Embed