- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| i6 |      | Pavol Duris: A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite Automata. Electronic Colloquium on Computational Complexity (ECCC) 19: 92 (2012) |
| 2011 | ||
| i5 | | Pavol Duris, Marek Kosta: Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable. Electronic Colloquium on Computational Complexity (ECCC) 18: 34 (2011) |
| i4 | | Pavol Duris: On Computational Power of Partially Blind Automata. Electronic Colloquium on Computational Complexity (ECCC) 18: 107 (2011) |
| 2004 | ||
| j19 | | Pavol Duris: Multiparty communication complexity and very hard functions. Inf. Comput. 192(1): 1-14 (2004) |
| j18 | | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004) |
| j17 | | 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 | ||
| j16 | | Pavol Duris, Ján Manuch: On the computational complexity of infinite words. Theor. Comput. Sci. 295: 141-151 (2003) |
| 2001 | ||
| c18 | | |
| 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. Electronic Colloquium on Computational Complexity (ECCC) 8(066) (2001) |
| 2000 | ||
| c16 | | Pavol Duris, Juraj Hromkovic, Katsushi Inoue: A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. IEEE Conference on Computational Complexity 2000: 214-228 |
| i2 | | Pavol Duris, Juraj Hromkovic, Katsushi Inoue: A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. Electronic Colloquium on Computational Complexity (ECCC) 7(27) (2000) |
| 1998 | ||
| j15 | | 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. Electronic Colloquium on Computational Complexity (ECCC) 4(29) (1997) |
| 1995 | ||
| c13 | | |
| c12 | | Pavol Duris, José D. P. Rolim: Optimal Lower Bounds on the Multiparty Communication Complexity. STACS 1995: 350-360 |
| 1994 | ||
| j14 | | 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) |
| j13 | | 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 | ||
| j12 | | Pavol Duris, Zvi Galil: On the Power of Multiple Reads in a Chip. Inf. Comput. 104(2): 277-287 (1993) |
| 1991 | ||
| j11 | | Pavol Duris, Imrich Vrto: Semelectivity is not Sufficient. Inf. Process. Lett. 37(3): 137-141 (1991) |
| j10 | | Pavol Duris, Zvi Galil: Two Lower Bounds in Asynchronous Distributed Computation. J. Comput. Syst. Sci. 42(3): 254-266 (1991) |
| c10 | | |
| 1989 | ||
| c9 |  | |
| 1987 | ||
| j9 | | Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto: A Minimum-Area Circuit for l-Selection. Algorithmica 2: 251-265 (1987) |
| j8 | | Pavol Duris, Zvi Galil, Georg Schnitger: Lower Bounds on Communication Complexity. Inf. Comput. 73(1): 1-22 (1987) |
| c8 | | |
| 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. Information and Control 60(1-3): 1-11 (1984) |
| j5 | | Pavol Duris, Zvi Galil: A Time-Space Tradeoff for Language Recognition. Mathematical Systems 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 | | |
| 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. Information and 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 | | |
| 1981 | ||
| c2 | | |
| c1 | | |
Data released under the ODC-BY 1.0 license — See also our legal information page