Search the dblp DataBase
Pavol Duris :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Pavol Duris , Juraj Hromkovic , Katsushi Inoue A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2000, pp:214-228 [Conf ] Pavol Duris , Pavel Pudlák On the Communication Complexity of Planarity. [Citation Graph (0, 0)][DBLP ] FCT, 1989, pp:145-147 [Conf ] Pavol Duris , Zvi Galil A Time-Space Tradeoff for Language Recognition [Citation Graph (0, 0)][DBLP ] FOCS, 1981, pp:53-57 [Conf ] Pavol Duris , Zvi Galil Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1987, pp:326-330 [Conf ] Pavol Duris , Zvi Galil On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. [Citation Graph (0, 0)][DBLP ] ICALP, 1982, pp:166-175 [Conf ] Pavol Duris , Zvi Galil On the Power of Multiple Reads in a Chip. [Citation Graph (0, 0)][DBLP ] ICALP, 1991, pp:697-706 [Conf ] Pavol Duris , Zvi Galil Sensing Versus Nonsensing Automata. [Citation Graph (0, 0)][DBLP ] ICALP, 1995, pp:455-463 [Conf ] Pavol Duris , Juraj Hromkovic Multihead Finite State Automata and Concatenation. [Citation Graph (0, 0)][DBLP ] ICALP, 1982, pp:176-186 [Conf ] Pavol Duris , Tomasz Jurdzinski , Miroslaw Kutylowski , Krzysztof Lorys Power of Cooperation and Multihead Finite Systems. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:896-907 [Conf ] Pavol Duris , Ján Manuch On the Computational Complexity of Infinite Words. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:328-337 [Conf ] Pavol Duris , José D. P. Rolim E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. [Citation Graph (0, 0)][DBLP ] MFCS, 1994, pp:38-51 [Conf ] Pavol Duris , Juraj Hromkovic , Stasys Jukna , Martin Sauerhoff , Georg Schnitger On Multipartition Communication Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:206-217 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] STACS, 1997, pp:117-128 [Conf ] Pavol Duris , José D. P. Rolim Optimal Lower Bounds on the Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 1995, pp:350-360 [Conf ] Pavol Duris , Zvi Galil Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1981, pp:177-188 [Conf ] Pavol Duris , Zvi Galil Two Tapes are Better than One for Nondeterministic Machines [Citation Graph (0, 0)][DBLP ] STOC, 1982, pp:1-7 [Conf ] Pavol Duris , Zvi Galil , Wolfgang J. Paul , Rüdiger Reischuk Two Nonlinear Lower Bounds [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:127-132 [Conf ] Pavol Duris , Zvi Galil , Georg Schnitger Lower Bounds on Communication Complexity [Citation Graph (0, 0)][DBLP ] STOC, 1984, pp:81-91 [Conf ] Pavol Duris , Ondrej Sýkora , Clark D. Thompson , Imrich Vrto A Minimum-Area Circuit for l-Selection. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1987, v:2, n:, pp:251-265 [Journal ] Pavol Duris , Juraj Hromkovic , Katsushi Inoue A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:27, pp:- [Journal ] Pavol Duris , Juraj Hromkovic , Stasys Jukna , Martin Sauerhoff , Georg Schnitger On Multipartition Communication Complexity [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:066, pp:- [Journal ] 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 [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:29, pp:- [Journal ] Pavol Duris Multiparty communication complexity and very hard functions. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2004, v:192, n:1, pp:1-14 [Journal ] Pavol Duris , Zvi Galil On the Power of Multiple Reads in a Chip [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1993, v:104, n:2, pp:277-287 [Journal ] Pavol Duris , Zvi Galil , Wolfgang J. Paul , Rüdiger Reischuk Two Nonlinear Lower Bounds for On-Line Computations [Citation Graph (0, 0)][DBLP ] Information and Control, 1984, v:60, n:1-3, pp:1-11 [Journal ] Pavol Duris , Zvi Galil , Georg Schnitger Lower Bounds on Communication Complexity [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1987, v:73, n:1, pp:1-22 [Journal ] Pavol Duris , Juraj Hromkovic , Stasys Jukna , Martin Sauerhoff , Georg Schnitger On multi-partition communication complexity. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2004, v:194, n:1, pp:49-75 [Journal ] Pavol Duris , Zvi Galil On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store [Citation Graph (0, 0)][DBLP ] Information and Control, 1982, v:54, n:3, pp:217-227 [Journal ] Pavol Duris , José D. P. Rolim Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 1994, v:5, n:3/4, pp:319-328 [Journal ] Pavol Duris , Ondrej Sýkora , Imrich Vrto , Clark D. Thompson Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:21, n:5, pp:245-247 [Journal ] Pavol Duris , Imrich Vrto Semelectivity is not Sufficient. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:3, pp:137-141 [Journal ] Pavol Duris , Zvi Galil Two Lower Bounds in Asynchronous Distributed Computation. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1991, v:42, n:3, pp:254-266 [Journal ] Pavol Duris , Juraj Hromkovic , Katsushi Inoue On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2004, v:68, n:3, pp:675-699 [Journal ] Pavol Duris , José D. P. Rolim Lower Bounds on the Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1998, v:56, n:1, pp:90-95 [Journal ] Pavol Duris , Zvi Galil A Time-Space Tradeoff for Language Recognition. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1984, v:17, n:1, pp:3-12 [Journal ] Pavol Duris , Zvi Galil Two Tapes are Better than One for Nondeterministic Machines. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:2, pp:219-227 [Journal ] Pavol Duris , Ján Manuch On the computational complexity of infinite words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:, pp:141-151 [Journal ] Pavol Duris , Zvi Galil Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1982, v:21, n:, pp:39-53 [Journal ] Pavol Duris , Juraj Hromkovic One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1983, v:27, n:, pp:121-125 [Journal ] Pavol Duris , José D. P. Rolim A Note on the Density of Oracle Decreasing Time-Space Complexity. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:132, n:2, pp:435-444 [Journal ] Search in 0.003secs, Finished in 0.327secs