Matthew Kwan

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 20

Top Topics

Minimum Spanning Trees

Error Resilient

Randomly Chosen

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Publications

Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging. IACR Cryptol. ePrint Arch. 2024 (2024)
Asaf Ferber, Matthew Kwan
Dirac-type theorems in random hypergraphs. J. Comb. Theory, Ser. B 155 (2022)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-Decodability With Large Radius for Reed-Solomon Codes. IEEE Trans. Inf. Theory 68 (6) (2022)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
Singularity of sparse random matrices: simple proofs. Comb. Probab. Comput. 31 (1) (2022)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-decodability with large radius for Reed-Solomon codes. FOCS (2022)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-decodability with large radius for Reed-Solomon codes. FOCS (2021)
Zachary Chroman, Matthew Kwan, Mihir Singhal
Lower bounds for superpatterns and universal sequences. J. Comb. Theory, Ser. A 182 (2021)
Matthew Kwan, Lisa Sauermann, Yufei Zhao
Extension complexity of low-dimensional polytopes. CoRR (2020)
Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. Comb. 40 (2) (2020)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-decodability with large radius for Reed-Solomon codes. CoRR (2020)
Matthew Kwan, Benny Sudakov, Tuan Tran
Anticoncentration for subgraph statistics. J. Lond. Math. Soc. 99 (3) (2019)
Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov
The random k-matching-free process. Random Struct. Algorithms 53 (4) (2018)
Matthew Kwan, Benny Sudakov, Pedro Vieira
Non-trivially intersecting multi-part families. J. Comb. Theory, Ser. A 156 (2018)
Asaf Ferber, Matthew Kwan, Benny Sudakov
Counting Hamilton cycles in sparse random directed graphs. Random Struct. Algorithms 53 (4) (2018)
Kathy S. Faggiani, Bill Dafnis, Matthew Kwan
Experiential Learning in an Online IT Program: A Case Study of Third-Party Capstone Project Sourcing. SIGITE (2018)
Matthew Kwan, Benny Sudakov
Intercalates and discrepancy in random Latin squares. Random Struct. Algorithms 52 (2) (2018)
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. SIAM J. Discret. Math. 31 (1) (2017)
Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay
The average number of spanning trees in sparse graphs with given degrees. Eur. J. Comb. 63 (2017)
Afonso S. Bandeira, Asaf Ferber, Matthew Kwan
Resilience for the Littlewood-Offord Problem. Electron. Notes Discret. Math. 61 (2017)
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Comb. Probab. Comput. 25 (6) (2016)
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Catherine S. Greenhill, Matthew Kwan, David Wind
On the Number of Spanning Trees in Random Regular Graphs. Electron. J. Comb. 21 (1) (2014)
Matthew Kwan
Reducing the Gate Count of Bitslice DES. IACR Cryptol. ePrint Arch. 2000 (2000)
Matthew Kwan
The Design of the ICE Encryption Algorithm. FSE (1997)
Lawrence Brown, Matthew Kwan, Josef Pieprzyk, Jennifer Seberry
Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI. ASIACRYPT (1991)
Matthew Kwan, Josef Pieprzyk
A General Purpose Technique for Locating Key Scheduling Weakness in DES-like Cryptosystems (Extended Abstract). ASIACRYPT (1991)
Matthew Kwan
Simultaneous Attacks in Differential Cryptanalysis (Getting More Pairs Per Encryption). ASIACRYPT (1991)