Computer Science


Calin Anton

Associate Professor, Computer Science

PhD (Alberta)

5-173D, City Centre Campus
10700 - 104 Avenue
Edmonton, AB T5J 4S2
780/633-3038

Biography

Calin obtained his B.Sc. (computing science) in 1996, and M.Sc. (computing science) in 1997 at University of Bucharest (Romania). After working for two universities in Bucharest, in 1999, he started a PhD in computing science at University of Alberta. During his graduate studies, Calin worked mainly on identifying structural properties of combinatorial problems such as Satisfiability and Subgraph Isomorphism. The goal was to use such properties to either efficiently solve problems or generate hard instances. He defended his PhD thesis, “Structure and Randomness of Satisfiability”, in 2005. Between 2005 and 2007 Calin was assistant professor of computer science at Augustana Faculty (University of Alberta). Since 2008 he has been working as instructor in the Computer Science Department at Grant MacEwan University. At MacEwan, Calin teaches courses in the areas of Algorithmics and Artificial Intelligence, as well as basic computer science courses. Calin’s recent research focuses on generating hard satisfiable instances of the Satisfiability problem by encoding carefully crafted random instances of Subgraph Isomorphism. Both at MacEwan, and at Augustana, Calin worked with undergraduate students on projects related to hard instances generation. Some of these projects resulted in instance generators that have been used in the Satisfiability solvers competitions. Recently, Calin developed a strong interest in Computer Security and is planning to switch some of his research and teaching towards this intriguing area.

Expertise
Algorithmics, Artificial Intelligence

Teaching and Research Interests

Courses taught:

  • CMPT101 Introduction to Computing Science
  • CMPT157 Introduction to Computing for Business
  • CMPT200 Data Structures and Their Algorithms
  • CMPT201 Programming Methodology
  • CMPT204 Algorithms I
  • CMPT250 Human Computer Interaction I
  • CMPT272 Formal Systems and Logic in Computing
  • CMPT 305 Non-procedural Languages
  • CMPT355 Introduction to Artificial Intelligence

Research interests
My research interests reside in the general areas of empirical algorithms and artificial intelligence; more specifically: heuristic search and the Satisfiability problem.

Selected Publications / Presentations / Conference Papers

  • Calin Anton, Lane Olson. “Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism”, in Proc. of the 22-nd Canadian Conference on Artificial Intelligence, Kelowna, Canada, 2009, Lecture Notes in Artificial Intelligence 5549, Springer, Netherlands
  • Calin Anton, Joseph Culberson. “A variation of the random k-SAT model”, Proc. of the 3-rd International Conference on Electronics, Computers and Artificial Intelligence, Pitesti, Romania, 2009
  • Calin Anton, Christopher Neal. “Notes on Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism”,  in Proc. of the 23-rd Canadian Conference on Artificial Intelligence, Ottawa, Canada, 2010, Lecture Notes in Artificial Intelligence 6085, Springer, Netherlands
  • Calin Anton. “An improved satisfiable SAT generator based on Random Subgraph Isomorphism”,   in Proc. of the 24-th Canadian Conference on Artificial Intelligence, St Jhon’s, Canada, 2011, Lecture Notes in Artificial Intelligence 6657, Springer, Netherlands
  • Calin Anton, Joseph Culberson. “Comparing the hardness of CNF SAT instances using the same input length criterion”, Proc. of the 4-th International Conference on Electronics, Computers and Artificial Intelligence, Pitesti, Romania, 2011

Awards / Grants / Fellowships

  • NSERC -Discovery Grant (2006 –2010)
  • MacEwan University - Conference Travel Fund (2010)
  • MacEwan University - Research, Scholarly Activity and Creative Achievements Fund (2011)
  • MacEwan University - Conference Travel Fund (2011)
  • MacEwan University - Research, Scholarly Activity and Creative Achievements Fund (2012)