Articles with public access mandates - Satish B RaoLearn more
Not available anywhere: 1
Using INC Within Divide-and-Conquer Phylogeny Estimation
T Le, A Sy, EK Molloy, Q Zhang, S Rao, T Warnow
International Conference on Algorithms for Computational Biology, 167-178, 2019
Mandates: US National Science Foundation
Available somewhere: 9
Quartets MaxCut: a divide and conquer quartets algorithm
S Snir, S Rao
IEEE/ACM Transactions on Computational Biology and Bioinformatics 7 (4), 704-718, 2008
Mandates: US National Institutes of Health
Local flow partitioning for faster edge connectivity
M Henzinger, S Rao, D Wang
SIAM Journal on Computing 49 (1), 1-36, 2020
Mandates: US National Science Foundation
Strongly refuting random csps below the spectral threshold
P Raghavendra, S Rao, T Schramm
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Mandates: US National Science Foundation
Capacity releasing diffusion for speed and locality
D Wang, K Fountoulakis, M Henzinger, MW Mahoney, S Rao
International Conference on Machine Learning, 3598-3607, 2017
Mandates: US National Science Foundation, US Department of Defense, European Commission
Localization of electrical flows
A Schild, S Rao, N Srivastava
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Mandates: US National Science Foundation
BIGMAC: breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly
KK Lam, R Hall, A Clum, S Rao
BMC bioinformatics 17, 1-11, 2016
Mandates: US National Science Foundation
New absolute fast converging phylogeny estimation methods with improved scalability and accuracy
QR Zhang, S Rao, T Warnow
18th International Workshop on Algorithms in Bioinformatics (WABI 2018), 2018
Mandates: US National Science Foundation
Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy
Q Zhang, S Rao, T Warnow
Algorithms for Molecular Biology 14, 1-12, 2019
Mandates: US National Science Foundation
Deterministic near-linear time minimum cut in weighted graphs
M Henzinger, J Li, S Rao, D Wang
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
Mandates: Austrian Science Fund, European Commission
Publication and funding information is determined automatically by a computer program