Speaker: Prof. Pinyan Lu, ITCS@SUFE, China
Date/Time: Oct. 22, 2022
Bio: Pinyan Lu is a professor and the founding director of Institute for Theoretical Computer Science at Shanghai University of Finance and Economics (ITCS@SUFE). Before joining SUFE, he was a researcher at Microsoft Research. He studied in Tsinghua University (BS (2005) and PhD (2009) both in Computer Science). He is interested in theoretical computer science, including complexity theory, algorithms design and algorithmic game theory. Currently, his research is mainly focused on complexity and approximability of counting problems, and algorithmic mechanism design. Pinyan is the recipient of a number of awards including ICCM Silver Medal of Mathematics, Distinguished Membership of ACM and CCF, CCF Young Scientist award, Best Paper Award from ICALP 2007, FAW 2010, ISAAC 2010 and so on. He is the PC chairs for FAW-AAIM 2012, WINE 2017, FAW 2018, ISAAC 2019 and so on, and PC members for STOC, FOCS, SODA and a dozen of international conferences. He is an Editorial Board Member of the “Information and Computation” and “Theoretical Computer Science”.
Speaker: Professor Leslie Ann Goldberg, University of Oxford, UK
Bio: Leslie Ann Goldberg is a professor of computer science at the University of Oxford and a Fellow of St Edmund Hall, Oxford. Her research concerns the design and analysis of algorithms for random sampling and approximate combinatorial enumeration. Prior to working at Oxford, her employers have included Sandia National Laboratories, the University of Warwick, and the University of Liverpool. Goldberg serves as editor-in-chief of the Journal of Discrete Algorithms, and has served as program chair of the algorithms track of the International Colloquium on Automata, Languages and Programming (ICALP) in 2008. She is a member of the Academia Europaea (MAE) and was awarded the Suffrage Science award in 2016.