学院服务直通车:0335-8396075 sstc@neuq.edu.cn

招生信息|Admissions

教学ACADEMICS

Dr. Luke Mathieson

  • Lecturer, Masters Research or PhD student supervision, School of Computer Science

    • 电子邮箱/E-mail:Luke.Mathieson@uts.edu.au
    • 办公室/Office:科技楼6034
    • 讲授课程/Subjects:Systems Testing & Quality Management
    • 答疑时间/Office Hours:每周一上午9:00-9:50
    • 个人简介:Luke Mathieson is a theoretical computer scientist and lecturer at UTS. His research is centred on parameterised complexity and its applications, but extends to a variety of areas of complexity theory, algorithmics and mathematics.

      He has taught an extensive range of computer science subjects, particularly focusing on the theory of computation, computational complexity and algorithmics.
    • 课程教学:Systems Testing & Quality Management
    • 项目课题:Luke's main research interests are in parameterized complexity and the fundamentals of computational complexity, however his research spans a number of areas:

        - Computational complexity
        - Parameterized complexity
        - Finite Model Theory/Logic
        - Algorithmics
        - Approximation
        - Memetic algorithms

      A major theme of his research is the complexity of graph editing problems, a topic in which he specialises.
    • 研究成果:

个人简介 / Introduction

Luke Mathieson is a theoretical computer scientist and lecturer at UTS. His research is centred on parameterised complexity and its applications, but extends to a variety of areas of complexity theory, algorithmics and mathematics.

He has taught an extensive range of computer science subjects, particularly focusing on the theory of computation, computational complexity and algorithmics.

课程教学 / Subjects

Systems Testing & Quality Management

项目课题 / Projects

Luke's main research interests are in parameterized complexity and the fundamentals of computational complexity, however his research spans a number of areas:

  - Computational complexity
  - Parameterized complexity
  - Finite Model Theory/Logic
  - Algorithmics
  - Approximation
  - Memetic algorithms

A major theme of his research is the complexity of graph editing problems, a topic in which he specialises.

研究成果 / Achievements

Copyright©东北大学悉尼智能科技学院 / Sydeny Smart Technology College, Northeastern University, All Rights Reserved. 免责声明