Research areas include artificial intelligence, combinatorial optimization, computability and complexity, and constructive algorithmics.
Center for Discrete Mathematics and Theoretical Computer Science, Rutgers, New Jersey.
University of California, Irvine. Research centers on the design and analysis of algorithms and data structures as well as computational complexity.
Research areas include algorithms, complexity theory, computation and biology, cryptography and information security, distributed systems, numerical analysis and scientific computing, semantics, and supercomputing technologies.
Research includes sequential and parallel algorithms, computational problems in databases, computational geometry, design and analysis of programs and programming languages, and combinatorial, logical, and algebraic mathematics.
Research areas include design and analysis of algorithms, models of computation, and computational complexity.
Centred around mathematical models of a variety of languages and logics, using techniques such as structural operational semantics, linear logic, domain theory and category theory. Strong links with Logic and Set Theory in the Pure Mathematics Department.
Oxford University Computing Laboratory. Studying how multiple, independently controlled threads behave when running and interacting together.
Major field of research is database theory with a focus on query languages and use of the methods of mathematical logic.
FACS promotes the development of formal approaches of production of computer-based systems.