default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Kwan 0001
Person information
- affiliation: Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria
- affiliation: Stanford University, Department of Mathematics, Stanford, CA, USA
- affiliation (PhD 2018): ETH Zurich, Switzerland
- affiliation: University of New South Wales, School of Mathematics and Statistics, Sydney NSW, Australia
Other persons with the same name
- Matthew Kwan — disambiguation page
- Matthew Kwan 0002 — Riipen Networks Inc., Vancouver, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Michael Anastos, Matthew Kwan, Benjamin Moore:
Smoothed analysis for graph isomorphism. CoRR abs/2410.06095 (2024)- [i3]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: 1097 (2024) - 2022
- [j16]Asaf Ferber, Matthew Kwan
, Lisa Sauermann:
Singularity of sparse random matrices: simple proofs. Comb. Probab. Comput. 31(1): 21-28 (2022) - [j15]Asaf Ferber, Matthew Kwan:
Dirac-type theorems in random hypergraphs. J. Comb. Theory B 155: 318-357 (2022) - [j14]Asaf Ferber, Matthew Kwan, Lisa Sauermann:
List-Decodability With Large Radius for Reed-Solomon Codes. IEEE Trans. Inf. Theory 68(6): 3823-3828 (2022) - 2021
- [j13]Zachary Chroman, Matthew Kwan, Mihir Singhal:
Lower bounds for superpatterns and universal sequences. J. Comb. Theory A 182: 105467 (2021) - [c1]Asaf Ferber, Matthew Kwan, Lisa Sauermann:
List-decodability with large radius for Reed-Solomon codes. FOCS 2021: 720-726 - 2020
- [j12]Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran:
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. Comb. 40(2): 283-305 (2020) - [i2]Matthew Kwan, Lisa Sauermann, Yufei Zhao:
Extension complexity of low-dimensional polytopes. CoRR abs/2006.08836 (2020) - [i1]Asaf Ferber, Matthew Kwan, Lisa Sauermann:
List-decodability with large radius for Reed-Solomon codes. CoRR abs/2012.10584 (2020)
2010 – 2019
- 2019
- [j11]Matthew Kwan, Benny Sudakov, Tuan Tran:
Anticoncentration for subgraph statistics. J. Lond. Math. Soc. 99(3): 757-777 (2019) - 2018
- [j10]Matthew Kwan, Benny Sudakov, Pedro Vieira:
Non-trivially intersecting multi-part families. J. Comb. Theory A 156: 44-60 (2018) - [j9]Matthew Kwan, Benny Sudakov:
Intercalates and discrepancy in random Latin squares. Random Struct. Algorithms 52(2): 181-196 (2018) - [j8]Asaf Ferber, Matthew Kwan, Benny Sudakov:
Counting Hamilton cycles in sparse random directed graphs. Random Struct. Algorithms 53(4): 592-603 (2018) - [j7]Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov:
The random k-matching-free process. Random Struct. Algorithms 53(4): 692-716 (2018) - 2017
- [j6]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: 6-25 (2017) - [j5]Afonso S. Bandeira, Asaf Ferber, Matthew Kwan:
Resilience for the Littlewood-Offord Problem. Electron. Notes Discret. Math. 61: 93-99 (2017) - [j4]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. SIAM J. Discret. Math. 31(1): 155-171 (2017) - 2016
- [j3]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Comb. Probab. Comput. 25(6): 909-927 (2016) - 2015
- [j2]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electron. Notes Discret. Math. 49: 181-187 (2015) - 2014
- [j1]Catherine S. Greenhill, Matthew Kwan, David Wind:
On the Number of Spanning Trees in Random Regular Graphs. Electron. J. Comb. 21(1): 1 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
