Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
17 Publications
2021 | Journal Article | IST-REx-ID: 11446
Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. Discrete & Computational Geometry. 2021;66(3):1202-1216. doi:10.1007/s00454-021-00299-z
[Preprint]
View
| Files available
| DOI
| arXiv
2021 | Journal Article | IST-REx-ID: 10211 | 
Mondelli M, Thrampoulidis C, Venkataramanan R. Optimal combination of linear and spectral estimators for generalized linear models. Foundations of Computational Mathematics. 2021. doi:10.1007/s10208-021-09531-x
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 8940 |
Boissonnat J-D, Kachanovich S, Wintraecken M. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. 2021;66(1):386-434. doi:10.1007/s00454-020-00250-8
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Journal Article | IST-REx-ID: 8767 |
Kaveh K, McAvoy A, Chatterjee K, Nowak MA. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 2020;16(11). doi:10.1371/journal.pcbi.1008402
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Journal Article | IST-REx-ID: 14125 |
Stark SG et al. 2020. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 36(Supplement_2), i919–i927.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
2014 | Journal Article | IST-REx-ID: 8459
Morin S, Linnet TE, Lescanne M, et al. Relax: The analysis of biomolecular kinetics and thermodynamics using NMR relaxation dispersion data. Bioinformatics. 2014;30(15):2219-2220. doi:10.1093/bioinformatics/btu166
View
| Files available
| DOI
2000 | Journal Article | IST-REx-ID: 11683
Henzinger MH, Rao S, Gabow HN. Computing vertex connectivity: New bounds from old techniques. Journal of Algorithms. 2000;34(2):222-250. doi:10.1006/jagm.1999.1055
View
| DOI