Ph.D. - Computer Science
University of Illinois, Urbana-Champaign - 2013

M.S. - Computer Science
University of Illinois, Urbana-Champaign - 2010

B.S. - Computer Science
University of Illinois, Urbana-Champaign - 2008

Faster algorithms for the geometric transportation problem 2017 - Publication

Minimum cycle and homology bases of surface embedded graphs 2017 - Publication

Parallel algorithms for constructing range and nearest-neighbor searching data structures 2016 - Publication

Approximating dynamic time warping and edit distance for a pair of point sequences 2016 - publications

A polynomial-time bicriteria approximation scheme for planar bisection 2015 - publications

Stutzke Dissertation Completion Fellowship - University of Illinois, Urbana-Champaign [2013]

C.W. Gear Outstanding Graduate Student Award - University of Illinois, Urbana-Champaign [2013]

Graduate Fellowship - Department of Energy Office of Science [2013]

Computer Scientist Earns NSF Grant, Has Designs on More Efficient Algorithms

Dr. Kyle Fox, assistant professor of computer science in the Erik Jonsson School of Engineering and Computer Science at The University of Texas at Dallas, recently received a five-year, $586,654 National Science Foundation Faculty Early Career Development (CAREER) Award to explore how the mathematical field of topology can be used to design more efficient and faster algorithms to solve difficult problems.

Topology is the study of the properties that geometric objects maintain after undergoing certain changes. In a commonly used example, a coffee cup can be reshaped into a doughnut yet still retain similar properties, such as having one hole. Computational topology, the study of computer algorithms for topological problems, is an emerging field. Fox, who joined the University in 2017, researches algorithmic foundations of computer science and their relationship to geometry and topology.

Kyle Fox Receives $586,654 From NSF

Dr. Kyle Fox was awarded $586,654 from the National Science Foundation (NSF) for his research project, Exploiting Topology in Graph Algorithm Design. Dr. Fox’s research focuses on understanding the role topology can take both in performing fast computations on graphs and explaining what graph properties are necessary for these fast computations. The goal of the project is to make new computational tasks possible and greatly simplify established tasks.

Member

Graduate Admissions Committee at UT Dallas