✳flâneur — a map of the web's best reading

cs.cmu.edu/~yangp/

cs.cmu.edu · 455 words · saved by 1 readers

My research is broadly in the design and analysis of fast algorithms for solving fundamental computational problems, including graph algorithms, dynamic algorithms, and linear algebraic algorithms. My representative results include linear systems solvers, max-flow/min-cut algorithms, and time/space efficient data structures for matchings, resistances, and matrices. I teach courses on algorithms and data structures, and supervise research projects at all levels. I am also actively involved with outreach activities in the programming contest community, with focus at the high-school level. I am part of the wonderful theory@cs.cmu group. I was an assistant, then associate, professor at Georgia Tech from 2015 to 2021, and was an associate professor at the University of Waterloo from 2021 to 2023. Prior to that, I received my BMath from Waterloo, PhD from CMU, and was a postdoc at MIT. I am recipient of the NSF Career Award, the 2011 Microsoft Research PhD Fellowship, the 2013 CMU SCS Distin

Yang (Richard) Peng Associate Professor, School of Computer Science, Carnegie Mellon University Links 15-451 Algorithm Design and Analysis Page for Intercollegiate Programming Contests Contact: yangp@cs.cmu.edu . NOTE: due to load constraints, I can only start new research projects with students with IMO scores at least 30, or IOI rank top 9, or consistently reproducible performances on equivalents of the 2018-2025 versions of these tests. This is entirely due to limits of my bandwidth and resources, and is only specific to my group. My research is broadly in the design and analysis of fast al

Explore this link on the map →

related reading