Matthew Kwan

24 papers A* 2Journal 21Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Permanents of random matrices over finite fields.
CoRR
Zach Hunter, Matthew Kwan, Lisa Sauermann
2025 A* conf
Smoothed Analysis for Graph Isomorphism.
STOC
Michael Anastos, Matthew Kwan, Benjamin R. Moore
2024 J jnl
Smoothed analysis for graph isomorphism.
CoRR
Michael Anastos, Matthew Kwan, Benjamin R. Moore
2024 — conf
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.
TCC (1)
Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak
2024 J jnl
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.
IACR Cryptol. ePrint Arch.
Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak
2022 J jnl
Dirac-type theorems in random hypergraphs.
J. Comb. Theory B
Asaf Ferber, Matthew Kwan
2022 J jnl
List-Decodability With Large Radius for Reed-Solomon Codes.
IEEE Trans. Inf. Theory
Asaf Ferber, Matthew Kwan, Lisa Sauermann
2022 J jnl
Singularity of sparse random matrices: simple proofs.
Comb. Probab. Comput.
Asaf Ferber, Matthew Kwan, Lisa Sauermann
2021 A* conf
List-decodability with large radius for Reed-Solomon codes.
FOCS
Asaf Ferber, Matthew Kwan, Lisa Sauermann
2021 J jnl
Lower bounds for superpatterns and universal sequences.
J. Comb. Theory A
Zachary Chroman, Matthew Kwan, Mihir Singhal
2020 J jnl
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.
Comb.
Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran
2020 J jnl
Extension complexity of low-dimensional polytopes.
CoRR
Matthew Kwan, Lisa Sauermann, Yufei Zhao
2020 J jnl
List-decodability with large radius for Reed-Solomon codes.
CoRR
Asaf Ferber, Matthew Kwan, Lisa Sauermann
2019 J jnl
Anticoncentration for subgraph statistics.
J. Lond. Math. Soc.
Matthew Kwan, Benny Sudakov, Tuan Tran
2018 J jnl
Counting Hamilton cycles in sparse random directed graphs.
Random Struct. Algorithms
Asaf Ferber, Matthew Kwan, Benny Sudakov
2018 J jnl
Intercalates and discrepancy in random Latin squares.
Random Struct. Algorithms
Matthew Kwan, Benny Sudakov
2018 J jnl
Non-trivially intersecting multi-part families.
J. Comb. Theory A
Matthew Kwan, Benny Sudakov, Pedro Vieira
2018 J jnl
The random k-matching-free process.
Random Struct. Algorithms
Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov
2017 J jnl
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.
SIAM J. Discret. Math.
Michael Krivelevich, Matthew Kwan, Benny Sudakov
2017 J jnl
Resilience for the Littlewood-Offord Problem.
Electron. Notes Discret. Math.
Afonso S. Bandeira, Asaf Ferber, Matthew Kwan
2017 J jnl
The average number of spanning trees in sparse graphs with given degrees.
Eur. J. Comb.
Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay
2016 J jnl
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.
Comb. Probab. Comput.
Michael Krivelevich, Matthew Kwan, Benny Sudakov
2015 J jnl
Cycles and matchings in randomly perturbed digraphs and hypergraphs.
Electron. Notes Discret. Math.
Michael Krivelevich, Matthew Kwan, Benny Sudakov
2014 J jnl
On the Number of Spanning Trees in Random Regular Graphs.
Electron. J. Comb.
Catherine S. Greenhill, Matthew Kwan, David Wind