Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElyot Grant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j3]Timothy M. Chan, Elyot Grant:
Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. 47(2): 112-124 (2014)- 2013
- [j2]Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità:
The School Bus Problem on Trees. Algorithmica 67(1): 49-64 (2013) - [c10]Elyot Grant, Piotr Indyk:
Compressive sensing using locality-preserving matrices. SoCG 2013: 215-222 - [c9]Elyot Grant, Chinmay Hegde, Piotr Indyk:
Nearly optimal linear embeddings into very low dimensions. GlobalSIP 2013: 973-976 - [c8]Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav
, Anna Lubiw, Vinayak Pathak:
Smart-Grid Electricity Allocation via Strip Packing with Slicing. WADS 2013: 25-36 - [i6]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-Approaching Graphs. CoRR abs/1306.5460 (2013) - 2012
- [c7]Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe:
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. CCCG 2012: 47-52 - [c6]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-approaching Graphs. GD 2012: 260-271 - [c5]Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe:
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. SODA 2012: 1576-1585 - 2011
- [j1]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. Int. J. Found. Comput. Sci. 22(2): 301-321 (2011) - [c4]Elyot Grant, Timothy M. Chan:
Exact Algorithms and APX-Hardness Results for Geometric Set Cover. CCCG 2011 - [c3]Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità:
The School Bus Problem on Trees. ISAAC 2011: 10-19 - 2010
- [c2]Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann:
On Column-Restricted and Priority Covering Integer Programs. IPCO 2010: 355-368 - [i5]Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann:
On Column-restricted and Priority Covering Integer Programs. CoRR abs/1003.1507 (2010) - [i4]Elyot Grant:
On Avoiding Sufficiently Long Abelian Squares. CoRR abs/1012.0524 (2010)
2000 – 2009
- 2009
- [c1]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. Developments in Language Theory 2009: 125-144 - [i3]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. CoRR abs/0901.3761 (2009) - [i2]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages: Concatenation, Separation, and Algorithms. CoRR abs/0901.3763 (2009) - 2008
- [i1]Elyot Grant, Jeffrey O. Shallit, Thomas Stoll:
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences. CoRR abs/0812.3186 (2008)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
