E-mail: taohou01 at gmail.com
Announcement
- Starting from Fall 2024, I will be joining the CS department at the University of Oregon as an assistant professor. I am looking for PhD students to work with me as I join UOregon. Send me an email if you are interested (see also the 'To Perspective Students' section).
About
I am currently an Assistant Professor in the School of Computing at DePaul University. My research interest is computational topology/geometry and topological data analysis (TDA). I am also broadly interested in applications of TDA to different domains.
I graduated from the CS department at Purdue University with a doctoral degree in May 2022. The title of my PhD thesis is 'Homological Representatives in Topological Persistence'.
To Perspective Students
The core of my research is a combination of computer science with mathematics, and I am open to working with students who have a strong interest in either, or better, both. Students with CS or Math background are welcomed to contact me. Meanwhile, I am also broadly interested in applications of my research to different domains. Besides my current collaborations on using TDA to analyze scientific data (such as brain networks), I am seeking more extensive interplay of TDA with areas such as machine learning, geometry processing, visualizations, etc.
As a student of mine, you will pursue a research effort in any one or combination of the following directions:
- Efficient algorithm design and computational complexity
- Algorithm implementation for impactful software
- Applied mathematics (topology, geometry, algebra, etc.)
- Applications (analyzing domain data, machine learning, etc.)
Software
Papers in Preparation
Nghi Nguyen, Tao Hou, Enrico Amico, Jingyi Zheng, Huajun Huang, Alan D. Kaplan, Giovanni Petri, Joaquin Goni, Yize Zhao, Duy Duong-Tran, and Li Shen
Publications
Tamal K. Dey* and Tao Hou*
International Symposium on Computational Geometry (SoCG) 2024, to appear
Tamal K. Dey*, Tao Hou*, and Salman Parsa*
Algorithms and Data Structures Symposium (WADS) 2023,
[talk@WADS]
Tamal K. Dey* and Tao Hou*
arXiv preprint arXiv: 2112.02352 (2022)
[github]
Tamal K. Dey* and Tao Hou*
European Symposium on Algorithms (ESA) 2022
[github] [talk@ESA]
On Association between Absolute and Relative Zigzag Persistence
Tamal K. Dey* and Tao Hou*
arXiv preprint arXiv:2105.00518 (2021)
Anand V. Patel, Tao Hou, Juan D. Beltran Rodriguez, Tamal K. Dey, and Dunbar P. Birnie III
Computational Materials Science, 202:110920, 2022
Tamal K. Dey* and Tao Hou*
International Symposium on Computational Geometry (SoCG) 2021
[talk@SoCG]
Tamal K. Dey*, Tao Hou*, and Sayan Mandal*
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020
[github] [talk@SODA]
Tamal K. Dey*, Tao Hou*, and Sayan Mandal*
Computational Topology in Image Context, International Workshop, 2019
[webpage] [talk@Ohio TDA Day]
Tao Hou and Li Chen
Journal of Visualization 19.4 (2016): 715-726
Invited Talks / Conference Presentations
Revisiting Graph Persistence for Updates and Efficiency WADS. Jul 2023. Montreal, QC
Revisiting computation of zigzag persistence for new results Joint Math/CS Seminar, DePaul Univ. Feb 2023. Chicago, IL
Revisiting computation of zigzag persistence for new results TDA Seminar, Michigan State Univ. Dec 2022. East Lansing, MI
Fast Computation of Zigzag Persistence Computational Persistence Workshop. Nov 2022. Purdue University (online)
Fast Computation of Zigzag Persistence ESA. Sep 2022. Potsdam, Germany (online)
Topological Signatures for Data Analysis Aided by Homological Generators Seminar, DePaul University. Mar 2022. Chicago, IL
Topological Signatures for Data Analysis Aided by Homological Generators Seminar, North Carolina State University. Mar 2022. Raleigh, NC
Computing zigzag persistence on graphs in near-linear time Computational Persistence Workshop. Nov 2021. Purdue University (online)
Computing zigzag persistence on graphs in near-linear time SoCG. Jun 2021. Buffalo, New York (online)
Computing minimal persistent cycles: polynomial and hard cases Seminar, Topology and Geometry for Data Analysis, Purdue University. Feb 2021. Online
Computing minimal persistent cycles: polynomial and hard cases Seminar, Applied Algebraic Topology Research Network. May 2020. Online
Computing minimal persistent cycles: polynomial and hard cases SODA. Jan 2020. Salt Lake City, Utah
Persistent 1-cycles: definition, computation, and some applications Ohio TDA Day. July 2019. Dayton, Ohio
Teaching
CSC 301: Data Structures II
CSC 421: Applied Algorithms and Structures