理论计算机科学团队
通用链接 English 手机版
新闻资讯
通知公告
研究方向
  • Games played on finite graphs

    This is one of the important topics in model checking and verification in the last 20 or so years. The topic has deep connections to complexity theory, graph algorithms, and automata. The key task ...

  • Automatic structures

    A finite automaton is a simplest model of computation. The goal in this project is to use finite automata to represent infinite algebraic structures. A good example is the algebraic structure consi...

  • Very large graphs and their properties

    Nowadays networks with millions and many billion nodes can easily be found. Examples include social networks, various biological networks, particle systems such as crystals. Understanding such larg...

  • Computable structures

    This is one of the key areas on modern computability and logic. What is a computable structure? What does it mean that two computable structures are similar? What does it mean for a graph or tree t...

  • Games played on finite graphs

  • Automatic structures

  • Very large graphs and their properties

  • Computable structures

科研团队

  • faculty
  • student
    ----------------------------------------------1
    • ----------------------------------------------2
    • ----------------------------------------------3
更多+
    ----------------------------------------------1
更多+

团队领导人：Bakhady...

Research Interests: Computable Algebraic Systems and Model Theory,Automata and Automatic Structures,Games on Finite Graphs and Complexity Email: bmk@cs.auck...

详细>>
科研教学

  • 论文

  • 项目

  • 著作

  • 专利

  • 获奖

友情链接

访问量： 开通时间：-- 最后更新时间：--

清水河校区：成都市高新区（西区）西源大道2006号　邮编： 611731  
沙河校区：成都市建设北路二段四号　邮编：610054
蜀ICP备 05006379 号   I　川公网安备 51019002000280 号