default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrinath Sridhar 0001
Person information
- affiliation: Carnegie Mellon University
Other persons with the same name
- Srinath Sridhar 0002
![[0000-0003-4663-3324]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-4663-3324")
— Brown University, Providence, RI, USA (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Sagnik Das, R. Ravi, Srinath Sridhar:
Order Fulfillment Under Pick Failure in Omnichannel Ship-From-Store Programs. Manuf. Serv. Oper. Manag. 25(2): 508-523 (2023)
2010 – 2019
- 2015
- [c8]Arda Antikacioglu, R. Ravi, Srinath Sridhar:
Recommendation Subgraphs for Web Discovery. WWW 2015: 77-87 - 2014
- [i1]Arda Antikacioglu, R. Ravi, Srinath Sridhar:
Recommendation Subgraphs for Web Discovery. CoRR abs/1409.2042 (2014) - 2011
- [j4]Fumei Lam, Dan Gusfield, Srinath Sridhar:
Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters. SIAM J. Discret. Math. 25(3): 1144-1175 (2011)
2000 – 2009
- 2009
- [c7]Fumei Lam, Dan Gusfield, Srinath Sridhar:
Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters. WABI 2009: 206-219 - 2008
- [j3]Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz:
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 323-331 (2008) - 2007
- [j2]Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz:
Direct maximum parsimony phylogeny reconstruction from genotype data. BMC Bioinform. 8 (2007) - [j1]Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz:
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 561-571 (2007) - [c6]Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz:
Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming. ISBRA 2007: 37-48 - [c5]Srinath Sridhar, Satish Rao, Eran Halperin:
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure. RECOMB 2007: 503-517 - 2006
- [c4]Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar:
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. ICALP (1) 2006: 667-678 - [c3]Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz:
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. International Conference on Computational Science (2) 2006: 799-806 - [c2]Natalie Castellana, Kedar Dhamdhere, Srinath Sridhar, Russell Schwartz:
Relaxing Haplotype Block Models for Association Testing. Pacific Symposium on Biocomputing 2006: 454-466 - 2002
- [c1]Seth Pettie, Vijaya Ramachandran, Srinath Sridhar:
Experimental Evaluation of a New Shortest Path Algorithm. ALENEX 2002: 126-142
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-10-23 20:33 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:
