BibTeX records: Rahul Arya

download as .bib file

@inproceedings{DBLP:conf/sigcse/ParlanteZDAPAGC20,
  author    = {Nick Parlante and
               Julie Zelenski and
               John DeNero and
               Christopher Allsman and
               Tiffany Perumpail and
               Rahul Arya and
               Kavi Gupta and
               Catherine Cang and
               Paul Bitutsky and
               Ryan Moughan and
               David J. Malan and
               Brian Yu and
               Evan M. Peck and
               Carl Albing and
               Kevin Wayne and
               Keith Schwarz},
  editor    = {Jian Zhang and
               Mark Sherriff and
               Sarah Heckman and
               Pamela A. Cutter and
               Alvaro E. Monge},
  title     = {Nifty Assignments},
  booktitle = {{SIGCSE} '20: The 51st {ACM} Technical Symposium on Computer Science
               Education, Portland, OR, USA, March 11-14, 2020},
  pages     = {1270--1271},
  publisher = {{ACM}},
  year      = {2020},
  url       = {https://doi.org/10.1145/3328778.3372574},
  doi       = {10.1145/3328778.3372574},
  timestamp = {Wed, 04 Mar 2020 17:01:21 +0100},
  biburl    = {https://dblp.org/rec/conf/sigcse/ParlanteZDAPAGC20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AryaAFM20,
  author    = {Rahul Arya and
               Sunil Arya and
               Guilherme Dias da Fonseca and
               David M. Mount},
  editor    = {Shuchi Chawla},
  title     = {Optimal Bound on the Combinatorial Complexity of Approximating Polytopes},
  booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages     = {786--805},
  publisher = {{SIAM}},
  year      = {2020},
  url       = {https://doi.org/10.1137/1.9781611975994.48},
  doi       = {10.1137/1.9781611975994.48},
  timestamp = {Mon, 06 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/AryaAFM20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-14459,
  author    = {Rahul Arya and
               Sunil Arya and
               Guilherme Dias da Fonseca and
               David M. Mount},
  title     = {Optimal Bound on the Combinatorial Complexity of Approximating Polytopes},
  journal   = {CoRR},
  volume    = {abs/1910.14459},
  year      = {2019},
  url       = {http://arxiv.org/abs/1910.14459},
  archivePrefix = {arXiv},
  eprint    = {1910.14459},
  timestamp = {Mon, 06 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1910-14459.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics