Matthew Kwan

According to our database, Matthew Kwan authored at least 22 papers between 1991 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

List-Decodability With Large Radius for Reed-Solomon Codes.

Asaf Ferber, Matthew Kwan, Lisa Sauermann

IEEE Trans. Inf. Theory, 2022

Dirac-type theorems in random hypergraphs.

Asaf Ferber, Matthew Kwan

J. Comb. Theory, Ser. B, 2022

Singularity of sparse random matrices: simple proofs.

Asaf Ferber, Matthew Kwan, Lisa Sauermann

Comb. Probab. Comput., 2022

2021

Lower bounds for superpatterns and universal sequences.

Zachary Chroman, Matthew Kwan, Mihir Singhal

J. Comb. Theory, Ser. A, 2021

2020

Extension complexity of low-dimensional polytopes.

Matthew Kwan, Lisa Sauermann, Yufei Zhao

CoRR, 2020

Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.

Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran

Comb., 2020

2019

Anticoncentration for subgraph statistics.

Matthew Kwan, Benny Sudakov, Tuan Tran

J. Lond. Math. Soc., 2019

2018

Intercalates and discrepancy in random Latin squares.

Matthew Kwan, Benny Sudakov

Random Struct. Algorithms, 2018

The random k-matching-free process.

Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov

Random Struct. Algorithms, 2018

Counting Hamilton cycles in sparse random directed graphs.

Asaf Ferber, Matthew Kwan, Benny Sudakov

Random Struct. Algorithms, 2018

Non-trivially intersecting multi-part families.

Matthew Kwan, Benny Sudakov, Pedro Vieira

J. Comb. Theory, Ser. A, 2018

Experiential Learning in an Online IT Program: A Case Study of Third-Party Capstone Project Sourcing.

Kathy S. Faggiani, Bill Dafnis, Matthew Kwan

Proceedings of the 19th Annual SIG Conference on Information Technology Education, 2018

2017

Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.

Michael Krivelevich, Matthew Kwan, Benny Sudakov

SIAM J. Discret. Math., 2017

Resilience for the Littlewood-Offord Problem.

Afonso S. Bandeira, Asaf Ferber, Matthew Kwan

Electron. Notes Discret. Math., 2017

The average number of spanning trees in sparse graphs with given degrees.

Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay

Eur. J. Comb., 2017

2015

Cycles and matchings in randomly perturbed digraphs and hypergraphs.

Michael Krivelevich, Matthew Kwan, Benny Sudakov

Electron. Notes Discret. Math., 2015

2014

On the Number of Spanning Trees in Random Regular Graphs.

Catherine S. Greenhill, Matthew Kwan, David Wind

Electron. J. Comb., 2014

2000

Reducing the Gate Count of Bitslice DES.

Matthew Kwan

IACR Cryptol. ePrint Arch., 2000

1997

The Design of the ICE Encryption Algorithm.

Matthew Kwan

Proceedings of the Fast Software Encryption, 4th International Workshop, 1997

1991

A General Purpose Technique for Locating Key Scheduling Weakness in DES-like Cryptosystems (Extended Abstract).

Matthew Kwan, Josef Pieprzyk

Proceedings of the Advances in Cryptology, 1991

Simultaneous Attacks in Differential Cryptanalysis (Getting More Pairs Per Encryption).

Matthew Kwan

Proceedings of the Advances in Cryptology, 1991

Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI.

Lawrence Brown, Matthew Kwan, Josef Pieprzyk, Jennifer Seberry

Proceedings of the Advances in Cryptology, 1991