BibTeX records: Nathaniel Grammel

download as .bib file

@inproceedings{DBLP:conf/soda/MacRuryMG23,
  author       = {Calum MacRury and
                  Will Ma and
                  Nathaniel Grammel},
  editor       = {Nikhil Bansal and
                  Viswanath Nagarajan},
  title        = {On (Random-order) Online Contention Resolution Schemes for the Matching
                  Polytope of (Bipartite) Graphs},
  booktitle    = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2023, Florence, Italy, January 22-25, 2023},
  pages        = {1995--2014},
  publisher    = {{SIAM}},
  year         = {2023},
  url          = {https://doi.org/10.1137/1.9781611977554.ch76},
  doi          = {10.1137/1.9781611977554.CH76},
  timestamp    = {Fri, 17 Feb 2023 09:28:57 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/MacRuryMG23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GrammelHKL22,
  author       = {Nathaniel Grammel and
                  Lisa Hellerstein and
                  Devorah Kletenik and
                  Naifeng Liu},
  title        = {Algorithms for the Unit-Cost Stochastic Score Classification Problem},
  journal      = {Algorithmica},
  volume       = {84},
  number       = {10},
  pages        = {3054--3074},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00453-022-00982-4},
  doi          = {10.1007/S00453-022-00982-4},
  timestamp    = {Tue, 18 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GrammelHKL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GkenosisGHK22,
  author       = {Dimitrios Gkenosis and
                  Nathaniel Grammel and
                  Lisa Hellerstein and
                  Devorah Kletenik},
  title        = {The Stochastic Boolean Function Evaluation problem for symmetric Boolean
                  functions},
  journal      = {Discret. Appl. Math.},
  volume       = {309},
  pages        = {269--277},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.dam.2021.12.001},
  doi          = {10.1016/J.DAM.2021.12.001},
  timestamp    = {Tue, 08 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GkenosisGHK22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2209-07520,
  author       = {Calum MacRury and
                  Will Ma and
                  Nathaniel Grammel},
  title        = {On (Random-order) Online Contention Resolution Schemes for the Matching
                  Polytope of (Bipartite) Graphs},
  journal      = {CoRR},
  volume       = {abs/2209.07520},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2209.07520},
  doi          = {10.48550/ARXIV.2209.07520},
  eprinttype    = {arXiv},
  eprint       = {2209.07520},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2209-07520.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/aistats/GrammelBMS21,
  author       = {Nathaniel Grammel and
                  Brian Brubach and
                  Will Ma and
                  Aravind Srinivasan},
  editor       = {Arindam Banerjee and
                  Kenji Fukumizu},
  title        = {Follow Your Star: New Frameworks for Online Stochastic Matching with
                  Known and Unknown Patience},
  booktitle    = {The 24th International Conference on Artificial Intelligence and Statistics,
                  {AISTATS} 2021, April 13-15, 2021, Virtual Event},
  series       = {Proceedings of Machine Learning Research},
  volume       = {130},
  pages        = {2872--2880},
  publisher    = {{PMLR}},
  year         = {2021},
  url          = {http://proceedings.mlr.press/v130/grammel21a.html},
  timestamp    = {Wed, 14 Apr 2021 16:51:37 +0200},
  biburl       = {https://dblp.org/rec/conf/aistats/GrammelBMS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/approx/BrubachGHSTV21,
  author       = {Brian Brubach and
                  Nathaniel Grammel and
                  David G. Harris and
                  Aravind Srinivasan and
                  Leonidas Tsepenekas and
                  Anil Vullikanti},
  editor       = {Mary Wootters and
                  Laura Sanit{\`{a}}},
  title        = {Approximating Two-Stage Stochastic Supplier Problems},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
                  of Washington, Seattle, Washington, {USA} (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {207},
  pages        = {23:1--23:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.23},
  doi          = {10.4230/LIPICS.APPROX/RANDOM.2021.23},
  timestamp    = {Thu, 24 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/BrubachGHSTV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/nips/TerryBGJHSSDHPW21,
  author       = {Justin K. Terry and
                  Benjamin Black and
                  Nathaniel Grammel and
                  Mario Jayakumar and
                  Ananth Hari and
                  Ryan Sullivan and
                  Luis S. Santos and
                  Clemens Dieffendahl and
                  Caroline Horsch and
                  Rodrigo Perez{-}Vicente and
                  Niall L. Williams and
                  Yashas Lokesh and
                  Praveen Ravi},
  editor       = {Marc'Aurelio Ranzato and
                  Alina Beygelzimer and
                  Yann N. Dauphin and
                  Percy Liang and
                  Jennifer Wortman Vaughan},
  title        = {PettingZoo: Gym for Multi-Agent Reinforcement Learning},
  booktitle    = {Advances in Neural Information Processing Systems 34: Annual Conference
                  on Neural Information Processing Systems 2021, NeurIPS 2021, December
                  6-14, 2021, virtual},
  pages        = {15032--15043},
  year         = {2021},
  url          = {https://proceedings.neurips.cc/paper/2021/hash/7ed2d3454c5eea71148b11d0c25104ff-Abstract.html},
  timestamp    = {Tue, 03 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/nips/TerryBGJHSSDHPW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/nips/BrubachGMS21,
  author       = {Brian Brubach and
                  Nathaniel Grammel and
                  Will Ma and
                  Aravind Srinivasan},
  editor       = {Marc'Aurelio Ranzato and
                  Alina Beygelzimer and
                  Yann N. Dauphin and
                  Percy Liang and
                  Jennifer Wortman Vaughan},
  title        = {Improved Guarantees for Offline Stochastic Matching via new Ordered
                  Contention Resolution Schemes},
  booktitle    = {Advances in Neural Information Processing Systems 34: Annual Conference
                  on Neural Information Processing Systems 2021, NeurIPS 2021, December
                  6-14, 2021, virtual},
  pages        = {27184--27195},
  year         = {2021},
  url          = {https://proceedings.neurips.cc/paper/2021/hash/e43739bba7cdb577e9e3e4e42447f5a5-Abstract.html},
  timestamp    = {Tue, 03 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/nips/BrubachGMS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2106-06892,
  author       = {Brian Brubach and
                  Nathaniel Grammel and
                  Will Ma and
                  Aravind Srinivasan},
  title        = {Improved Guarantees for Offline Stochastic Matching via new Ordered
                  Contention Resolution Schemes},
  journal      = {CoRR},
  volume       = {abs/2106.06892},
  year         = {2021},
  url          = {https://arxiv.org/abs/2106.06892},
  eprinttype    = {arXiv},
  eprint       = {2106.06892},
  timestamp    = {Tue, 15 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-06892.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2111-08793,
  author       = {Dimitrios Gkenosis and
                  Nathaniel Grammel and
                  Lisa Hellerstein and
                  Devorah Kletenik},
  title        = {The Stochastic Boolean Function Evaluation Problem for Symmetric Boolean
                  Functions},
  journal      = {CoRR},
  volume       = {abs/2111.08793},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.08793},
  eprinttype    = {arXiv},
  eprint       = {2111.08793},
  timestamp    = {Mon, 22 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-08793.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2005-13625,
  author       = {Justin K. Terry and
                  Nathaniel Grammel and
                  Sanghyun Son and
                  Benjamin Black},
  title        = {Parameter Sharing For Heterogeneous Agents in Multi-Agent Reinforcement
                  Learning},
  journal      = {CoRR},
  volume       = {abs/2005.13625},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.13625},
  eprinttype    = {arXiv},
  eprint       = {2005.13625},
  timestamp    = {Tue, 20 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-13625.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2008-03325,
  author       = {Brian Brubach and
                  Nathaniel Grammel and
                  David G. Harris and
                  Aravind Srinivasan and
                  Leonidas Tsepenekas and
                  Anil Vullikanti},
  title        = {Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering
                  Problems with Budget Constraints},
  journal      = {CoRR},
  volume       = {abs/2008.03325},
  year         = {2020},
  url          = {https://arxiv.org/abs/2008.03325},
  eprinttype    = {arXiv},
  eprint       = {2008.03325},
  timestamp    = {Thu, 24 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2008-03325.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1907-03963,
  author       = {Brian Brubach and
                  Nathaniel Grammel and
                  Aravind Srinivasan},
  title        = {Vertex-weighted Online Stochastic Matching with Patience Constraints},
  journal      = {CoRR},
  volume       = {abs/1907.03963},
  year         = {2019},
  url          = {http://arxiv.org/abs/1907.03963},
  eprinttype    = {arXiv},
  eprint       = {1907.03963},
  timestamp    = {Wed, 17 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1907-03963.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/GkenosisGHK18,
  author       = {Dimitrios Gkenosis and
                  Nathaniel Grammel and
                  Lisa Hellerstein and
                  Devorah Kletenik},
  editor       = {Yossi Azar and
                  Hannah Bast and
                  Grzegorz Herman},
  title        = {The Stochastic Score Classification Problem},
  booktitle    = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
                  2018, Helsinki, Finland},
  series       = {LIPIcs},
  volume       = {112},
  pages        = {36:1--36:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2018.36},
  doi          = {10.4230/LIPICS.ESA.2018.36},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/GkenosisGHK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1806-10660,
  author       = {Dimitrios Gkenosis and
                  Nathaniel Grammel and
                  Lisa Hellerstein and
                  Devorah Kletenik},
  title        = {The Stochastic Score Classification Problem},
  journal      = {CoRR},
  volume       = {abs/1806.10660},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.10660},
  eprinttype    = {arXiv},
  eprint       = {1806.10660},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-10660.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/waoa/GrammelHK016,
  author       = {Nathaniel Grammel and
                  Lisa Hellerstein and
                  Devorah Kletenik and
                  Patrick Lin},
  editor       = {Klaus Jansen and
                  Monaldo Mastrolilli},
  title        = {Scenario Submodular Cover},
  booktitle    = {Approximation and Online Algorithms - 14th International Workshop,
                  {WAOA} 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {10138},
  pages        = {116--128},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-51741-4\_10},
  doi          = {10.1007/978-3-319-51741-4\_10},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/GrammelHK016.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/GrammelHK016,
  author       = {Nathaniel Grammel and
                  Lisa Hellerstein and
                  Devorah Kletenik and
                  Patrick Lin},
  title        = {Scenario Submodular Cover},
  journal      = {CoRR},
  volume       = {abs/1603.03158},
  year         = {2016},
  url          = {http://arxiv.org/abs/1603.03158},
  eprinttype    = {arXiv},
  eprint       = {1603.03158},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/GrammelHK016.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.