Algorithms Research Group

ARG is a collection of researchers currently drawn mainly from the Department of Computing & Software at McMaster University. They are united by their interest in algorithms to solve problems of an essentially mathematical nature. The group currently includes 19 researchers, most but not all from McMaster, together with their graduate students and post-docs, plus visitors and other interested participants. New members, whether from McMaster or outside, are welcome.

Once a month from September to April, inclusive, ARG sponsors an informal seminar, with invited speakers from both inside and outside the group.

For further information, please contact Bill SMYTH.

• Christopher ANAND (image & signal processing, MRI, math & stat modelling, parallel computing)

• Ivan BRUHA (machine learning, neural nets, pattern recognition)

• Doug DOWN (queueing & communications networks, Markov processes)

• Franya FRANEK (algorithms on strings, combinatorial designs)

• Brian GOLDING (computational biology, bioinformatics, sequence analysis, molecular evolution)

• Lucian ILIE (bioinformatics, stringology, combinatorics on words, big data)

• Ryszard JANICKI (algorithms on relations involving partial orders, automata-based models, concurrency models)

• George KARAKOSTAS (approximation algorithms, computational complexity, applied theoretical computer science)

• Mark LAWFORD (real time systems, computer-aided verification)

• Ryan LEDUC (discrete-event systems: verification algorithms & complexity reduction through hierarchical structure)

• Ned NEDIALKOV (numerical analysis, validated methods for ordinary differential equations)

• Sanzheng QIAO (numerical algorithms, signal processing, parallel algorithms)

• Alex ROSA (combinatorial designs, graph decomposition, graph labelling)

• Pat RYAN (computational geometry, string algorithms, computer graphics)

• Joe SAWADA (combinatorics, combinatorial algorithms)

• Spencer SMITH (numerical analysis, scientific computing, finite element method)

• Bill SMYTH (algorithms on strings, graph algorithms, graph labelling)

• Michael SOLTYS (complexity theory, in particular proof complexity; string algorithms)

• George STEINER (scheduling, graph algorithms, combinatorial optimization)
  Last revised: Tuesday, 01-Apr-2014 15:06:52 EDT

  You are Visitor No. [an error occurred while processing this directive] since 15 January 2002.