Workshop on Universal Algebra and Computer Science

WUACS (Workshop on Universal Algebra and Computer Science): 12–13 June 2011, St. Petersburg, Russia

A Satellite Workshop to CSR 2011 (6th International Conference Computer Science in Russia), 14–18 June 2011, St. Petersburg, Russia

Links between universal algebra and theoretical computer science are numerous and studying them has proved to be productive for both the theories. In fact, theoretical computer science provides the most essential source of problems for modern universal algebra while algebraic methods and techniques constitute a major ingredient of the toolbox of modern computer science.

A lucky coincidence is that a representative international conference on universal algebra, see , will be held in Krakow, Poland, from June 6th to 10th, 2011, that is, exactly before CSR 2011. This creates a very convenient opportunity to bring together researchers with a common interest in universal algebra and its applications in computer science.

Submissions of interesting theoretical and applied results related to both fields are encouraged. Topics include (but are not limited to):

  • Applications of universal algebra in the constraint satisfaction problem
  • Extensions of algebraic methods in soft and valued CSPs, and other related problems
  • Infinite CSPs, and logic and algebraic methods for infinite CSPs
  • Expressiveness and equivalence of logic formulas over algebras and relational structures
  • Algorithms and complexity in universal algebra
  • Algebraic models for automata and language theory

Survey talks, preliminary results, developments of published results, and work in progress are welcome. Prospective speakers are invited to submit a 1–2 pages abstract which provides sufficient detail to allow the program committee to assess the merits of the proposal. Abstracts should be submitted to Mikhail.Volkov()

Invited speakers:


Important Dates:

  • Submission: 15 March 2011
  • Notification: 30 March 2011
  • Workshop: 12–13 June 2011
Sunday, June 12
10:00–11:00Marcel Jackson. Some semigroup ideas for program logic
11:15–12:15Andrei Bulatov. Counting problems and clones of functions
12:30–13:30Catarina Carvalho. Trees of bounded width
15:00–16:00Arseny Shur. Matrix theory and growth of formal languages
16:15–17:15Marcel Jackson. Finitely related algebras