Elyot Grant
Elyot Grant
Подтвержден адрес электронной почты в домене mit.edu
Название
Процитировано
Процитировано
Год
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
TM Chan, E Grant, J Könemann, M Sharpe
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
772012
Exact algorithms and APX-hardness results for geometric packing and covering problems
TM Chan, E Grant
Computational Geometry 47 (2), 112-124, 2014
562014
On column-restricted and priority covering integer programs
D Chakrabarty, E Grant, J Könemann
International Conference on Integer Programming and Combinatorial …, 2010
462010
Self-approaching graphs
S Alamdari, TM Chan, E Grant, A Lubiw, V Pathak
International Symposium on Graph Drawing, 260-271, 2012
302012
Smart-grid electricity allocation via strip packing with slicing
S Alamdari, T Biedl, TM Chan, E Grant, KR Jampani, S Keshav, A Lubiw, ...
Workshop on Algorithms and Data Structures, 25-36, 2013
222013
Closures in formal languages and Kuratowski's theorem
J Brzozowski, E Grant, J Shallit
International Journal of Foundations of Computer Science 22 (02), 301-321, 2011
172011
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences
E Grant, J Shallit, T Stoll
arXiv preprint arXiv:0812.3186, 2008
152008
Closures in formal languages and Kuratowski’s theorem
J Brzozowski, E Grant, J Shallit
International Conference on Developments in Language Theory, 125-144, 2009
142009
The school bus problem on trees
A Bock, E Grant, J Könemann, L Sanità
Algorithmica 67 (1), 49-64, 2013
112013
The school bus problem on trees
A Bock, E Grant, J Könemann, L Sanità
International Symposium on Algorithms and Computation, 10-19, 2011
112011
Nearly optimal linear embeddings into very low dimensions
E Grant, C Hegde, P Indyk
2013 IEEE Global Conference on Signal and Information Processing, 973-976, 2013
102013
Exact algorithms and apx-hardness results for geometric set cover
TM Chan, E Grant
Proc. 23rd Canadian Conference on Computational Geometry, 431-436, 2011
92011
Strip packing with slicing
S Alamdari, T Biedl, TM Chan, E Grant, K Jampani, S Keshav, A Lubiw, ...
2013b). URL http://csclub. uwaterloo. ca/∼ egrant/ElyotResearchPapers …, 0
5
Closures in formal languages: Concatenation, separation, and algorithms
J Brzozowski, E Grant, J Shallit
arXiv preprint arXiv:0901.3763, 2009
22009
The approximability and integrality gap of interval stabbing and independence problems
SB David, E Grant, W Ma, M Sharpe
12012
Covering Problems via Structural Approaches
E Grant
University of Waterloo, 2011
12011
Compressive sensing using locality-preserving matrices
E Grant, P Indyk
Proceedings of the twenty-ninth annual symposium on Computational geometry …, 2013
2013
Dimension reduction algorithms for near-optimal low-dimensional embeddings and compressive sensing
E Grant
Massachusetts Institute of Technology, 2013
2013
A geometric approach to combinatorial fixed-point theorems
E Grant, W Ma
The Seventh European Conference on Combinatorics, Graph Theory and …, 2013
2013
On Avoiding Sufficiently Long Abelian Squares
E Grant
arXiv preprint arXiv:1012.0524, 2010
2010
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20