IFIP WG 1.10: String Algorithmics & Applications


IFIP Working Group 1.10 is one of the ten working groups of the Technical Committee 1 of the International Federation for Information Processing (IFIP). IFIP, the leading multinational and apolitical organization in Information & Communications Technologies and Sciences, represents IT Societies from 56 countries or regions, covering all 5 continents with a total membership of over half a million.

Aims and Scope

The Working Group has been founded in 2015 with the main aim to focus in String Algorithmics (combinatorics on words, string algorithms) and applications. It proposes a unique forum for the best available research that will provide sustained inspiration within the stringological community for still better research. We intend to take advantage of the applied nature of a very theoretical topic to encourage both theory and practice in the group. At both ends our main concern is to promote relevant research of the very highest quality.

The scope for such a group is paradoxically both well-focussed and broad: well-focussed because the underlying combinatorial object is text, a simple word, a piece of string; broad because of the numerous applications (combinatorics on words, finite automata), but also algorithms on strings, and so the application areas for those algorithms, of which a partial list follows:


Committee members




Jan Holub
Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Thákurova 2700/9, 160 00 Prague 6, Czech Republic

phone: (+420) 224 359 814, (+420) 224 359 876 (secretary)
fax: (+420) 224 353 600
e-mail: Jan.Holub@fit.cvut.cz



Previous Chairs and Secretaries