default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavol Duris
Person information
- unicode name: Pavol Ďuriš
- affiliation: Comenius University in Bratislava, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j22]Pavol Duris, Rastislav Královic
, Dana Pardubská:
Tight hierarchy of data-independent multi-head automata. J. Comput. Syst. Sci. 114: 126-136 (2020)- [c21]Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith:
Randomization in Non-Uniform Finite Automata. MFCS 2020: 30:1-30:13
2010 – 2019
- 2018
- [c20]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: 3-16 - 2014
- [j21]Pavol Duris, Marek Kosta:
Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable. Inf. Process. Lett. 114(8): 417-420 (2014) - 2012
- [i6]Pavol Duris:
A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite Automata. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c19]Pavol Duris, Marek Kosta:
Flip-pushdown automata: nondeterministic ε-moves can be removed. ITAT 2011: 15-22 - [i5]Pavol Duris:
On Computational Power of Partially Blind Automata. Electron. Colloquium Comput. Complex. TR11 (2011) - [i4]Pavol Duris, Marek Kosta:
Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable. Electron. Colloquium Comput. Complex. TR11 (2011)
2000 – 2009
- 2004
- [j20]Pavol Duris:
Multiparty communication complexity and very hard functions. Inf. Comput. 192(1): 1-14 (2004) - [j19]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004) - [j18]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): 675-699 (2004) - 2003
- [j17]Pavol Duris, Ján Manuch:
On the computational complexity of infinite words. Theor. Comput. Sci. 295: 141-151 (2003) - 2001
- [c18]Pavol Duris, Ján Manuch:
On the Computational Complexity of Infinite Words. MFCS 2001: 328-337 - [c17]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On Multipartition Communication Complexity. STACS 2001: 206-217 - [i3]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On Multipartition Communication Complexity. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c16]Pavol Duris, Juraj Hromkovic, Katsushi Inoue:
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. CCC 2000: 214-228 - [i2]Pavol Duris, Juraj Hromkovic, Katsushi Inoue:
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1998
- [j16]Pavol Duris, José D. P. Rolim:
Lower Bounds on the Multiparty Communication Complexity. J. Comput. Syst. Sci. 56(1): 90-95 (1998) - [c15]Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys:
Power of Cooperation and Multihead Finite Systems. ICALP 1998: 896-907 - 1997
- [c14]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: 117-128 - [i1]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. TR97 (1997) - 1995
- [c13]Pavol Duris, Zvi Galil:
Sensing Versus Nonsensing Automata. ICALP 1995: 455-463 - [c12]Pavol Duris, José D. P. Rolim:
Optimal Lower Bounds on the Multiparty Communication Complexity. STACS 1995: 350-360 - 1994
- [j15]Pavol Duris, José D. P. Rolim:
Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. Int. J. Found. Comput. Sci. 5(3/4): 319-328 (1994) - [j14]Pavol Duris, José D. P. Rolim:
A Note on the Density of Oracle Decreasing Time-Space Complexity. Theor. Comput. Sci. 132(2): 435-444 (1994) - [c11]Pavol Duris, José D. P. Rolim:
E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. MFCS 1994: 38-51 - 1993
- [j13]Pavol Duris, Zvi Galil:
On the Power of Multiple Reads in a Chip. Inf. Comput. 104(2): 277-287 (1993) - 1991
- [j12]Pavol Duris, Imrich Vrto:
Semelectivity is not Sufficient. Inf. Process. Lett. 37(3): 137-141 (1991) - [j11]Pavol Duris, Zvi Galil:
Two Lower Bounds in Asynchronous Distributed Computation. J. Comput. Syst. Sci. 42(3): 254-266 (1991) - [c10]Pavol Duris, Zvi Galil:
On the Power of Multiple Reads in a Chip. ICALP 1991: 697-706
1980 – 1989
- 1989
- [c9]Pavol Duris, Pavel Pudlák:
On the Communication Complexity of Planarity. FCT 1989: 145-147 - 1987
- [j10]Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto:
A Minimum-Area Circuit for l-Selection. Algorithmica 2: 251-265 (1987) - [j9]Pavol Duris, Zvi Galil, Georg Schnitger:
Lower Bounds on Communication Complexity. Inf. Comput. 73(1): 1-22 (1987) - [j8]Pavol Duris, Juraj Hromkovic:
Zerotesting bounded one-way multicounter machines. Kybernetika 23(1): 13-18 (1987) - [c8]Pavol Duris, Zvi Galil:
Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version). FOCS 1987: 326-330 - 1985
- [j7]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): 245-247 (1985) - 1984
- [j6]Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk:
Two Nonlinear Lower Bounds for On-Line Computations. Inf. Control. 60(1-3): 1-11 (1984) - [j5]Pavol Duris, Zvi Galil:
A Time-Space Tradeoff for Language Recognition. Math. Syst. Theory 17(1): 3-12 (1984) - [j4]Pavol Duris, Zvi Galil:
Two Tapes are Better than One for Nondeterministic Machines. SIAM J. Comput. 13(2): 219-227 (1984) - [c7]Pavol Duris, Zvi Galil, Georg Schnitger:
Lower Bounds on Communication Complexity. STOC 1984: 81-91 - 1983
- [j3]Pavol Duris, Juraj Hromkovic:
One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. Theor. Comput. Sci. 27: 121-125 (1983) - [c6]Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk:
Two Nonlinear Lower Bounds. STOC 1983: 127-132 - 1982
- [j2]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): 217-227 (1982) - [j1]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: 39-53 (1982) - [c5]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: 166-175 - [c4]Pavol Duris, Juraj Hromkovic:
Multihead Finite State Automata and Concatenation. ICALP 1982: 176-186 - [c3]Pavol Duris, Zvi Galil:
Two Tapes are Better than One for Nondeterministic Machines. STOC 1982: 1-7 - 1981
- [c2]Pavol Duris, Zvi Galil:
A Time-Space Tradeoff for Language Recognition. FOCS 1981: 53-57 - [c1]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: 177-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
