A Algorithms and Computational Biology Lab

Research Topics:

Algorithm

We are interested in all aspects of the design and analysis of combinatorial algorithms. Ongoing research includes:

  • approximation algorithms,
  • on-line algorithms,
  • computational geometry,
  • graph drawing,
  • information retrieval,
  • average-case analysis of algorithms,
  • computational complexity,
  • cryptography and computer security,
  • coding theory,
  • parallel algorithms,
  • computational molecular biology,
  • machine learning,
  • bioinformatics and biomedical informatics.

Faculty

Marek Chrobak
Marek Chrobak

Office: Bourns Hall A159C



My general research interests are in the design and analysis of algorithms, theory of computation, and combinatorial optimization. In my recent work I have been working on online algorithms, approximation algorithms, and on information dissemination protocols in radio networks.


Tao Jiang

Office: WCH 336



My research has been focused on the design and analysis of algorithms of either theoretical or practical importance. Some of my past work includes approximation algorithms, average-case analysis, computational complexity, and computational learning. My current work is mostly concerned with algorithmic and machine learning problems in bioinformatics and biomedical informatics.


Yan Gu

Office: WCH 335



My current research interest is design efficient (usually parallel) algorithms for large-scale data with good performance in practice.


Yihan Sun

Office: WCH 308



Broad topics in the theory and practice of parallel computing, including algorithms, data structures, frameworks, implementations, and their applications. My work involves improving asymptotical theoretical bounds, simplifying algorithms and proofs, and developing efficient solutions to real-world problems.


Amey Bhangale

Office: WCH 312



My research interests lie in Complexity Theory. More specifically, I am interested in topics related to approximation algorithms, constraint satisfaction problems, analysis of Boolean functions and probabilistically checkable proofs.


Silas Richelson

Office: Bourns Hall A159



My research interests are in Cryptography, Computer Security and Complexity Theory.

Stefano Lonardi

Office: WCH 325



Research interests: computational molecular biology, bioinformatics, design of algorithms, machine learning and data mining.


Alumni

Miguel Coviello
Ph.D. Computer Science
Xin Zhang
Ph.D. Computer Science
Weihua Pan
Ph.D. Computer Science
Weihua Pan
Ph.D. Computer Science
Hind Alhakami
Ph.D. Computer Science
Rachid Ounit
Ph.D. Computer Science
Wei-Bung Wang
Ph.D. Computer Science
Guanqun Shi
Ph.D. Computer Science
Yang Yang
Visiting researcher
Monik Khare
Ph.D. Computer Science
Arman Yousefi
Ph.D. Computer Science
Elena Harris
Ph.D. Computer Science
Christos Koufogiannakis
Ph.D. Computer Science
Vladimir Vacic
Ph.D. Computer Science
YongHui Wu
Ph.D. Computer Science
Serdar Bozdag
Ph.D. Computer Science
Zhaocheng Fan
Visiting researcher
Qi Fu
Ph.D. Computer Science
Zheng Fu
Ph.D. Computer Science
Lan Liu
Ph.D. Computer Science
Mathilde Hurand
Visiting researcher
Zheng Liu
Ph.D. Computer Science
Jie Zheng
Ph.D. Computer Science
Wojciech Jawor
Ph.D. Computer Science
Qiaofeng Yang
Ph.D. Bioinformatics
Chuhu Yang
Ph.D. Bioinformatics
Xin Chen
Postdoc
Haifeng Li
Ph.D. Computer Science
Petr Kolman
Postdoc
Jing Li
Ph.D. Computer Science
Andres Figeuroa
Ph.D. Computer Science
Ashraful Arefeen
Ph.D. Computer Science