Pavol Duris

Publication Activity (10 Years)

Years Active: 1981-2020
Publications (10 Years): 3

Top Topics

Regular Expressions

Probability Function

Finite Automata

Statistical Analysis

Top Venues

J. Comput. Syst. Sci.

Adventures Between Lower Bounds and Higher Altitudes

Inf. Process. Lett.

Electron. Colloquium Comput. Complex.

Publications

Pavol Duris, Rastislav Královic, Dana Pardubská
Tight hierarchy of data-independent multi-head automata. J. Comput. Syst. Sci. 114 (2020)
Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith
Randomization in Non-Uniform Finite Automata. MFCS (2020)
Pavol Duris, Rafael Korbas, Rastislav Královic, Richard Královic
Determinism and Nondeterminism in Finite Automata with Advice. Adventures Between Lower Bounds and Higher Altitudes (2018)
Pavol Duris, Marek Kosta
Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable. Inf. Process. Lett. 114 (8) (2014)
Pavol Duris
A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite Automata. Electron. Colloquium Comput. Complex. 19 (2012)
Pavol Duris, Marek Kosta
Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable. Electron. Colloquium Comput. Complex. 18 (2011)
Pavol Duris
On Computational Power of Partially Blind Automata. Electron. Colloquium Comput. Complex. 18 (2011)
Pavol Duris, Marek Kosta
Flip-pushdown automata: nondeterministic ε-moves can be removed. ITAT (2011)
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
On multi-partition communication complexity. Inf. Comput. 194 (1) (2004)
Pavol Duris, Juraj Hromkovic, Katsushi Inoue
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. J. Comput. Syst. Sci. 68 (3) (2004)
Pavol Duris
Multiparty communication complexity and very hard functions. Inf. Comput. 192 (1) (2004)
Pavol Duris, Ján Manuch
On the computational complexity of infinite words. Theor. Comput. Sci. 295 (2003)
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
On Multipartition Communication Complexity. STACS (2001)
Pavol Duris, Ján Manuch
On the Computational Complexity of Infinite Words. MFCS (2001)
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
On Multipartition Communication Complexity Electron. Colloquium Comput. Complex. 8 (066) (2001)
Pavol Duris, Juraj Hromkovic, Katsushi Inoue
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition Electron. Colloquium Comput. Complex. 7 (27) (2000)
Pavol Duris, Juraj Hromkovic, Katsushi Inoue
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. Computational Complexity Conference (2000)
Pavol Duris, José D. P. Rolim
Lower Bounds on the Multiparty Communication Complexity. J. Comput. Syst. Sci. 56 (1) (1998)
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys
Power of Cooperation and Multihead Finite Systems. ICALP (1998)
Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger
On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations Electron. Colloquium Comput. Complex. 4 (29) (1997)
Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. STACS (1997)
Pavol Duris, Zvi Galil
Sensing Versus Nonsensing Automata. ICALP (1995)
Pavol Duris, José D. P. Rolim
Optimal Lower Bounds on the Multiparty Communication Complexity. STACS (1995)
Pavol Duris, José D. P. Rolim
E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. MFCS (1994)
Pavol Duris, José D. P. Rolim
A Note on the Density of Oracle Decreasing Time-Space Complexity. Theor. Comput. Sci. 132 (2) (1994)
Pavol Duris, José D. P. Rolim
Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. Int. J. Found. Comput. Sci. 5 (3/4) (1994)
Pavol Duris, Zvi Galil
On the Power of Multiple Reads in a Chip Inf. Comput. 104 (2) (1993)
Pavol Duris, Zvi Galil
Two Lower Bounds in Asynchronous Distributed Computation. J. Comput. Syst. Sci. 42 (3) (1991)
Pavol Duris, Zvi Galil
On the Power of Multiple Reads in a Chip. ICALP (1991)
Pavol Duris, Imrich Vrto
Semelectivity is not Sufficient. Inf. Process. Lett. 37 (3) (1991)
Pavol Duris, Pavel Pudlák
On the Communication Complexity of Planarity. FCT (1989)
Pavol Duris, Juraj Hromkovic
Zerotesting bounded one-way multicounter machines. Kybernetika 23 (1) (1987)
Pavol Duris, Zvi Galil, Georg Schnitger
Lower Bounds on Communication Complexity Inf. Comput. 73 (1) (1987)
Pavol Duris, Zvi Galil
Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) FOCS (1987)
Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto
A Minimum-Area Circuit for l-Selection. Algorithmica 2 (1987)
Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson
Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. Inf. Process. Lett. 21 (5) (1985)
Pavol Duris, Zvi Galil
Two Tapes are Better than One for Nondeterministic Machines. SIAM J. Comput. 13 (2) (1984)
Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
Two Nonlinear Lower Bounds for On-Line Computations Inf. Control. 60 (1-3) (1984)
Pavol Duris, Zvi Galil, Georg Schnitger
Lower Bounds on Communication Complexity STOC (1984)
Pavol Duris, Zvi Galil
A Time-Space Tradeoff for Language Recognition. Math. Syst. Theory 17 (1) (1984)
Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
Two Nonlinear Lower Bounds STOC (1983)
Pavol Duris, Juraj Hromkovic
One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. Theor. Comput. Sci. 27 (1983)
Pavol Duris, Juraj Hromkovic
Multihead Finite State Automata and Concatenation. ICALP (1982)
Pavol Duris, Zvi Galil
Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. Theor. Comput. Sci. 21 (1982)
Pavol Duris, Zvi Galil
Two Tapes are Better than One for Nondeterministic Machines STOC (1982)
Pavol Duris, Zvi Galil
On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. ICALP (1982)
Pavol Duris, Zvi Galil
On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store Inf. Control. 54 (3) (1982)
Pavol Duris, Zvi Galil
A Time-Space Tradeoff for Language Recognition FOCS (1981)
Pavol Duris, Zvi Galil
Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) STOC (1981)