BibTeX records: Ryan Alweiss

download as .bib file

@article{DBLP:journals/cpc/AlweissHHM21,
  author       = {Ryan Alweiss and
                  Chady Ben Hamida and
                  Xiaoyu He and
                  Alexander Moreira},
  title        = {On the subgraph query problem},
  journal      = {Comb. Probab. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {1--16},
  year         = {2021},
  url          = {https://doi.org/10.1017/S0963548320000218},
  doi          = {10.1017/S0963548320000218},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cpc/AlweissHHM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/AlweissLS21,
  author       = {Ryan Alweiss and
                  Yang P. Liu and
                  Mehtaab Sawhney},
  editor       = {Samir Khuller and
                  Virginia Vassilevska Williams},
  title        = {Discrepancy minimization via a self-balancing walk},
  booktitle    = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
                  Virtual Event, Italy, June 21-25, 2021},
  pages        = {14--20},
  publisher    = {{ACM}},
  year         = {2021},
  url          = {https://doi.org/10.1145/3406325.3450994},
  doi          = {10.1145/3406325.3450994},
  timestamp    = {Tue, 22 Jun 2021 19:47:11 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/AlweissLS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/AlonA20,
  author       = {Noga Alon and
                  Ryan Alweiss},
  title        = {On the product dimension of clique factors},
  journal      = {Eur. J. Comb.},
  volume       = {86},
  pages        = {103097},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.ejc.2020.103097},
  doi          = {10.1016/J.EJC.2020.103097},
  timestamp    = {Mon, 04 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/AlonA20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Alweiss20,
  author       = {Ryan Alweiss},
  title        = {Noisy corruption detection},
  journal      = {Inf. Process. Lett.},
  volume       = {155},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.ipl.2019.105897},
  doi          = {10.1016/J.IPL.2019.105897},
  timestamp    = {Thu, 06 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Alweiss20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/AlweissL0Z20,
  author       = {Ryan Alweiss and
                  Shachar Lovett and
                  Kewen Wu and
                  Jiapeng Zhang},
  editor       = {Konstantin Makarychev and
                  Yury Makarychev and
                  Madhur Tulsiani and
                  Gautam Kamath and
                  Julia Chuzhoy},
  title        = {Improved bounds for the sunflower lemma},
  booktitle    = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
  pages        = {624--630},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3357713.3384234},
  doi          = {10.1145/3357713.3384234},
  timestamp    = {Mon, 18 Dec 2023 07:33:37 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AlweissL0Z20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2006-14009,
  author       = {Ryan Alweiss and
                  Yang P. Liu and
                  Mehtaab Sawhney},
  title        = {Discrepancy Minimization via a Self-Balancing Walk},
  journal      = {CoRR},
  volume       = {abs/2006.14009},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.14009},
  eprinttype    = {arXiv},
  eprint       = {2006.14009},
  timestamp    = {Wed, 01 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-14009.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1908-07493,
  author       = {Ryan Alweiss},
  title        = {Noisy Corruption Detection},
  journal      = {CoRR},
  volume       = {abs/1908.07493},
  year         = {2019},
  url          = {http://arxiv.org/abs/1908.07493},
  eprinttype    = {arXiv},
  eprint       = {1908.07493},
  timestamp    = {Mon, 26 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1908-07493.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1908-08483,
  author       = {Ryan Alweiss and
                  Shachar Lovett and
                  Kewen Wu and
                  Jiapeng Zhang},
  title        = {Improved bounds for the sunflower lemma},
  journal      = {CoRR},
  volume       = {abs/1908.08483},
  year         = {2019},
  url          = {http://arxiv.org/abs/1908.08483},
  eprinttype    = {arXiv},
  eprint       = {1908.08483},
  timestamp    = {Sat, 23 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1908-08483.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/AlweissLWZ19,
  author       = {Ryan Alweiss and
                  Shachar Lovett and
                  Kewen Wu and
                  Jiapeng Zhang},
  title        = {Improved bounds for the sunflower lemma},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR19-110}},
  year         = {2019},
  url          = {https://eccc.weizmann.ac.il/report/2019/110},
  eprinttype    = {ECCC},
  eprint       = {TR19-110},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AlweissLWZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Alweiss18,
  author       = {Ryan Alweiss},
  title        = {Ramsey numbers of odd cycles versus larger even wheels},
  journal      = {Discret. Math.},
  volume       = {341},
  number       = {4},
  pages        = {981--989},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.disc.2018.01.004},
  doi          = {10.1016/J.DISC.2018.01.004},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/Alweiss18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmtcs/Alweiss17,
  author       = {Ryan Alweiss},
  title        = {Asymptotic results on Klazar set partition avoidance},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {19},
  number       = {2},
  year         = {2017},
  url          = {https://doi.org/10.23638/DMTCS-19-2-7},
  doi          = {10.23638/DMTCS-19-2-7},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/Alweiss17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.