About the Authors
 
 Ivan Hu
Ph.D. student
Department of Computer Science
University of Wisconsin -- Madison
Madison, Wisconsin, USA
ilhu[ta]wisc[td]edu
hhtps://pages.cs.wisc.edu/~ihu/
Ph.D. student
Department of Computer Science
University of Wisconsin -- Madison
Madison, Wisconsin, USA
ilhu[ta]wisc[td]edu
hhtps://pages.cs.wisc.edu/~ihu/
     Ivan Hu is a second year Ph.D. student at the
  University of Wisconsin–Madison
  under the supervision of Dieter van Melkebeek.
  He is studying complexity theory, with interests in algebraic complexity and pseudorandomness. He is currently an NSF Graduate Research Fellow. 
 
 Dieter van Melkebeek
Professor
Department of Computer Science
University of Wisconsin -- Madison
Madison, Wisconsin, USA
dieter[ta]cs[td]wisc[td]edu
https://pages.cs.wisc.edu/~dieter/
Professor
Department of Computer Science
University of Wisconsin -- Madison
Madison, Wisconsin, USA
dieter[ta]cs[td]wisc[td]edu
https://pages.cs.wisc.edu/~dieter/
Dieter van Melkebeek received his Ph.D. from the 
University of Chicago,
under the supervision of 
Lance Fortnow. 
His thesis was awarded the 
ACM 
Doctoral Dissertation Award. 
After postdocs at 
DIMACS and the
Institute for Advanced Study,
he joined the faculty at the
University of Wisconsin-Madison, where he currently is a full professor. His research interests include the power of randomness, lower bounds for NP-complete problems, and connections between derandomization and lower bounds. 
 
 Andrew Morgan
Software engineer
Google
amorgan[ta]cs[td]wisc[td]edu
https://pages.cs.wisc.edu/~amorgan/
Software engineer
amorgan[ta]cs[td]wisc[td]edu
https://pages.cs.wisc.edu/~amorgan/
    Andrew Morgan received his Ph.D. in 2022 from the 
    University of Wisconsin–Madison 
    under the supervision of Dieter van Melkebeek. After
    graduating, he became a software engineer at Google.
