Čulík K.

On equivalent and similar grammars of ALGOL-like languages. 5:2 (1964), pp. 93 -- 95.

Jansen K.

Exploiting the structure of conflict graphs in high level synthesis. 35:1 (1994), pp. 155 -- 167.

Matoušek J., Nešetřil J., Thomas R.

On polynomial time decidability of induced-minor-closed classes. 29:4 (1988), pp. 703 -- 710.

Matula M.

Zur Frage der Häufigkeitsverteilung der Worte, I. 6:2 (1965), pp. 213 -- 237.

Mezník I.

On some closure properties of generable languages. 14:3 (1973), pp. 541 -- 552.

Poljak S.

A note on stable sets and colorings of graphs. 15:2 (1974), pp. 307 -- 309.

Poljak S., Turzík D., Pudlák P.

Extensions of $k$-subsets to $k+1$-subsets -- existence versus constructability. 23:2 (1982), pp. 337 -- 349.

Úlehla J.

On racial insufficiency: White messengers cannot simulate coloured ones. 26:2 (1985), pp. 323 -- 325.

Žák S.

A Turing machine oracle hierarchy, I. 21:1 (1980), pp. 11 -- 26.

Žák S.

A Turing machine oracle hierarchy, II. 21:1 (1980), pp. 27 -- 39.