default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVidit Nanda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Chad Giusti, Darrick Lee, Vidit Nanda, Harald Oberhauser:
A topological approach to mapping space signatures. Adv. Appl. Math. 163: 102787 (2025)- 2024
- [j18]Marc Fersztand, Vidit Nanda, Ulrike Tillmann:
Harder-Narasimhan filtrations and zigzag persistence. Adv. Appl. Math. 153: 102634 (2024) - [j17]Martin Helmer, Vidit Nanda:
Correction to: Conormal Spaces and Whitney Stratifications. Found. Comput. Math. 24(3): 1077-1084 (2024) - [j16]Tadas Temcinas, Vidit Nanda, Gesine Reinert:
Multivariate central limit theorems for random clique complexes. J. Appl. Comput. Topol. 8(6): 1837-1880 (2024) - [j15]Uzu Lim
, Harald Oberhauser, Vidit Nanda:
Tangent Space and Dimension Estimation with the Wasserstein Distance. SIAM J. Appl. Algebra Geom. 8(3): 650-685 (2024) - [i7]Otto Sumray, Heather A. Harrington, Vidit Nanda:
Quiver Laplacians and Feature Selection. CoRR abs/2404.06993 (2024) - 2023
- [j14]Anna Seigal, Heather A. Harrington, Vidit Nanda:
Principal Components Along Quiver Representations. Found. Comput. Math. 23(4): 1129-1165 (2023) - [j13]Martin Helmer, Vidit Nanda:
Conormal Spaces and Whitney Stratifications. Found. Comput. Math. 23(5): 1745-1780 (2023) - [j12]Emile Jacquard, Vidit Nanda, Ulrike Tillmann:
The space of barcode bases for persistence modules. J. Appl. Comput. Topol. 7(1): 1-30 (2023) - [j11]Emile Jacquard, Vidit Nanda, Ulrike Tillmann:
Correction to: The space of barcode bases for persistence modules. J. Appl. Comput. Topol. 7(1): 31 (2023) - [j10]Dashti Ali, Aras Asaad, María José Jiménez, Vidit Nanda, Eduardo Paluzo-Hidalgo, Manuel Soriano-Trigueros:
A Survey of Vectorization Methods in Topological Data Analysis. IEEE Trans. Pattern Anal. Mach. Intell. 45(12): 14069-14080 (2023) - [j9]Martin Helmer, Vidit Nanda:
Complex Links and Hilbert-Samuel Multiplicities. SIAM J. Appl. Algebra Geom. 7(1): 29-48 (2023) - [i6]Uzu Lim, Harald Oberhauser, Vidit Nanda:
HADES: Fast Singularity Detection with Local Measure Comparison. CoRR abs/2311.04171 (2023) - 2022
- [c4]Alexandros Dimitrios Keros, Vidit Nanda, Kartic Subr:
Dist2Cycle: A Simplicial Neural Network for Homology Localization. AAAI 2022: 7133-7142 - 2021
- [i5]Martin Helmer, Vidit Nanda:
Conormal Spaces and Whitney Stratifications. CoRR abs/2106.14555 (2021) - [i4]Uzu Lim, Vidit Nanda, Harald Oberhauser:
Tangent Space and Dimension Estimation with the Wasserstein Distance. CoRR abs/2110.06357 (2021) - [i3]Alexandros Dimitrios Keros, Vidit Nanda, Kartic Subr:
Dist2Cycle: A Simplicial Neural Network for Homology Localization. CoRR abs/2110.15182 (2021) - 2020
- [j8]Vidit Nanda:
Local Cohomology and Stratification. Found. Comput. Math. 20(2): 195-222 (2020) - [j7]Ilya Chevyrev, Vidit Nanda, Harald Oberhauser:
Persistence Paths and Signature Features in Topological Data Analysis. IEEE Trans. Pattern Anal. Mach. Intell. 42(1): 192-202 (2020) - [j6]Lisa Carbone, Vidit Nanda, Yusra Naqvi:
Equivariant Simplicial Reconstruction. SIAM J. Appl. Algebra Geom. 4(4): 532-552 (2020)
2010 – 2019
- 2018
- [i2]Ilya Chevyrev, Vidit Nanda, Harald Oberhauser:
Persistence paths and signature features in topological data analysis. CoRR abs/1806.00381 (2018) - 2017
- [j5]Paul M. Alsing, Howard A. Blair, Matthew Corne, Gordon Jones, Warner A. Miller, Konstantin Mischaikow, Vidit Nanda:
Topological Signals of Singularities in Ricci Flow. Axioms 6(3): 24 (2017) - [j4]Peter Bubenik, Vin de Silva, Vidit Nanda:
Higher Interpolation and Extension for Persistence Modules. SIAM J. Appl. Algebra Geom. 1(1): 272-284 (2017) - 2016
- [j3]Justin Curry, Robert Ghrist, Vidit Nanda:
Discrete Morse Theory for Computing Cellular Sheaf Cohomology. Found. Comput. Math. 16(4): 875-897 (2016) - 2014
- [j2]Shaun Harker, Konstantin Mischaikow, Marian Mrozek, Vidit Nanda:
Discrete Morse Theoretic Algorithms for Computing Homology of Complexes and Maps. Found. Comput. Math. 14(1): 151-184 (2014) - [p1]Vidit Nanda, Radmila Sazdanovic:
Simplicial Models and Topological Inference in Biological Systems. Discrete and Topological Models in Molecular Biology 2014: 109-141 - 2013
- [j1]Konstantin Mischaikow, Vidit Nanda:
Morse Theory for Filtrations and Efficient Computation of Persistent Homology. Discret. Comput. Geom. 50(2): 330-353 (2013) - [c3]Vin de Silva, Vidit Nanda:
Geometry in the space of persistence modules. SoCG 2013: 397-404 - 2012
- [i1]Edinah K. Gnang, Vidit Nanda:
The devil is in Asymmetries (Rough Version). CoRR abs/1205.6990 (2012)
2000 – 2009
- 2005
- [c2]Karthik Balakrishnan, Vidit Nanda, Siddharth Easwar, Sung Kyu Lim:
Wire congestion and thermal aware 3D global placement. ASP-DAC 2005: 1131-1134 - 2004
- [c1]Mongkol Ekpanyapong, Karthik Balakrishnan, Vidit Nanda, Sung Kyu Lim:
Simultaneous delay and power optimization in global placement. ISCAS (5) 2004: 57-60
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-12-10 21:48 CET 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:
