معرفی
Robbie Weber is an Assistant Professor at the Paul G. Allen School of Computer Science & Engineering, University of Washington. He specializes in teaching theoretical computer science courses and conducting education research to improve pedagogical approaches in discrete mathematics and algorithms.
- Ph.D., Computer Science (2020), advised by Shayan Oveis Gharan and Anna Karlin
His research focuses on two main areas: (1) CS Education - developing interventions like one-on-one review sessions to enhance student success in discrete mathematics and implementing alternative grading strategies for non-major algorithms courses, and (2) Theoretical CS - algorithm design for graph problems and combinatorial questions. He applies his expertise in stable matchings and tournament design to both research domains.
Recent publications demonstrate his educational innovation, including a 2025 SIGCSE study showing reduced DFW-rates through personalized tutoring and a 2023 SIGCSE paper on alternative grading methods. His foundational theory work includes a landmark 2018 STOC paper on stable matching bounds and a 2017 Arxiv paper introducing embedded-width for plane graphs.
Scientific Awards:
- Best Presentation Winner at HotPoCSci 2018
- Best Presentation Winner at PoCSci 2019
He actively mentors undergraduate researchers in theoretical computer science and serves as a key teaching resource within UW's Theory Group. Though not a principal investigator, he collaborates with Ph.D. students on interdisciplinary projects at the intersection of CS theory and pedagogy.
