Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="{\v{D}}uri{\v{s}}, Pavol"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flip-pushdown automata with
k
pushdown reversals and E0L systems are incomparable
Pavol D̑uris̑
,
Marek Kos̑ta
Information Processing Letters
114
(8), 2014, pp. 417-420
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Pavol D̑uris̑
,
Juraj Hromkovic̑
,
Katsushi Inoue
Journal of Computer and System Sciences
68
(3), 2004, pp. 675-699
On multi-partition communication complexity
Pavol D̑uris̑
,
Juraj Hromkovic̑
,
Stasys Jukna
,
Martin Sauerhoff
,
Georg Schnitger
Information and Computation
194
(1), 2004, pp. 49-75
Multiparty communication complexity and very hard functions
Pavol D̑uris̑
Information and Computation
192
(1), 2004, pp. 1-14
On the computational complexity of infinite words
Pavol D̑uris̑
,
Ján Man̑uch
Theoretical Computer Science
295
(1-3), 2003, pp. 141-151
On multipartition communication complexity
Pavol D̑uris̑
,
Juraj Hromkovic̑
,
Stasys Jukna
,
Martin Sauerhoff
,
Georg Schnitger
Lecture Notes in Computer Science
2010
, 2001, pp. 206-217
A separation of determinism, Las Vegas and nondeterminism for picture recognition
Pavol D̑uris̑
,
Juraj Hromkovic̑
,
Katsushi Inoue
Proceedings of the 15th Annual IEEE Conference on Computational Complexity (Florence, Italy, July 4-7, 2000)
, 2000, pp. 214-228
Power of cooperation and multihead finite systems
Pavol D̑uris̑
,
Tomasz Jurdziński
,
Mirosƚaw Kutyƚowski
,
Krzysztof Loryś
Lecture Notes in Computer Science
1443
, 1998, pp. 896-907
Lower bounds on the multiparty communication complexity
Pavol D̑uris̑
,
José D.P. Rolim
Journal of Computer and System Sciences
56
(1), 1998, pp. 90-95
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
Pavol D̑uris̑
,
Juraj Hromkovic̑
,
José D.P. Rolim
,
Georg Schnitger
Lecture Notes in Computer Science
1200
, 1997, pp. 117-128
Sensing versus nonsensing automata
Pavol D̑uris̑
,
Zvi Galil
Lecture Notes in Computer Science
944
, 1995, pp. 455-463
Conjunctive and disjunctive reducibilities to sparse and tally sets revisited
Pavol D̑uris̑
,
José D.P. Rolim
International Journal of Foundations of Computer Science
5
(3-4), 1994, pp. 319-328
E-complete sets do not have optimal polynomial time approximations
Pavol D̑uris̑
,
José D.P. Rolim
Lecture Notes in Computer Science
841
, 1994, pp. 38-51
A minimum-area circuit for
l
-selection
Pavol D̑uris̑
,
Ondrej Sýkora
,
Clark D. Thompson
,
Imrich Vrt́o
Algorithmica
2
, 1987, pp. 251-265