معرفی
Soren Riis is a Reader in the School of Electronic Engineering and Computer Science at Queen Mary University of London. He is affiliated with both the Centre for Fundamental Computing and AI and the Centre for Multimodal AI. His academic career spans several decades with significant contributions to theoretical computer science and mathematics.
Dr. Riis earned his DPhil in Mathematics from the University of Oxford with a thesis titled "Independence in Bounded Arithmetic." His research focuses on the intersection of mathematical logic, complexity theory, and information theory. His work has advanced understanding in proof complexity, network coding, and algebraic methods in computer science.
His research interests span Mathematical Logic, Complexity Theory, Proof Complexity, Algebraic Proof Complexity, Information Theory, and Network Coding. He has made significant contributions to understanding the connections between logic, computation, and information flow in networks. His work on graph entropy and guessing games has provided new insights into network coding capacity and information inequalities.
His recent publications show a trend toward social choice theory and Condorcet domains, while maintaining his foundational work in network coding and information theory. This represents an interesting expansion of his research into combinatorial structures with applications to voting theory and preference aggregation, while maintaining connections to his earlier work on graph theory and information flow.
- Coaches Queen Mary Programming teams with Paolo Oliva
- Current PhD students include Nhat Anh Dang, Sune Jakobsen, and Howard Manning
- Former PhD students include Stefan Dantchev, Taoyang Wu, Sun Yun, and John Fabien
- Former postdoctoral students include Maximilien Gadouleau, Antonia Katzouraki, Emil Vaughan, and Rahil Baber
Dr. Riis teaches undergraduate courses in Computability, Complexity and Algorithms and Logic and Discrete Structures. His teaching emphasizes the theoretical foundations of computer science, particularly the NP versus P problem and formal logic systems. He has designed numerous BSc and MSc projects focused on network routing, game theory, and algorithm design. His educational approach combines theoretical rigor with practical applications, particularly in the context of programming competitions and problem-solving.
