Alperen A. Ergür

  • Faculty, University of Texas at San Antonio

I am an assistant professor in University of Texas at San Antonio Computer Science and Mathematics Departments.

Reasonable person policy I like CMU SCS reasonable person policy:
Everyone will be reasonable
Everyone expects everyone else to be reasonable
No one is special
Do not be offended if someone suggests you are not being reasonable

Teaching Interests My goal is to empower students with modern mathematical and computational skills, and cultivate algorithmic thinking. So far I'm involved in designing the following courses:
(1) a probability theory course delivered in algorithmic context,
(2) an undergrad level introduction to optimization,
(3) two course abstract algebra series from a computational point of view.

Seminar With Grigoris Paouris (TAMU) and Petros Valettas (Mizzou) we are running a student friendly research seminar on Geometry, Probability, and Computing. Details about the seminar can be found here .

Mentoring I very much enjoy working with undergraduate researchers. If you are a UTSA undergrad in Math, CS, or ECE, and find the topics of the seminar above interesting, feel free to come talk to me. If you are UTSA grad student in CS or Math and interested in theory of computing, computational geometry, optimization, computational algebra or randomized algorithms feel free to come talk to me.

Research Interests (Low resolution) I am interested in algorithms and complexity in algebra, geometry, combinatorics, and optimization. I focus on probabilistic and numerical methods. My publications are divided into broad categories below.

Research Interests (Higher resolution) I am interested in developing a geometric perspective on design and analysis of numerical algorithms. Geometry is vast and deep. I understand/use bits from convex geometry, real algebraic geometry, discrete geometry, and geometry of high-dimensional linear spaces.
I am also interested in developing an algorithmic theory of real polynomials; the goal is to be able to infer computational complexity of a problem from its description given by polynomial equations/inequalities.

Convex Geometry and Optimization Combinatorics and Probability Discrete Geometry (Randomized) Numerical Algorithms Classical Algebraic Geometry and Computer Algebra