Physical Sciences Division
The University of Chicago
|Advisor||Prof. László Babai|
|Research area||Combinatorics and Theoretical Computer Science|
|Education, degrees||The University of Chicago|
Ph.D. program, Mathematics (2011-2017), Computer Science (2017-present)
Advisor: László Babai
Expected Graduation: June 2019
Expected Degree: Ph.D. in Mathematics and Computer Science
The University of Chicago
M.S., Mathematics, 2013
California Insitute of Technology
B.S., Mathematics, 2011
|tim [my last name] 'at' math.uchicago.edu|
My research interest is in theoretical computer science (TCS) and discrete mathematics. TCS is in the overlap of mathematics and computer science; it deals with the rigorous analysis of algorithms and mathematical models of computation. Specifically, I have worked in the complexity theory of Boolean functions and in algorithmic coding theory. An overarching theme of my work has been the application of group theory to algorithms and complexity theory.
I am often drawn to problems with a discrete, symmetrical structure that is simple to describe but hard to analyze.
László Babai, Timothy Black, and Angela Wuu. List-Decoding Homomorphism Codes with Arbitrary Codomains. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, pages 29:1-29:18. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018. Link to arXiv version.
- Timothy Black. Products of alternating groups are universally economically list-decodable. In preparation.
Timothy Black. Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (ITCS '15), pp 383-391. 2015. Best Student Paper Award. Use this link for free access.
- Timothy Black, Alan Guo, Madhu Sudan, and Angela Wuu. List-decoding group homomorphisms to nilpotent groups. In preparation.
Winter 2019: Instructor, Mathematics for Computer Science and Data Analysis - CAPP 30271.
Autumn 2018: Instructor, Computer Science with Applications - CS 121 (section 4).
Winter 2018: Instructor, Introduction to Computer Science - CS 151 (section 2).
Autumn 2017: Instructor, Computer Science with Applications - CS 121 (section 4).
2016-2017: Instructor, Honors Calculus, Inquiry-Based Learning - Math 161, 162, 163 (section 50), coteaching with Sarah Ziesler.
Spring 2016: Special Course Assistant for UChicago Math Study Abroad at the University of Chicago Center in Paris.
Autumn 2015 and Winter 2016: Instructor, Calculus - Math 152 and 153 (section 55).
2014-2015: Instructor, Elem Functions And Calculus - Math 131, 132, and 133 (section 48).
2013-2014: Instructor, Calculus - Math 151, 152, and 153 (section 41).
2012-2013: College Fellow, Analysis in Rn - Math 203, 204, and 205 (sections 31 and 41) with Prof. Alex Eskin, Dr. Hung Tran, and Dr. Inna Zakherevich, respectively.
Canada/USA Mathcamp is a wonderful summer program for students ages 13-18 who are exceptional at math. Students come from around the world for the five-week program. I've been a mentor for four summers, teaching classes on topics including Error-Correcting Codes; Linear Programming; Fourier Analysis on the Boolean Cube; Decision Tree Complexity and Evasiveness; Machine Learning; Probabilistically Checkable Proofs of Proximity; Multiparty Communication Complexity; The Probabilistic Method; Sperner's Lemma; and Hyperreal numbers. I've been affiliated with Mathcamp from long before that; my first summer was as a camper in 2005.
Math Circles of Chicago provides students in grades 5 through 12 in all communities of Chicago access to actively participate in novel mathematics. In 2017-2018, I am teaching Euler sessions at the UChicago YSP Math Circle.
Projective Set is a game played with a deck of 63 cards. Seven cards are placed on the table. Your goal is to find, among those seven cards, a set of those cards such that each color of dot appears on an even number of cards in your set. I made this web app. When you find a set, drag it toward the side of the screen.