We stand with Ukraine  

Matthew Kwan

Orcid: 0000-0002-4003-7567

Affiliations:
  • Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria
  • Stanford University, Department of Mathematics, Stanford, CA, USA
  • ETH Zurich, Switzerland (PhD 2018)
  • University of New South Wales, School of Mathematics and Statistics, Sydney NSW, Australia


According to our database1, Matthew Kwan authored at least 17 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.
[BibTeX]
[DOI]
Michael Anastos
,
Benedikt Auerbach
,
Mirza Ahad Baig
,
Miguel Cueto Noval
,
Matthew Kwan
,
Guillermo Pascual-Perez
,
Krzysztof Pietrzak
IACR Cryptol. ePrint Arch., 2024

2022
List-Decodability With Large Radius for Reed-Solomon Codes.
[BibTeX]
[DOI]
Asaf Ferber
,
Matthew Kwan
,
Lisa Sauermann
IEEE Trans. Inf. Theory, 2022

Dirac-type theorems in random hypergraphs.
[BibTeX]
[DOI]
Asaf Ferber
,
Matthew Kwan
J. Comb. Theory B, 2022

Singularity of sparse random matrices: simple proofs.
[BibTeX]
[DOI]
Asaf Ferber
,
Matthew Kwan
,
Lisa Sauermann
Comb. Probab. Comput., 2022

2021
Lower bounds for superpatterns and universal sequences.
[BibTeX]
[DOI]
Zachary Chroman
,
Matthew Kwan
,
Mihir Singhal
J. Comb. Theory A, 2021

2020
Extension complexity of low-dimensional polytopes.
[BibTeX]
[DOI]
Matthew Kwan
,
Lisa Sauermann
,
Yufei Zhao
CoRR, 2020

Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.
[BibTeX]
[DOI]
Matthew Kwan
,
Shoham Letzter
,
Benny Sudakov
,
Tuan Tran
Comb., 2020

2019
Anticoncentration for subgraph statistics.
[BibTeX]
[DOI]
Matthew Kwan
,
Benny Sudakov
,
Tuan Tran
J. Lond. Math. Soc., 2019

2018
Intercalates and discrepancy in random Latin squares.
[BibTeX]
[DOI]
Matthew Kwan
,
Benny Sudakov
Random Struct. Algorithms, 2018

The random k-matching-free process.
[BibTeX]
[DOI]
Michael Krivelevich
,
Matthew Kwan
,
Po-Shen Loh
,
Benny Sudakov
Random Struct. Algorithms, 2018

Counting Hamilton cycles in sparse random directed graphs.
[BibTeX]
[DOI]
Asaf Ferber
,
Matthew Kwan
,
Benny Sudakov
Random Struct. Algorithms, 2018

Non-trivially intersecting multi-part families.
[BibTeX]
[DOI]
Matthew Kwan
,
Benny Sudakov
,
Pedro Vieira
J. Comb. Theory A, 2018

2017
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.
[BibTeX]
[DOI]
Michael Krivelevich
,
Matthew Kwan
,
Benny Sudakov
SIAM J. Discret. Math., 2017

Resilience for the Littlewood-Offord Problem.
[BibTeX]
[DOI]
Afonso S. Bandeira
,
Asaf Ferber
,
Matthew Kwan
Electron. Notes Discret. Math., 2017

The average number of spanning trees in sparse graphs with given degrees.
[BibTeX]
[DOI]
Catherine S. Greenhill
,
Mikhail Isaev
,
Matthew Kwan
,
Brendan D. McKay
Eur. J. Comb., 2017

2015
Cycles and matchings in randomly perturbed digraphs and hypergraphs.
[BibTeX]
[DOI]
Michael Krivelevich
,
Matthew Kwan
,
Benny Sudakov
Electron. Notes Discret. Math., 2015

2014
On the Number of Spanning Trees in Random Regular Graphs.
[BibTeX]
[DOI]
Catherine S. Greenhill
,
Matthew Kwan
,
David Wind
Electron. J. Comb., 2014


  Loading...