|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pavol Duris |
On Computational Power of Partially Blind Automata.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pavol Duris, Marek Kosta |
Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On multi-partition communication complexity. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris |
Multiparty communication complexity and very hard functions. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Katsushi Inoue |
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Ján Manuch |
On the computational complexity of infinite words. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On Multipartition Communication Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Pavol Duris, Ján Manuch |
On the Computational Complexity of Infinite Words. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On Multipartition Communication Complexity. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Katsushi Inoue |
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Katsushi Inoue |
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
Las Vegas randomization, two-dimensional finite automata, nondeterminism |
| 1 | Pavol Duris, José D. P. Rolim |
Lower Bounds on the Multiparty Communication Complexity. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys |
Power of Cooperation and Multihead Finite Systems. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
1997 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Las Vegas, communication complexity, automata, determinism, computational and structural complexity |
| 1 | Pavol Duris, Zvi Galil |
Sensing Versus Nonsensing Automata. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, José D. P. Rolim |
Optimal Lower Bounds on the Multiparty Communication Complexity. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, José D. P. Rolim |
A Note on the Density of Oracle Decreasing Time-Space Complexity. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, José D. P. Rolim |
Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. |
Int. J. Found. Comput. Sci. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Pavol Duris, José D. P. Rolim |
E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil |
On the Power of Multiple Reads in a Chip |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Imrich Vrto |
Semelectivity is not Sufficient. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil |
Two Lower Bounds in Asynchronous Distributed Computation. |
J. Comput. Syst. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil |
On the Power of Multiple Reads in a Chip. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Pavel Pudlák |
On the Communication Complexity of Planarity. |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto |
A Minimum-Area Circuit for l-Selection. |
Algorithmica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil, Georg Schnitger |
Lower Bounds on Communication Complexity |
Inf. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil |
Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) |
FOCS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk |
Two Nonlinear Lower Bounds for On-Line Computations |
Information and Control |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil |
A Time-Space Tradeoff for Language Recognition. |
Mathematical Systems Theory |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil |
Two Tapes are Better than One for Nondeterministic Machines. |
SIAM J. Comput. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil, Georg Schnitger |
Lower Bounds on Communication Complexity |
STOC |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic |
One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. |
Theor. Comput. Sci. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk |
Two Nonlinear Lower Bounds |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic |
Multihead Finite State Automata and Concatenation. |
ICALP |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil |
Two Tapes are Better than One for Nondeterministic Machines |
STOC |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil |
A Time-Space Tradeoff for Language Recognition |
FOCS |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")