default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTao Hou 0002
Person information
- affiliation: DePaul University, School of Computing, Chicago, IL, USA
- affiliation (PhD 2022): Purdue University, Department of Computer Science, West Lafayette, IN, USA
- affiliation: Ohio State University, Department of Computer Science and Engineering, OH, USA
Other persons with the same name
- Tao Hou — disambiguation page
- Tao Hou 0001
![[0000-0003-3775-6170]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-3775-6170")
— University of North Texas, Department of Computer Science and Engineering, USA (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Tao Hou:
Homological Representatives in Topological Persistence. Purdue University, USA, 2022
Conference and Workshop Papers
- 2024
- [c6]Tamal K. Dey, Tao Hou:
Computing Zigzag Vineyard Efficiently Including Expansions and Contractions. SoCG 2024: 49:1-49:15 - 2023
- [c5]Tamal K. Dey, Tao Hou, Salman Parsa:
Revisiting Graph Persistence for Updates and Efficiency. WADS 2023: 371-385 - 2022
- [c4]Tamal K. Dey, Tao Hou:
Fast Computation of Zigzag Persistence. ESA 2022: 43:1-43:15 - 2021
- [c3]Tamal K. Dey, Tao Hou:
Computing Zigzag Persistence on Graphs in Near-Linear Time. SoCG 2021: 30:1-30:15 - 2020
- [c2]Tamal K. Dey, Tao Hou, Sayan Mandal:
Computing Minimal Persistent Cycles: Polynomial and Hard Cases. SODA 2020: 2587-2606 - 2019
- [c1]Tamal K. Dey, Tao Hou, Sayan Mandal:
Persistent 1-Cycles: Definition, Computation, and Its Application. CTIC 2019: 123-136
Informal and Other Publications
- 2024
- [i11]Tamal K. Dey, Tao Hou, Dmitriy Morozov:
A Fast Algorithm for Computing Zigzag Representatives. CoRR abs/2410.20565 (2024) - 2023
- [i10]Tamal K. Dey, Tao Hou:
Revisiting Graph Persistence for Updates and Efficiency. CoRR abs/2302.12796 (2023) - [i9]Tamal K. Dey, Tao Hou:
Computing Zigzag Vineyard Efficiently Including Expansions and Contractions. CoRR abs/2307.07462 (2023) - 2022
- [i8]Tamal K. Dey, Tao Hou:
Fast Computation of Zigzag Persistence. CoRR abs/2204.11080 (2022) - 2021
- [i7]Tamal K. Dey, Tao Hou:
Computing Zigzag Persistence on Graphs in Near-Linear Time. CoRR abs/2103.07353 (2021) - [i6]Anand V. Patel, Tao Hou, Juan D. Beltran Rodriguez, Tamal K. Dey, Dunbar P. Birnie III:
3D Microstructure Segmentation by Topological Persistence. CoRR abs/2104.13430 (2021) - [i5]Tamal K. Dey, Tao Hou:
Computing Optimal Persistent Cycles for Levelset Zigzag on Manifold-like Complexes. CoRR abs/2105.00518 (2021) - [i4]Tamal K. Dey, Tao Hou:
On Association between Absolute and Relative Zigzag Persistence. CoRR abs/2110.06315 (2021) - [i3]Tamal K. Dey, Tao Hou:
Updating Zigzag Persistence and Maintaining Representatives over Changing Filtrations. CoRR abs/2112.02352 (2021) - 2019
- [i2]Tamal K. Dey, Tao Hou, Sayan Mandal:
Computing Minimal Persistent Cycles: Polynomial and Hard Cases. CoRR abs/1907.04889 (2019) - 2018
- [i1]Tamal K. Dey, Tao Hou, Sayan Mandal:
Persistent 1-Cycles: Definition, Computation, and Its Application. CoRR abs/1810.04807 (2018)
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 2025-01-09 20:30 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:
