Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) - Pavol Duris; Zvi Galil (STOC, 1981)

On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. - Pavol Duris; Zvi Galil (ICALP, 1982)

Multihead Finite State Automata and Concatenation. - Pavol Duris; Juraj Hromkovic (ICALP, 1982)

Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. - Pavol Duris; Zvi Galil (Theor. Comput. Sci., 1982)

On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store - Pavol Duris; Zvi Galil (Inf. Control., 1982)

Two Nonlinear Lower Bounds - Pavol Duris; Zvi Galil; Wolfgang J. Paul; Rüdiger Reischuk (STOC, 1983)

One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. - Pavol Duris; Juraj Hromkovic (Theor. Comput. Sci., 1983)

Two Nonlinear Lower Bounds for On-Line Computations - Pavol Duris; Zvi Galil; Wolfgang J. Paul; Rüdiger Reischuk (Inf. Control., 1984)

A Time-Space Tradeoff for Language Recognition. - Pavol Duris; Zvi Galil (Math. Syst. Theory, 1984)

Two Tapes are Better than One for Nondeterministic Machines. - Pavol Duris; Zvi Galil (SIAM J. Comput., 1984)

Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. - Pavol Duris; Ondrej Sýkora; Imrich Vrto; Clark D. Thompson (Inf. Process. Lett., 1985)

Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) - Pavol Duris; Zvi Galil (FOCS, 1987)

A Minimum-Area Circuit for l-Selection. - Pavol Duris; Ondrej Sýkora; Clark D. Thompson; Imrich Vrto (Algorithmica, 1987)

Zerotesting bounded one-way multicounter machines. - Pavol Duris; Juraj Hromkovic (Kybernetika, 1987)

Lower Bounds on Communication Complexity - Pavol Duris; Zvi Galil; Georg Schnitger (Inf. Comput., 1987)

On the Communication Complexity of Planarity. - Pavol Duris; Pavel Pudlák (FCT, 1989)

Semelectivity is not Sufficient. - Pavol Duris; Imrich Vrto (Inf. Process. Lett., 1991)

Two Lower Bounds in Asynchronous Distributed Computation. - Pavol Duris; Zvi Galil (J. Comput. Syst. Sci., 1991)

On the Power of Multiple Reads in a Chip - Pavol Duris; Zvi Galil (Inf. Comput., 1993)

E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. - Pavol Duris; José D. P. Rolim (MFCS, 1994)

Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. - Pavol Duris; José D. P. Rolim (Int. J. Found. Comput. Sci., 1994)

A Note on the Density of Oracle Decreasing Time-Space Complexity. - Pavol Duris; José D. P. Rolim (Theor. Comput. Sci., 1994)

Sensing Versus Nonsensing Automata. - Pavol Duris; Zvi Galil (ICALP, 1995)

Optimal Lower Bounds on the Multiparty Communication Complexity. - Pavol Duris; José D. P. Rolim (STACS, 1995)

Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. - Pavol Duris; Juraj Hromkovic; José D. P. Rolim; Georg Schnitger (STACS, 1997)

On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations - Pavol Duris; Juraj Hromkovic; José D. P. Rolim; Georg Schnitger (Electron. Colloquium Comput. Complex., 1997)

Power of Cooperation and Multihead Finite Systems. - Pavol Duris; Tomasz Jurdzinski; Miroslaw Kutylowski; Krzysztof Lorys (ICALP, 1998)

Lower Bounds on the Multiparty Communication Complexity. - Pavol Duris; José D. P. Rolim (J. Comput. Syst. Sci., 1998)

A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition - Pavol Duris; Juraj Hromkovic; Katsushi Inoue (Electron. Colloquium Comput. Complex., 2000)

On Multipartition Communication Complexity - Pavol Duris; Juraj Hromkovic; Stasys Jukna; Martin Sauerhoff; Georg Schnitger (Electron. Colloquium Comput. Complex., 2001)

On the computational complexity of infinite words. - Pavol Duris; Ján Manuch (Theor. Comput. Sci., 2003)

Multiparty communication complexity and very hard functions. - Pavol Duris (Inf. Comput., 2004)

On multi-partition communication complexity. - Pavol Duris; Juraj Hromkovic; Stasys Jukna; Martin Sauerhoff; Georg Schnitger (Inf. Comput., 2004)

On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. - Pavol Duris; Juraj Hromkovic; Katsushi Inoue (J. Comput. Syst. Sci., 2004)

Flip-pushdown automata: nondeterministic ε-moves can be removed. - Pavol Duris; Marek Kosta (ITAT, 2011)

On Computational Power of Partially Blind Automata. - Pavol Duris (Electron. Colloquium Comput. Complex., 2011)

A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite Automata. - Pavol Duris (Electron. Colloquium Comput. Complex., 2012)

Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable. - Pavol Duris; Marek Kosta (Inf. Process. Lett., 2014)

Determinism and Nondeterminism in Finite Automata with Advice. - Pavol Duris; Rafael Korbas; Rastislav Královic; Richard Královic (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Randomization in Non-Uniform Finite Automata. - Pavol Duris; Rastislav Královic; Richard Královic; Dana Pardubská; Martin Pasen; Peter Rossmanith (MFCS, 2020)

Tight hierarchy of data-independent multi-head automata. - Pavol Duris; Rastislav Královic; Dana Pardubská (J. Comput. Syst. Sci., 2020)