Quicksort Without a Stack. - Branislav Durian (MFCS, 1986)

Towards an Efficient Merging. - S. Dvorák; Branislav Durian (MFCS, 1986)

Stable Linear Time Sublinear Space Merging. - S. Dvorák; Branislav Durian (Comput. J., 1987)

Merging by Decomposition Revisited. - S. Dvorák; Branislav Durian (Comput. J., 1988)

Unstable Linear Time O(1) Space Merging. - S. Dvorák; Branislav Durian (Comput. J., 1988)

Decomposition Merging with Symmetric Exchanges. - S. Dvorák; Branislav Durian (Comput. J., 1991)

Tuning BNDM with q-Grams. - Branislav Durian; Jan Holub 001; Hannu Peltola; Jorma Tarhio (ALENEX, 2009)

Bit-Parallel Search Algorithms for Long Patterns. - Branislav Durian; Hannu Peltola; Leena Salmela; Jorma Tarhio (SEA, 2010)

Improving practical exact string matching. - Branislav Durian; Jan Holub 001; Hannu Peltola; Jorma Tarhio (Inf. Process. Lett., 2010)

Improved Two-Way Bit-parallel Search. - Branislav Durian; Tamanna Chhabra; Sukhpal Singh Ghuman; Tommi Hirvola; Hannu Peltola; Jorma Tarhio (Stringology, 2014)