Richard Chang

Richard Chang is an Associate Professor in the Department of Computer Science and Electrical Engineering at the University of Maryland, Baltimore County (UMBC). He holds a Ph.D. from Cornell University (1991) and has been affiliated with UMBC since 1991, serving in various roles including tenure-track positions and joint appointments at the University of Maryland Institute for Advanced Computer Studies (1994–2004). His research focuses on computational complexity theory, particularly bounded query classes, NP-optimization problems, approximation algorithms, and relativized complexity. He has authored numerous papers on topics such as query complexity, Boolean hierarchies, and space-bounded computations.

Chang's academic contributions include significant work on the theoretical foundations of computational complexity, including studies on the Boolean hierarchy, randomized reductions, and the structure of NP computations. He has secured multiple research grants, including from the National Science Foundation and the National Security Agency. His teaching spans a wide range of computer science courses, from introductory programming to advanced topics like compiler design and automata theory.

He actively participates in academic service, serving on departmental, college, and university committees, as well as organizing conferences and reviewing for top journals. His work emphasizes bridging theoretical computer science with practical algorithmic challenges, contributing to both academic discourse and educational excellence.