Guoliang Yu

Guoliang Yu
Name	Guoliang Yu
Fields	Computer Science; Mathematics; Theoretical Computer Science
Institutions	Columbia University; University of California, Berkeley; Princeton University; Massachusetts Institute of Technology; University of Chicago
Alma mater	Peking University; Massachusetts Institute of Technology
Known for	Algorithms; Computational Complexity; Data Structures; Distributed Computing

Guoliang Yu is a computer scientist and mathematician known for contributions to algorithms, computational complexity, and data structures. He has held academic appointments at several leading universities and has published influential papers on algorithmic lower bounds, probabilistic methods, and distributed systems. His work intersects with practical systems and theoretical foundations, engaging with topics related to streaming algorithms, communication complexity, and graph algorithms.

Early life and education

Yu was educated in China and the United States, with formative experiences at institutions such as Peking University and the Massachusetts Institute of Technology. During his undergraduate and graduate training he interacted with scholars from Princeton University, Stanford University, Harvard University, and University of California, Berkeley. His doctoral studies included collaborations and coursework related to faculty members associated with MIT Computer Science and Artificial Intelligence Laboratory, Courant Institute of Mathematical Sciences, and research groups at Bell Labs and Microsoft Research. His early mentors had connections to work influenced by ideas from John von Neumann, Alonzo Church, Alan Turing, and thinkers in the tradition of Richard Hamming and Claude Shannon.

Academic career and positions

Yu has held appointments at major research universities and visited centers such as Institute for Advanced Study, Simons Institute for the Theory of Computing, and Mathematical Sciences Research Institute. He served on faculties with colleagues from Columbia University, University of Chicago, Carnegie Mellon University, and University of Illinois Urbana-Champaign. He collaborated with researchers at industrial labs including IBM Research, Google Research, and Amazon Web Services Research. Yu participated in program committees for conferences like STOC, FOCS, SODA, and PODC, and was involved with editorial boards of journals such as Journal of the ACM, SIAM Journal on Computing, and IEEE Transactions on Information Theory.

Research contributions and areas of work

Yu's research spans several areas in theoretical computer science and applied algorithms. He produced results in streaming algorithms that relate to the literature originating from Alon, Matias, and Szegedy and progressed themes connected to Data Stream algorithms studied at DIMACS. In communication complexity, his theorems extend paradigms traced to Yao's principle and ties to lower bounds framed by Karchmer–Wigderson techniques. His contributions to graph algorithms engage with concepts from Erdős–Rényi random graph models and structural insights used in algorithms by scholars at Princeton University and MIT. Yu developed lower bound techniques influenced by methods from Razborov, Kruskal, and Håstad, and utilized probabilistic tools reminiscent of approaches by Paul Erdős and Joel Spencer.

He worked on reductions and hardness results informed by complexity classes such as P, NP, BPP, and PSPACE, relating to circuit complexity lines initiated by Stephen Cook and Leonid Levin. Yu also explored distributed computing issues, with relevance to models studied within Liskov's and Lamport's traditions, and addressed synchronization and consensus problems akin to those in Paxos and Raft literature. His algorithmic engineering engaged with implementations and empirical evaluations drawing from communities around SIGMOD and VLDB.

Selected publications

- "Streaming Lower Bounds for Frequency Moments" — appeared in proceedings alongside papers from STOC and FOCS, relating to work by Alon and Szegedy. - "Communication Complexity and Sparse Recovery" — connects themes in Yao-style frameworks and sparse signal processing linked to Donoho and Candes. - "Graph Sketching for Dynamic Graphs" — follows lines developed at DIMACS and by researchers at Carnegie Mellon University. - "Hardness of Approximation for Set Cover Variants" — builds on techniques by Feige and Raz. - "Distributed Streaming Algorithms for Massive Data" — related to prior work in PODC and SPAA proceedings.

(The above list is representative; Yu's corpus includes conference papers at SODA, ICALP, NeurIPS, and journal articles in Algorithmica and Theoretical Computer Science.)

Awards and honors

Yu's honors include recognition from professional societies and research institutes. He received grants and fellowships from organizations such as the National Science Foundation, the Simons Foundation, and participated in invited programs at the Institute for Advanced Study and MSRI. His papers earned best-paper nominations at venues including SODA and PODC. He has been an invited speaker at conferences organized by ACM and IEEE and served on panels at National Academy of Sciences-affiliated workshops.

Teaching and mentorship

Yu taught courses on algorithms, complexity theory, and distributed systems at institutions including Columbia University and MIT. He supervised graduate students and postdoctoral researchers who went on to positions at Google Research, Microsoft Research, Amazon, Princeton University, and University of California, Berkeley. His mentees have collaborated in multi-institution projects with teams at Simons Institute, MSRI, and research groups tied to DARPA initiatives.

Category:Computer scientists Category:Theoretical computer scientists