default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChad Giusti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]Chad Giusti, Darrick Lee, Vidit Nanda, Harald Oberhauser:
A topological approach to mapping space signatures. Adv. Appl. Math. 163: 102787 (2025)- 2023
- [j8]Hee Rhang Yoon, Robert Ghrist, Chad Giusti
:
Persistent extensions and analogous bars: data-induced relations between persistence barcodes. J. Appl. Comput. Topol. 7(3): 571-617 (2023) - [j7]Chad Giusti, Darrick Lee:
Signatures, Lipschitz-Free Spaces, and Paths of Persistence Diagrams. SIAM J. Appl. Algebra Geom. 7(4): 828-866 (2023) - 2022
- [i4]Hee Rhang Yoon, Robert Ghrist, Chad Giusti:
Persistent Extension and Analogous Bars: Data-Induced Relations Between Persistence Barcodes. CoRR abs/2201.05190 (2022) - 2021
- [j6]Lu Li, Connor Thompson, Gregory Henselman-Petrusek, Chad Giusti, Lori Ziegelmeier:
Minimal Cycle Representatives in Persistent Homology Using Linear Programming: An Empirical Study With User's Guide. Frontiers Artif. Intell. 4: 681117 (2021) - [i3]Lu Li, Connor Thompson, Gregory Henselman-Petrusek, Chad Giusti, Lori Ziegelmeier:
Minimal Cycle Representatives in Persistent Homology using Linear Programming: an Empirical Study with User's Guide. CoRR abs/2105.07025 (2021) - [i2]Haibin Hang, Chad Giusti, Lori Ziegelmeier, Gregory Henselman-Petrusek:
U-match factorization: sparse homological algebra, lazy cycle representatives, and dualities in persistent (co)homology. CoRR abs/2108.08831 (2021)
2010 – 2019
- 2019
- [j5]Joshua Cruz, Chad Giusti, Vladimir Itskov, Bill Kronholm:
On Open and Closed Convex Codes. Discret. Comput. Geom. 61(2): 247-270 (2019) - 2018
- [j4]Ann Sizemore, Chad Giusti, Ari E. Kahn, Jean M. Vettel, Richard F. Betzel, Danielle S. Bassett:
Cliques and cavities in the human connectome. J. Comput. Neurosci. 44(1): 115-145 (2018) - 2017
- [j3]Ann Sizemore, Chad Giusti, Danielle S. Bassett:
Classification of weighted networks through mesoscale homological features. J. Complex Networks 5(2): 245-273 (2017) - 2016
- [j2]Chad Giusti, Robert Ghrist, Danielle S. Bassett:
Two's company, three (or more) is a simplex - Algebraic-topological tools for understanding higher-order structure in neural data. J. Comput. Neurosci. 41(1): 1-14 (2016) - 2015
- [i1]Ann Sizemore, Chad Giusti, Danielle S. Bassett:
Classification of weighted networks through mesoscale homological features. CoRR abs/1512.06457 (2015) - 2014
- [j1]Chad Giusti, Vladimir Itskov:
A No-Go Theorem for One-Layer Feedforward Networks. Neural Comput. 26(11): 2527-2540 (2014)
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-30 20:26 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:
