Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Pavol Duris
@article{DBLP:journals/jcss/DurisKP20,
author = {Pavol Duris and
Rastislav Kr{\'{a}}lovic and
Dana Pardubsk{\'{a}}},
title = {Tight hierarchy of data-independent multi-head automata},
journal = {J. Comput. Syst. Sci.},
volume = {114},
pages = {126--136},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2020.06.005},
doi = {10.1016/J.JCSS.2020.06.005},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DurisKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DurisKKPPR20,
author = {Pavol Duris and
Rastislav Kr{\'{a}}lovic and
Richard Kr{\'{a}}lovic and
Dana Pardubsk{\'{a}} and
Martin Pasen and
Peter Rossmanith},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Randomization in Non-Uniform Finite Automata},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {30:1--30:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.30},
doi = {10.4230/LIPICS.MFCS.2020.30},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DurisKKPPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/DurisKKK18,
author = {Pavol Duris and
Rafael Korbas and
Rastislav Kr{\'{a}}lovic and
Richard Kr{\'{a}}lovic},
editor = {Hans{-}Joachim B{\"{o}}ckenhauer and
Dennis Komm and
Walter Unger},
title = {Determinism and Nondeterminism in Finite Automata with Advice},
booktitle = {Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated
to Juraj Hromkovi{\v{c}} on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {11011},
pages = {3--16},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-98355-4\_1},
doi = {10.1007/978-3-319-98355-4\_1},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/DurisKKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DurisK14,
author = {Pavol Duris and
Marek Kosta},
title = {Flip-pushdown automata with k pushdown reversals and {E0L} systems
are incomparable},
journal = {Inf. Process. Lett.},
volume = {114},
number = {8},
pages = {417--420},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2014.03.003},
doi = {10.1016/J.IPL.2014.03.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DurisK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Duris12,
author = {Pavol Duris},
title = {A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite
Automata},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-092}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/092},
eprinttype = {ECCC},
eprint = {TR12-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Duris12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itat/DurisK11,
author = {Pavol Duris and
Marek Kosta},
editor = {Mark{\'{e}}ta Lopatkov{\'{a}}},
title = {Flip-pushdown automata: nondeterministic {\(\epsilon\)}-moves can
be removed},
booktitle = {Proceedings of the Conference on Theory and Practice of Information
Technologies, Vr{\'{a}}tna Dolina, Slovak Republic, September
23-27, 2011},
series = {{CEUR} Workshop Proceedings},
volume = {788},
pages = {15--22},
publisher = {CEUR-WS.org},
year = {2011},
url = {https://ceur-ws.org/Vol-788/paper3.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:21 +0100},
biburl = {https://dblp.org/rec/conf/itat/DurisK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Duris11,
author = {Pavol Duris},
title = {On Computational Power of Partially Blind Automata},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-107}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/107},
eprinttype = {ECCC},
eprint = {TR11-107},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Duris11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DurisK11,
author = {Pavol Duris and
Marek Kosta},
title = {Flip-Pushdown Automata with k Pushdown Reversals and {E0L} Systems
are Incomparable},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-034}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/034},
eprinttype = {ECCC},
eprint = {TR11-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DurisK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Duris04,
author = {Pavol Duris},
title = {Multiparty communication complexity and very hard functions},
journal = {Inf. Comput.},
volume = {192},
number = {1},
pages = {1--14},
year = {2004},
url = {https://doi.org/10.1016/j.ic.2004.03.002},
doi = {10.1016/J.IC.2004.03.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Duris04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DurisHJSS04,
author = {Pavol Duris and
Juraj Hromkovic and
Stasys Jukna and
Martin Sauerhoff and
Georg Schnitger},
title = {On multi-partition communication complexity},
journal = {Inf. Comput.},
volume = {194},
number = {1},
pages = {49--75},
year = {2004},
url = {https://doi.org/10.1016/j.ic.2004.05.002},
doi = {10.1016/J.IC.2004.05.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/DurisHJSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DurisHI04,
author = {Pavol Duris and
Juraj Hromkovic and
Katsushi Inoue},
title = {On the power of nondeterminism and Las Vegas randomization for two-dimensional
finite automata},
journal = {J. Comput. Syst. Sci.},
volume = {68},
number = {3},
pages = {675--699},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.11.007},
doi = {10.1016/J.JCSS.2003.11.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DurisHI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuriM03,
author = {Pavol Duris and
J{\'{a}}n Manuch},
title = {On the computational complexity of infinite words},
journal = {Theor. Comput. Sci.},
volume = {295},
pages = {141--151},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00400-0},
doi = {10.1016/S0304-3975(02)00400-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuriM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DurisM01,
author = {Pavol Duris and
J{\'{a}}n Manuch},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On the Computational Complexity of Infinite Words},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {328--337},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_29},
doi = {10.1007/3-540-44683-4\_29},
timestamp = {Sat, 19 Oct 2019 20:31:50 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DurisM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Duri01,
author = {Pavol Duris and
Juraj Hromkovic and
Stasys Jukna and
Martin Sauerhoff and
Georg Schnitger},
editor = {Afonso Ferreira and
Horst Reichel},
title = {On Multipartition Communication Complexity},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {206--217},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_18},
doi = {10.1007/3-540-44693-1\_18},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Duri01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-066,
author = {Pavol Duris and
Juraj Hromkovic and
Stasys Jukna and
Martin Sauerhoff and
Georg Schnitger},
title = {On Multipartition Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-066}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-066/index.html},
eprinttype = {ECCC},
eprint = {TR01-066},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DurisHI00,
author = {Pavol Duris and
Juraj Hromkovic and
Katsushi Inoue},
title = {A Separation of Determinism, Las Vegas and Nondeterminism for Picture
Recognition},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {214--228},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856752},
doi = {10.1109/CCC.2000.856752},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DurisHI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-027,
author = {Pavol Duris and
Juraj Hromkovic and
Katsushi Inoue},
title = {A Separation of Determinism, Las Vegas and Nondeterminism for Picture
Recognition},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-027}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-027/index.html},
eprinttype = {ECCC},
eprint = {TR00-027},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DurisR98,
author = {Pavol Duris and
Jos{\'{e}} D. P. Rolim},
title = {Lower Bounds on the Multiparty Communication Complexity},
journal = {J. Comput. Syst. Sci.},
volume = {56},
number = {1},
pages = {90--95},
year = {1998},
url = {https://doi.org/10.1006/jcss.1997.1547},
doi = {10.1006/JCSS.1997.1547},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DurisR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DurisJKL98,
author = {Pavol Duris and
Tomasz Jurdzinski and
Miroslaw Kutylowski and
Krzysztof Lorys},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {Power of Cooperation and Multihead Finite Systems},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {896--907},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055111},
doi = {10.1007/BFB0055111},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DurisJKL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DurisHRS97,
author = {Pavol Duris and
Juraj Hromkovic and
Jos{\'{e}} D. P. Rolim and
Georg Schnitger},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Las Vegas Versus Determinism for One-way Communication Complexity,
Finite Automata, and Polynomial-time Computations},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {117--128},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023453},
doi = {10.1007/BFB0023453},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DurisHRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-029,
author = {Pavol Duris and
Juraj Hromkovic and
Jos{\'{e}} D. P. Rolim and
Georg Schnitger},
title = {On the Power of Las Vegas for One-way Communication Complexity, Finite
Automata, and Polynomial-time Computations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-029}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-029/index.html},
eprinttype = {ECCC},
eprint = {TR97-029},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DurisG95,
author = {Pavol Duris and
Zvi Galil},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {Sensing Versus Nonsensing Automata},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {455--463},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_96},
doi = {10.1007/3-540-60084-1\_96},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DurisG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DurisR95,
author = {Pavol Duris and
Jos{\'{e}} D. P. Rolim},
editor = {Ernst W. Mayr and
Claude Puech},
title = {Optimal Lower Bounds on the Multiparty Communication Complexity},
booktitle = {{STACS} 95, 12th Annual Symposium on Theoretical Aspects of Computer
Science, Munich, Germany, March 2-4, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {900},
pages = {350--360},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59042-0\_87},
doi = {10.1007/3-540-59042-0\_87},
timestamp = {Sat, 07 Sep 2019 11:59:26 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DurisR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DurisR94,
author = {Pavol Duris and
Jos{\'{e}} D. P. Rolim},
title = {Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets
Revisited},
journal = {Int. J. Found. Comput. Sci.},
volume = {5},
number = {3/4},
pages = {319--328},
year = {1994},
url = {https://doi.org/10.1142/S0129054194000189},
doi = {10.1142/S0129054194000189},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/DurisR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DurisR94,
author = {Pavol Duris and
Jos{\'{e}} D. P. Rolim},
title = {A Note on the Density of Oracle Decreasing Time-Space Complexity},
journal = {Theor. Comput. Sci.},
volume = {132},
number = {2},
pages = {435--444},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)00072-7},
doi = {10.1016/0304-3975(94)00072-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DurisR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DurisR94,
author = {Pavol Duris and
Jos{\'{e}} D. P. Rolim},
editor = {Igor Pr{\'{\i}}vara and
Branislav Rovan and
Peter Ruzicka},
title = {E-Complete Sets Do Not Have Optimal Polynomial Time Approximations},
booktitle = {Mathematical Foundations of Computer Science 1994, 19th International
Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {841},
pages = {38--51},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58338-6\_57},
doi = {10.1007/3-540-58338-6\_57},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DurisR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DurisG93,
author = {Pavol Duris and
Zvi Galil},
title = {On the Power of Multiple Reads in a Chip},
journal = {Inf. Comput.},
volume = {104},
number = {2},
pages = {277--287},
year = {1993},
url = {https://doi.org/10.1006/inco.1993.1034},
doi = {10.1006/INCO.1993.1034},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DurisG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DurisV91,
author = {Pavol Duris and
Imrich Vrto},
title = {Semelectivity is not Sufficient},
journal = {Inf. Process. Lett.},
volume = {37},
number = {3},
pages = {137--141},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90033-E},
doi = {10.1016/0020-0190(91)90033-E},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DurisV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DurisG91,
author = {Pavol Duris and
Zvi Galil},
title = {Two Lower Bounds in Asynchronous Distributed Computation},
journal = {J. Comput. Syst. Sci.},
volume = {42},
number = {3},
pages = {254--266},
year = {1991},
url = {https://doi.org/10.1016/0022-0000(91)90002-M},
doi = {10.1016/0022-0000(91)90002-M},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DurisG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DurisG91,
author = {Pavol Duris and
Zvi Galil},
editor = {Javier Leach Albert and
Burkhard Monien and
Mario Rodr{\'{\i}}guez{-}Artalejo},
title = {On the Power of Multiple Reads in a Chip},
booktitle = {Automata, Languages and Programming, 18th International Colloquium,
ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {510},
pages = {697--706},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54233-7\_175},
doi = {10.1007/3-540-54233-7\_175},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DurisG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/DurisP89,
author = {Pavol Duris and
Pavel Pudl{\'{a}}k},
editor = {J{\'{a}}nos Csirik and
J{\'{a}}nos Demetrovics and
Ferenc G{\'{e}}cseg},
title = {On the Communication Complexity of Planarity},
booktitle = {Fundamentals of Computation Theory, International Conference FCT'89,
Szeged, Hungary, August 21-25, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {380},
pages = {145--147},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51498-8\_14},
doi = {10.1007/3-540-51498-8\_14},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/DurisP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DurisSTV87,
author = {Pavol Duris and
Ondrej S{\'{y}}kora and
Clark D. Thompson and
Imrich Vrto},
title = {A Minimum-Area Circuit for l-Selection},
journal = {Algorithmica},
volume = {2},
pages = {251--265},
year = {1987},
url = {https://doi.org/10.1007/BF01840362},
doi = {10.1007/BF01840362},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DurisSTV87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DurisGS87,
author = {Pavol Duris and
Zvi Galil and
Georg Schnitger},
title = {Lower Bounds on Communication Complexity},
journal = {Inf. Comput.},
volume = {73},
number = {1},
pages = {1--22},
year = {1987},
url = {https://doi.org/10.1016/0890-5401(87)90037-X},
doi = {10.1016/0890-5401(87)90037-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DurisGS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/kybernetika/DurisH87,
author = {Pavol Duris and
Juraj Hromkovic},
title = {Zerotesting bounded one-way multicounter machines},
journal = {Kybernetika},
volume = {23},
number = {1},
pages = {13--18},
year = {1987},
url = {http://www.kybernetika.cz/content/1987/1/13},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/kybernetika/DurisH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DurisG87,
author = {Pavol Duris and
Zvi Galil},
title = {Two Lower Bounds in Asynchronous Distributed Computation (Preliminary
Version)},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {326--330},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.60},
doi = {10.1109/SFCS.1987.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DurisG87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DurisSVT85,
author = {Pavol Duris and
Ondrej S{\'{y}}kora and
Imrich Vrto and
Clark D. Thompson},
title = {Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard
Transformations},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {245--247},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90092-4},
doi = {10.1016/0020-0190(85)90092-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DurisSVT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DurisGPR84,
author = {Pavol Duris and
Zvi Galil and
Wolfgang J. Paul and
R{\"{u}}diger Reischuk},
title = {Two Nonlinear Lower Bounds for On-Line Computations},
journal = {Inf. Control.},
volume = {60},
number = {1-3},
pages = {1--11},
year = {1984},
url = {https://doi.org/10.1016/S0019-9958(84)80019-4},
doi = {10.1016/S0019-9958(84)80019-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DurisGPR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DurisG84,
author = {Pavol Duris and
Zvi Galil},
title = {A Time-Space Tradeoff for Language Recognition},
journal = {Math. Syst. Theory},
volume = {17},
number = {1},
pages = {3--12},
year = {1984},
url = {https://doi.org/10.1007/BF01744430},
doi = {10.1007/BF01744430},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DurisG84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DurisG84,
author = {Pavol Duris and
Zvi Galil},
title = {Two Tapes are Better than One for Nondeterministic Machines},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {219--227},
year = {1984},
url = {https://doi.org/10.1137/0213016},
doi = {10.1137/0213016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DurisG84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisGS84,
author = {Pavol Duris and
Zvi Galil and
Georg Schnitger},
editor = {Richard A. DeMillo},
title = {Lower Bounds on Communication Complexity},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {81--91},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808668},
doi = {10.1145/800057.808668},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisGS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DurisH83,
author = {Pavol Duris and
Juraj Hromkovic},
title = {One-Way Simple Multihead Finite Automata are not Closed Under Concatenation},
journal = {Theor. Comput. Sci.},
volume = {27},
pages = {121--125},
year = {1983},
url = {https://doi.org/10.1016/0304-3975(83)90096-8},
doi = {10.1016/0304-3975(83)90096-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DurisH83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisGPR83,
author = {Pavol Duris and
Zvi Galil and
Wolfgang J. Paul and
R{\"{u}}diger Reischuk},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {Two Nonlinear Lower Bounds},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {127--132},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808741},
doi = {10.1145/800061.808741},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisGPR83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GalilD82,
author = {Pavol Duris and
Zvi Galil},
title = {On Reversal-Bounded Counter Machines and on Pushdown Automata with
a Bound on the Size of their Pushdown Store},
journal = {Inf. Control.},
volume = {54},
number = {3},
pages = {217--227},
year = {1982},
url = {https://doi.org/10.1016/S0019-9958(82)80023-5},
doi = {10.1016/S0019-9958(82)80023-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GalilD82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DurisG82,
author = {Pavol Duris and
Zvi Galil},
title = {Fooling a two Way Automaton or one Pushdown Store is better than one
Counter for two Way Machines},
journal = {Theor. Comput. Sci.},
volume = {21},
pages = {39--53},
year = {1982},
url = {https://doi.org/10.1016/0304-3975(82)90087-1},
doi = {10.1016/0304-3975(82)90087-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DurisG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DurisG82,
author = {Pavol Duris and
Zvi Galil},
editor = {Mogens Nielsen and
Erik Meineche Schmidt},
title = {On Reversal-Bounded Counter Machines and on Pushdown Automata with
a Bound on the Size of the Pushdown Store},
booktitle = {Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark,
July 12-16, 1982, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {140},
pages = {166--175},
publisher = {Springer},
year = {1982},
url = {https://doi.org/10.1007/BFb0012766},
doi = {10.1007/BFB0012766},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DurisG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DurisH82,
author = {Pavol Duris and
Juraj Hromkovic},
editor = {Mogens Nielsen and
Erik Meineche Schmidt},
title = {Multihead Finite State Automata and Concatenation},
booktitle = {Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark,
July 12-16, 1982, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {140},
pages = {176--186},
publisher = {Springer},
year = {1982},
url = {https://doi.org/10.1007/BFb0012767},
doi = {10.1007/BFB0012767},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DurisH82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisG82,
author = {Pavol Duris and
Zvi Galil},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Two Tapes are Better than One for Nondeterministic Machines},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {1--7},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802171},
doi = {10.1145/800070.802171},
timestamp = {Wed, 14 Nov 2018 10:51:38 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DurisG81,
author = {Pavol Duris and
Zvi Galil},
title = {A Time-Space Tradeoff for Language Recognition},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {53--57},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.9},
doi = {10.1109/SFCS.1981.9},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DurisG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisG81,
author = {Pavol Duris and
Zvi Galil},
title = {Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One
Counter for Two Way Machines (Preliminary Version)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {177--188},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802471},
doi = {10.1145/800076.802471},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-10-01 22:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
