Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences. - Elyot Grant; Jeffrey O. Shallit; Thomas Stoll (CoRR, 2008)

Closures in Formal Languages: Concatenation, Separation, and Algorithms - Janusz A. Brzozowski; Elyot Grant; Jeffrey O. Shallit (CoRR, 2009)

On Column-Restricted and Priority Covering Integer Programs. - Deeparnab Chakrabarty; Elyot Grant; Jochen Könemann (IPCO, 2010)

On Avoiding Sufficiently Long Abelian Squares - Elyot Grant (CoRR, 2010)

Exact Algorithms and APX-Hardness Results for Geometric Set Cover. - Elyot Grant; Timothy M. Chan (CCCG, 2011)

Closures in Formal Languages and Kuratowski's Theorem. - Janusz A. Brzozowski; Elyot Grant; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2011)

The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. - Shalev Ben-David; Elyot Grant; Will Ma; Malcolm Sharpe (CCCG, 2012)

Self-approaching Graphs. - Soroush Alamdari; Timothy M. Chan; Elyot Grant; Anna Lubiw; Vinayak Pathak (GD, 2012)

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. - Timothy M. Chan; Elyot Grant; Jochen Könemann; Malcolm Sharpe (SODA, 2012)

Compressive sensing using locality-preserving matrices. - Elyot Grant; Piotr Indyk (SoCG, 2013)

Nearly optimal linear embeddings into very low dimensions. - Elyot Grant; Chinmay Hegde; Piotr Indyk (GlobalSIP, 2013)

Smart-Grid Electricity Allocation via Strip Packing with Slicing. - Soroush Alamdari; Therese Biedl; Timothy M. Chan; Elyot Grant; Krishnam Raju Jampani; Srinivasan Keshav; Anna Lubiw; Vinayak Pathak (WADS, 2013)

The School Bus Problem on Trees. - Adrian Bock; Elyot Grant; Jochen Könemann; Laura Sanità (Algorithmica, 2013)

Exact algorithms and APX-hardness results for geometric packing and covering problems. - Timothy M. Chan; Elyot Grant (Comput. Geom., 2014)