I am a PhD student in Computer Science at UT Austin in the Algorithms and Computational Theory group. I am working with Anna Gál on problems in circuit complexity. I am an Assistant Instructor teaching CS105C for the Spring 2018 semester.
I completed my undergraduate education at Carnegie Mellon University in 2013. I worked with Klaus Sutner on my senior thesis "Classification and Automaticity of Discrete Dynamical Systems", for which I was awarded the Allen Newell Award for Excellence in Undergraduate Research. I worked with Mor Harchol-Balter on a problems in Queueing Theory.
|Email:||atrejo at cs dot utexas dot edu|
|Phone:||+1 (972) 408-5767|
Department of Computer Science|
The University of Texas at Austin
2317 Speedway, D9500
Austin, TX 78712
- Computational Complexity
- Formula/Circuit Lower Bounds
- Communication Complexity
- Approximation Algorithms
- Hardness of Approximation
- Combinatorics and Graph Theory
Cubic Formula Size Lower Bounds for Andreev Function with Majority.
Anna Gál, Avishay Tal, and Adrian Trejo Nuñez. 2018.
|Summer 2018:||CS 371L Mobile Computing (iOS)|
|Spring 2018:||CS 105C Computer Programming: C++|
|Fall 2017:||CS 105C Computer Programming: C++|
|Spring 2017:||CS 429 Computer Organization and Architecture|
|Fall 2016:||CS 429 Computer Organization and Architecture|
|Spring 2013:||15-359 Probability and Computing|
|Fall 2012:||15-213 Introduction to Computer Systems|
|Spring 2012:||15-750 Graduate Algorithms|
|21-268 Multidimensional Calculus|
|Fall 2011:||15-213 Introduction to Computer Systems|