Pavol Duris - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 49 from 49

2020

Tight hierarchy of data-independent multi-head automataPavol Duris, Rastislav Královic, Dana Pardubská. jcss, 114:126-136, 2020. [doi]

Randomization in Non-Uniform Finite AutomataPavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith. mfcs 2020: [doi]

2018

Determinism and Nondeterminism in Finite Automata with AdvicePavol Duris, Rafael Korbas, Rastislav Královic, Richard Královic. BIRTHDAY 2018: 3-16 [doi]

2014

Flip-pushdown automata with k pushdown reversals and E0L systems are incomparablePavol Duris, Marek Kosta. ipl, 114(8):417-420, 2014. [doi]

2012

A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite AutomataPavol Duris. eccc, 19:92, 2012. [doi]

2011

On Computational Power of Partially Blind AutomataPavol Duris. eccc, 18:107, 2011. [doi]

Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are IncomparablePavol Duris, Marek Kosta. eccc, 18:34, 2011. [doi]

Flip-pushdown automata: nondeterministic $\epsilon$-moves can be removedPavol Duris, Marek Kosta. dimacs 2011: 15-22 [doi]

2004

Multiparty communication complexity and very hard functionsPavol Duris. iandc, 192(1):1-14, 2004. [doi]

On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automataPavol Duris, Juraj Hromkovic, Katsushi Inoue. jcss, 68(3):675-699, 2004. [doi]

On multi-partition communication complexityPavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger. iandc, 194(1):49-75, 2004. [doi]

2003

On the computational complexity of infinite wordsPavol Duris, Ján Manuch. TCS, 295:141-151, 2003. [doi]

2001

2000

A Separation of Determinism, Las Vegas and Nondeterminism for Picture RecognitionPavol Duris, Juraj Hromkovic, Katsushi Inoue. coco 2000: 214-228 [doi]

A Separation of Determinism, Las Vegas and Nondeterminism for Picture RecognitionPavol Duris, Juraj Hromkovic, Katsushi Inoue. eccc, 7(27), 2000. [doi]

1998

Lower Bounds on the Multiparty Communication ComplexityPavol Duris, José D. P. Rolim. jcss, 56(1):90-95, 1998.

Power of Cooperation and Multihead Finite SystemsPavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys. icalp 1998: 896-907 [doi]

1997

Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time ComputationsPavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger. STACS 1997: 117-128

On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time ComputationsPavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger. eccc, 4(29), 1997. [doi]

1995

Sensing Versus Nonsensing AutomataPavol Duris, Zvi Galil. icalp 1995: 455-463

Optimal Lower Bounds on the Multiparty Communication ComplexityPavol Duris, José D. P. Rolim. STACS 1995: 350-360

1994

A Note on the Density of Oracle Decreasing Time-Space ComplexityPavol Duris, José D. P. Rolim. TCS, 132(2):435-444, 1994.

E-Complete Sets Do Not Have Optimal Polynomial Time ApproximationsPavol Duris, José D. P. Rolim. mfcs 1994: 38-51

Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets RevisitedPavol Duris, José D. P. Rolim. ijfcs, 5(3/4):319-328, 1994.

1993

On the Power of Multiple Reads in a ChipPavol Duris, Zvi Galil. iandc, 104(2):277-287, June 1993.

1991

Two Lower Bounds in Asynchronous Distributed ComputationPavol Duris, Zvi Galil. jcss, 42(3):254-266, 1991.

On the Power of Multiple Reads in a ChipPavol Duris, Zvi Galil. icalp 1991: 697-706

Semelectivity is not SufficientPavol Duris, Imrich Vrto. ipl, 37(3):137-141, 1991.

1989

On the Communication Complexity of PlanarityPavol Duris, Pavel Pudlák. fct 1989: 145-147

1987

Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version)Pavol Duris, Zvi Galil. focs 1987: 326-330

A Minimum-Area Circuit for l-SelectionPavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto. algorithmica, 2:251-265, 1987.

Lower Bounds on Communication ComplexityPavol Duris, Zvi Galil, Georg Schnitger. iandc, 73(1):1-22, April 1987.

Zerotesting bounded one-way multicounter machinesPavol Duris, Juraj Hromkovic. kybernetika, 23(1):13-18, 1987. [doi]

1985

Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard TransformationsPavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson. ipl, 21(5):245-247, 1985.

1984

Lower Bounds on Communication ComplexityPavol Duris, Zvi Galil, Georg Schnitger. stoc 1984: 81-91

A Time-Space Tradeoff for Language RecognitionPavol Duris, Zvi Galil. mst, 17(1):3-12, 1984.

Two Tapes are Better than One for Nondeterministic MachinesPavol Duris, Zvi Galil. SICOMP, 13(2):219-227, 1984.

Two Nonlinear Lower Bounds for On-Line ComputationsPavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk. iandc, 60(1-3):1-11, January/February/March 1984.

1983

Two Nonlinear Lower BoundsPavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk. stoc 1983: 127-132

One-Way Simple Multihead Finite Automata are not Closed Under ConcatenationPavol Duris, Juraj Hromkovic. TCS, 27:121-125, 1983.

1982

1981

A Time-Space Tradeoff for Language RecognitionPavol Duris, Zvi Galil. focs 1981: 53-57

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: 177-188

Sign in or sign up to see more results.

runs on WebDSL