Topological Ideas in Computer Science
Monday, March 11, 2013 - 10:00am - 11:15am
KEC 1007
Amir Nayyeri
Postdoctoral Researcher
Computer Science Department
Carnegie Mellon University
Abstract:
Computational topology is a branch of theoretical computer science devoted to
the design and analysis of algorithms for topological problems. It is closely
related to other theoretical branches like computational geometry and graph
algorithms and has a wide range of applications (e.g. in computer graphics,
machine learning and sensor networks). In this talk, I introduce some
algorithmic problems in computational topology and discuss their applications
in computer science. Further, I will show how to use techniques from algebraic
topology and mathematical optimization to tackle some of such problems.
Finally, I will conclude by discussing some open problems and ongoing/future
research directions.
Speaker Biography:
Amir Nayyeri is a postdoctoral fellow in Computer Science Department at Carnegie Mellon University, where he is hosted by Gary Miller. Amir received his PhD in computer science from University of Illinois in Urbana Champaign under the supervision of Jeff Erickson. He is generally interested in theoretical computer science and its application. His primary research experience is in computational topology and geometry.
_______________________________________________
Colloquium mailing list
[email protected]
https://secure.engr.oregonstate.edu/mailman/listinfo/colloquium
