dblp.uni-trier.dewww.uni-trier.de

Pavol Duris Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2004
40EEPavol Duris: Multiparty communication complexity and very hard functions. Inf. Comput. 192(1): 1-14 (2004)
39EEPavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004)
38EEPavol 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
37EEPavol Duris, Ján Manuch: On the computational complexity of infinite words. Theor. Comput. Sci. 295: 141-151 (2003)
2001
36EEPavol Duris, Ján Manuch: On the Computational Complexity of Infinite Words. MFCS 2001: 328-337
35EEPavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On Multipartition Communication Complexity. STACS 2001: 206-217
34EEPavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On Multipartition Communication Complexity Electronic Colloquium on Computational Complexity (ECCC) 8(066): (2001)
2000
33EEPavol Duris, Juraj Hromkovic, Katsushi Inoue: A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. IEEE Conference on Computational Complexity 2000: 214-228
32EEPavol 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
31EEPavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys: Power of Cooperation and Multihead Finite Systems. ICALP 1998: 896-907
30 Pavol Duris, José D. P. Rolim: Lower Bounds on the Multiparty Communication Complexity. J. Comput. Syst. Sci. 56(1): 90-95 (1998)
1997
29EEPavol 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
28EEPavol 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
27EEPavol Duris, Zvi Galil: Sensing Versus Nonsensing Automata. ICALP 1995: 455-463
26EEPavol Duris, José D. P. Rolim: Optimal Lower Bounds on the Multiparty Communication Complexity. STACS 1995: 350-360
1994
25EEPavol Duris, José D. P. Rolim: E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. MFCS 1994: 38-51
24 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)
23 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)
1993
22 Pavol Duris, Zvi Galil: On the Power of Multiple Reads in a Chip Inf. Comput. 104(2): 277-287 (1993)
1991
21EEPavol Duris, Zvi Galil: On the Power of Multiple Reads in a Chip. ICALP 1991: 697-706
20 Pavol Duris, Imrich Vrto: Semelectivity is not Sufficient. Inf. Process. Lett. 37(3): 137-141 (1991)
19 Pavol Duris, Zvi Galil: Two Lower Bounds in Asynchronous Distributed Computation. J. Comput. Syst. Sci. 42(3): 254-266 (1991)
1989
18 Pavol Duris, Pavel Pudlák: On the Communication Complexity of Planarity. FCT 1989: 145-147
1987
17 Pavol Duris, Zvi Galil: Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) FOCS 1987: 326-330
16 Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto: A Minimum-Area Circuit for l-Selection. Algorithmica 2: 251-265 (1987)
15 Pavol Duris, Zvi Galil, Georg Schnitger: Lower Bounds on Communication Complexity Inf. Comput. 73(1): 1-22 (1987)
1985
14 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
13 Pavol Duris, Zvi Galil, Georg Schnitger: Lower Bounds on Communication Complexity STOC 1984: 81-91
12 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)
11 Pavol Duris, Zvi Galil: A Time-Space Tradeoff for Language Recognition. Mathematical Systems Theory 17(1): 3-12 (1984)
10 Pavol Duris, Zvi Galil: Two Tapes are Better than One for Nondeterministic Machines. SIAM J. Comput. 13(2): 219-227 (1984)
1983
9 Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk: Two Nonlinear Lower Bounds STOC 1983: 127-132
8 Pavol Duris, Juraj Hromkovic: One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. Theor. Comput. Sci. 27: 121-125 (1983)
1982
7EEPavol 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
6EEPavol Duris, Juraj Hromkovic: Multihead Finite State Automata and Concatenation. ICALP 1982: 176-186
5 Pavol Duris, Zvi Galil: Two Tapes are Better than One for Nondeterministic Machines STOC 1982: 1-7
4 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)
3 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)
1981
2 Pavol Duris, Zvi Galil: A Time-Space Tradeoff for Language Recognition FOCS 1981: 53-57
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: 177-188

Coauthor Index

1Zvi Galil [1] [2] [3] [4] [5] [7] [9] [10] [11] [12] [13] [15] [17] [19] [21] [22] [27]
2Juraj Hromkovic [6] [8] [28] [29] [32] [33] [34] [35] [38] [39]
3Katsushi Inoue [32] [33] [38]
4Stasys Jukna [34] [35] [39]
5Tomasz Jurdzinski [31]
6Miroslaw Kutylowski [31]
7Krzysztof Lorys [31]
8Ján Manuch [36] [37]
9Wolfgang J. Paul [9] [12]
10Pavel Pudlák [18]
11Rüdiger Reischuk [9] [12]
12José D. P. Rolim [23] [24] [25] [26] [28] [29] [30]
13Martin Sauerhoff [34] [35] [39]
14Georg Schnitger [13] [15] [28] [29] [34] [35] [39]
15Ondrej Sýkora [14] [16]
16Clark D. Thomborson (Clark D. Thompson) [14] [16]
17Imrich Vrto [14] [16] [20]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)