We stand with Ukraine  

Ryan Alweiss

Orcid: 0000-0002-7221-4599

Affiliations:
  • Massachusetts Institute of Technology, Cambridge, MA, USA


According to our database1, Ryan Alweiss authored at least 8 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improved Lower Bound for Frankl's Union-Closed Sets Conjecture.
[BibTeX]
[DOI]
Ryan Alweiss
,
Brice Huang
,
Mark Sellke
Electron. J. Comb., 2024

2021
On the subgraph query problem.
[BibTeX]
[DOI]
Ryan Alweiss
,
Chady Ben Hamida
,
Xiaoyu He
,
Alexander Moreira
Comb. Probab. Comput., 2021

Discrepancy minimization via a self-balancing walk.
[BibTeX]
[DOI]
Ryan Alweiss
,
Yang P. Liu
,
Mehtaab Sawhney
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020
Noisy corruption detection.
[BibTeX]
[DOI]
Ryan Alweiss
Inf. Process. Lett., 2020

On the product dimension of clique factors.
[BibTeX]
[DOI]
Noga Alon
,
Ryan Alweiss
Eur. J. Comb., 2020

2019
Improved bounds for the sunflower lemma.
[BibTeX]
[DOI]
Ryan Alweiss
,
Shachar Lovett
,
Kewen Wu
,
Jiapeng Zhang
Electron. Colloquium Comput. Complex., 2019

2018
Ramsey numbers of odd cycles versus larger even wheels.
[BibTeX]
[DOI]
Ryan Alweiss
Discret. Math., 2018

2017
Asymptotic results on Klazar set partition avoidance.
[BibTeX]
[DOI]
Ryan Alweiss
Discret. Math. Theor. Comput. Sci., 2017


  Loading...