Suivre
Giri Narasimhan
Giri Narasimhan
Computing and Information Sciences, Florida International University
Adresse e-mail validée de cs.fiu.edu - Page d'accueil
Titre
Citée par
Citée par
Année
Dynamics of Pseudomonas aeruginosa genome evolution
K Mathee, G Narasimhan, C Valdes, X Qiu, JM Matewish, M Koehrsen, ...
Proceedings of the National Academy of Sciences 105 (8), 3100-3105, 2008
6312008
Geometric spanner networks
G Narasimhan, M Smid
Cambridge University Press, 2007
5812007
Algorithms for facility location problems with outliers
M Charikar, S Khuller, DM Mount, G Narasimhan
SODA 1, 642-651, 2001
5222001
Metagenomics, metatranscriptomics, and metabolomics approaches for microbiome analysis: supplementary issue: bioinformatics methods and applications for big metagenomics data
V Aguiar-Pulido, W Huang, V Suarez-Ulloa, T Cickovski, K Mathee, ...
Evolutionary Bioinformatics 12, EBO. S36436, 2016
4572016
Current concepts in the pathogenesis and treatment of chronic suppurative otitis media
R Mittal, CV Lisi, R Gerring, J Mittal, K Mathee, G Narasimhan, RK Azad, ...
Journal of medical microbiology 64 (10), 1103-1116, 2015
2802015
So you think you can PLS-DA?
D Ruiz-Perez, H Guan, P Madhivanan, K Mathee, G Narasimhan
BMC bioinformatics 21, 1-10, 2020
2612020
Alginate production affects Pseudomonas aeruginosa biofilm development and architecture, but is not essential for biofilm formation
AP Stapper, G Narasimhan, DE Ohman, J Barakat, M Hentzer, S Molin, ...
Journal of medical microbiology 53 (7), 679-690, 2004
2572004
New sparseness results on graph spanners
B Chandra, G Das, G Narasimhan, J Soares
Proceedings of the eighth annual symposium on Computational geometry, 192-201, 1992
2541992
The regulatory repertoire of Pseudomonas aeruginosa AmpC ß-lactamase regulator AmpR includes virulence genes
D Balasubramanian, L Schneper, M Merighi, R Smith, G Narasimhan, ...
PloS one 7 (3), e34067, 2012
1552012
A fast algorithm for constructing sparse Euclidean spanners
G Das, G Narasimhan
Proceedings of the tenth annual symposium on Computational geometry, 132-139, 1994
1551994
Fast greedy algorithms for constructing sparse geometric spanners
J Gudmundsson, C Levcopoulos, G Narasimhan
SIAM Journal on Computing 31 (5), 1479-1500, 2002
1342002
Distinct transcriptional profiles characterize oral epithelium‐microbiota interactions
M Handfield, JJ Mans, G Zheng, MC Lopez, S Mao, A Progulske‐Fox, ...
Cellular microbiology 7 (6), 811-823, 2005
1242005
Resource-constrained geometric network optimization
EM Arkin, JSB Mitchell, G Narasimhan
Proceedings of the fourteenth annual symposium on Computational geometry …, 1998
1191998
Optimally sparse spanners in 3-dimensional Euclidean space
G Das, P Heffernan, G Narasimhan
Proceedings of the ninth annual symposium on Computational geometry, 53-62, 1993
1141993
Driving cache replacement with {ML-based}{LeCaR}
G Vietri, LV Rodriguez, WA Martinez, S Lyons, J Liu, R Rangaswami, ...
10th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage 18), 2018
1132018
A new way to weigh malnourished Euclidean graphs
G Das, G Narasimhan, J Salowe
proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms …, 1995
1131995
Approximating the stretch factor of Euclidean graphs
G Narasimhan, M Smid
SIAM Journal on Computing 30 (3), 978-989, 2000
962000
{CacheDedup}: In-line Deduplication for Flash Caching
W Li, G Jean-Baptise, J Riveros, G Narasimhan, T Zhang, M Zhao
14th USENIX Conference on File and Storage Technologies (FAST 16), 301-314, 2016
862016
Efficient algorithms for constructing fault-tolerant geometric spanners
C Levcopoulos, G Narasimhan, M Smid
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
821998
Mutation-induced changes in the receptor-binding interface of the SARS-CoV-2 Delta variant B. 1.617. 2 and implications for immune evasion
P Baral, N Bhattarai, ML Hossen, V Stebliankin, BS Gerstman, ...
Biochemical and biophysical research communications 574, 14-19, 2021
782021
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20