Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Elyot Grant
@article{DBLP:journals/comgeo/ChanG14, author = {Timothy M. Chan and Elyot Grant}, title = {Exact algorithms and APX-hardness results for geometric packing and covering problems}, journal = {Comput. Geom.}, volume = {47}, number = {2}, pages = {112--124}, year = {2014}, url = {https://doi.org/10.1016/j.comgeo.2012.04.001}, doi = {10.1016/J.COMGEO.2012.04.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/ChanG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BockGKS13, author = {Adrian Bock and Elyot Grant and Jochen K{\"{o}}nemann and Laura Sanit{\`{a}}}, title = {The School Bus Problem on Trees}, journal = {Algorithmica}, volume = {67}, number = {1}, pages = {49--64}, year = {2013}, url = {https://doi.org/10.1007/s00453-012-9711-x}, doi = {10.1007/S00453-012-9711-X}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BockGKS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/GrantI13, author = {Elyot Grant and Piotr Indyk}, editor = {Guilherme Dias da Fonseca and Thomas Lewiner and Luis Mariano Pe{\~{n}}aranda and Timothy M. Chan and Rolf Klein}, title = {Compressive sensing using locality-preserving matrices}, booktitle = {Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013}, pages = {215--222}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2462356.2462405}, doi = {10.1145/2462356.2462405}, timestamp = {Mon, 14 Jun 2021 16:24:55 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/GrantI13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/globalsip/GrantHI13, author = {Elyot Grant and Chinmay Hegde and Piotr Indyk}, title = {Nearly optimal linear embeddings into very low dimensions}, booktitle = {{IEEE} Global Conference on Signal and Information Processing, GlobalSIP 2013, Austin, TX, USA, December 3-5, 2013}, pages = {973--976}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/GlobalSIP.2013.6737055}, doi = {10.1109/GLOBALSIP.2013.6737055}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/globalsip/GrantHI13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/AlamdariBCGJKLP13, author = {Soroush Alamdari and Therese Biedl and Timothy M. Chan and Elyot Grant and Krishnam Raju Jampani and Srinivasan Keshav and Anna Lubiw and Vinayak Pathak}, editor = {Frank Dehne and Roberto Solis{-}Oba and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Smart-Grid Electricity Allocation via Strip Packing with Slicing}, booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS} 2013, London, ON, Canada, August 12-14, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8037}, pages = {25--36}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40104-6\_3}, doi = {10.1007/978-3-642-40104-6\_3}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/AlamdariBCGJKLP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AlamdariCGLP13, author = {Soroush Alamdari and Timothy M. Chan and Elyot Grant and Anna Lubiw and Vinayak Pathak}, title = {Self-Approaching Graphs}, journal = {CoRR}, volume = {abs/1306.5460}, year = {2013}, url = {http://arxiv.org/abs/1306.5460}, eprinttype = {arXiv}, eprint = {1306.5460}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AlamdariCGLP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/Ben-DavidGMS12, author = {Shalev Ben{-}David and Elyot Grant and Will Ma and Malcolm Sharpe}, title = {The Approximability and Integrality Gap of Interval Stabbing and Independence Problems}, booktitle = {Proceedings of the 24th Canadian Conference on Computational Geometry, {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012}, pages = {47--52}, year = {2012}, url = {http://2012.cccg.ca/papers/paper69.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cccg/Ben-DavidGMS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gd/AlamdariCGLP12, author = {Soroush Alamdari and Timothy M. Chan and Elyot Grant and Anna Lubiw and Vinayak Pathak}, editor = {Walter Didimo and Maurizio Patrignani}, title = {Self-approaching Graphs}, booktitle = {Graph Drawing - 20th International Symposium, {GD} 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {7704}, pages = {260--271}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-36763-2\_23}, doi = {10.1007/978-3-642-36763-2\_23}, timestamp = {Sun, 13 Nov 2022 09:57:28 +0100}, biburl = {https://dblp.org/rec/conf/gd/AlamdariCGLP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChanGKS12, author = {Timothy M. Chan and Elyot Grant and Jochen K{\"{o}}nemann and Malcolm Sharpe}, editor = {Yuval Rabani}, title = {Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling}, booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012}, pages = {1576--1585}, publisher = {{SIAM}}, year = {2012}, url = {https://doi.org/10.1137/1.9781611973099.125}, doi = {10.1137/1.9781611973099.125}, timestamp = {Tue, 02 Feb 2021 17:07:31 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChanGKS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/BrzozowskiGS11, author = {Janusz A. Brzozowski and Elyot Grant and Jeffrey O. Shallit}, title = {Closures in Formal Languages and Kuratowski's Theorem}, journal = {Int. J. Found. Comput. Sci.}, volume = {22}, number = {2}, pages = {301--321}, year = {2011}, url = {https://doi.org/10.1142/S0129054111008052}, doi = {10.1142/S0129054111008052}, timestamp = {Mon, 09 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijfcs/BrzozowskiGS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/GrantC11, author = {Elyot Grant and Timothy M. Chan}, title = {Exact Algorithms and APX-Hardness Results for Geometric Set Cover}, booktitle = {Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011}, year = {2011}, url = {http://www.cccg.ca/proceedings/2011/papers/paper102.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cccg/GrantC11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BockGKS11, author = {Adrian Bock and Elyot Grant and Jochen K{\"{o}}nemann and Laura Sanit{\`{a}}}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {The School Bus Problem on Trees}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {10--19}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_3}, doi = {10.1007/978-3-642-25591-5\_3}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BockGKS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/ChakrabartyGK10, author = {Deeparnab Chakrabarty and Elyot Grant and Jochen K{\"{o}}nemann}, editor = {Friedrich Eisenbrand and F. Bruce Shepherd}, title = {On Column-Restricted and Priority Covering Integer Programs}, booktitle = {Integer Programming and Combinatorial Optimization, 14th International Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6080}, pages = {355--368}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13036-6\_27}, doi = {10.1007/978-3-642-13036-6\_27}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/ipco/ChakrabartyGK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1003-1507, author = {Deeparnab Chakrabarty and Elyot Grant and Jochen K{\"{o}}nemann}, title = {On Column-restricted and Priority Covering Integer Programs}, journal = {CoRR}, volume = {abs/1003.1507}, year = {2010}, url = {http://arxiv.org/abs/1003.1507}, eprinttype = {arXiv}, eprint = {1003.1507}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1003-1507.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1012-0524, author = {Elyot Grant}, title = {On Avoiding Sufficiently Long Abelian Squares}, journal = {CoRR}, volume = {abs/1012.0524}, year = {2010}, url = {http://arxiv.org/abs/1012.0524}, eprinttype = {arXiv}, eprint = {1012.0524}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1012-0524.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/BrzozowskiGS09, author = {Janusz A. Brzozowski and Elyot Grant and Jeffrey O. Shallit}, editor = {Volker Diekert and Dirk Nowotka}, title = {Closures in Formal Languages and Kuratowski's Theorem}, booktitle = {Developments in Language Theory, 13th International Conference, {DLT} 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5583}, pages = {125--144}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02737-6\_10}, doi = {10.1007/978-3-642-02737-6\_10}, timestamp = {Mon, 09 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/dlt/BrzozowskiGS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0901-3761, author = {Janusz A. Brzozowski and Elyot Grant and Jeffrey O. Shallit}, title = {Closures in Formal Languages and Kuratowski's Theorem}, journal = {CoRR}, volume = {abs/0901.3761}, year = {2009}, url = {http://arxiv.org/abs/0901.3761}, eprinttype = {arXiv}, eprint = {0901.3761}, timestamp = {Mon, 09 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-0901-3761.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0901-3763, author = {Janusz A. Brzozowski and Elyot Grant and Jeffrey O. Shallit}, title = {Closures in Formal Languages: Concatenation, Separation, and Algorithms}, journal = {CoRR}, volume = {abs/0901.3763}, year = {2009}, url = {http://arxiv.org/abs/0901.3763}, eprinttype = {arXiv}, eprint = {0901.3763}, timestamp = {Mon, 09 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-0901-3763.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GrantSS08, author = {Elyot Grant and Jeffrey O. Shallit and Thomas Stoll}, title = {Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences}, journal = {CoRR}, volume = {abs/0812.3186}, year = {2008}, url = {http://arxiv.org/abs/0812.3186}, eprinttype = {arXiv}, eprint = {0812.3186}, timestamp = {Mon, 09 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/GrantSS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.