Theory and Algorithms
The fundamental problems of theories of programming and their integration with formal notations are widely acknowledged as the most significant areas of computer science research.
The theories define, in various different ways, many common notions, such as abstraction, refinement, choice, termination, feasibility, concurrency and communication.
Despite many differences, such theories and their combinations provide a means for development of software and hardware designs in a seamless, logically consistent way.
Research at the USI Faculty of Informatics spans all areas of the theory of computing and is responsible for the development of the foundations of efficient graph algorithms, and the use of applied logic and formal verification for building reliable systems. In addition to its depth in the central areas of theory, USI Università della Svizzera italiana provides unique opportunities for students to work with faculty on both theoretical and applied areas, and do their research in areas combining theory and applications.
The research interests of Prof. Papadopoulou are in the design and analysis of algorithms, computational geometry, applications of computational geometry in diverse areas such as VLSI design automation, implementation of geometric algorithms, data structures, algorithmic aspects of computer-aided design for VLSI layout and VLSI manufacturing.
Prof. Schmidhuber is a director of the IDSIA research institute and interested in topics such as machine learning, mathematically optimal universal AI, artificial curiosity and creativity, artificial recurrent neural networks, adaptive robotics, complexity theory, digital physics, theory of beauty, and the fine arts.
Prof. Sharygina's research interests are in software and hardware verification (e.g., model-checking, abstract interpretation, decision procedures, satisfiability modulo theories - SMT), information security, and concurrent and distributed computing. She heads the Formal Verification and Security Lab.
Prof. Wolf's research domain lies in the fields of cryptography, information theory, and quantum information processing. In particular, he is interested in an efficient realization of provably secure cryptographic and other information-processing functionalities based on weak classical or quantum-physical primitives.