default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Viliam Geffert
@article{DBLP:journals/tcs/GeffertPS24,
author = {Viliam Geffert and
Dominika Palis{\'{\i}}nov{\'{a}} and
Alexander Szabari},
title = {State complexity of binary coded regular languages},
journal = {Theor. Comput. Sci.},
volume = {990},
pages = {114399},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2024.114399},
doi = {10.1016/J.TCS.2024.114399},
timestamp = {Sat, 18 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GeffertPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/Geffert23,
author = {Viliam Geffert},
editor = {Benedek Nagy},
title = {Binary Coded Unary Regular Languages},
booktitle = {Implementation and Application of Automata - 27th International Conference,
{CIAA} 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14151},
pages = {3--20},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-40247-0\_1},
doi = {10.1007/978-3-031-40247-0\_1},
timestamp = {Mon, 14 Aug 2023 16:42:49 +0200},
biburl = {https://dblp.org/rec/conf/wia/Geffert23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/GeffertKZ22,
author = {Viliam Geffert and
Christos A. Kapoutsis and
Mohammad Zakzok},
title = {Improved complement for two-way alternating automata},
journal = {Acta Informatica},
volume = {59},
number = {5},
pages = {619--669},
year = {2022},
url = {https://doi.org/10.1007/s00236-021-00414-w},
doi = {10.1007/S00236-021-00414-W},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/GeffertKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeffertBS22,
author = {Viliam Geffert and
Zuzana Bedn{\'{a}}rov{\'{a}} and
Alexander Szabari},
title = {Input-driven pushdown automata for edit distance neighborhood},
journal = {Theor. Comput. Sci.},
volume = {918},
pages = {105--122},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.03.024},
doi = {10.1016/J.TCS.2022.03.024},
timestamp = {Mon, 16 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GeffertBS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/GeffertPS22,
author = {Viliam Geffert and
Dominika Palis{\'{\i}}nov{\'{a}} and
Alexander Szabari},
editor = {Yo{-}Sub Han and
Gy{\"{o}}rgy Vaszil},
title = {State Complexity of Binary Coded Regular Languages},
booktitle = {Descriptional Complexity of Formal Systems - 24th {IFIP} {WG} 1.02
International Conference, {DCFS} 2022, Debrecen, Hungary, August 29-31,
2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13439},
pages = {72--84},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-13257-5\_6},
doi = {10.1007/978-3-031-13257-5\_6},
timestamp = {Thu, 25 Aug 2022 08:35:31 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/GeffertPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/GeffertKZ21,
author = {Viliam Geffert and
Christos A. Kapoutsis and
Mohammad Zakzok},
title = {Complement for two-way alternating automata},
journal = {Acta Informatica},
volume = {58},
number = {5},
pages = {463--495},
year = {2021},
url = {https://doi.org/10.1007/s00236-020-00373-8},
doi = {10.1007/S00236-020-00373-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/GeffertKZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/GeffertB21,
author = {Viliam Geffert and
Zuzana Bedn{\'{a}}rov{\'{a}}},
title = {Minimal Size of Counters for (Real-Time) Multicounter Automata},
journal = {Fundam. Informaticae},
volume = {181},
number = {2-3},
pages = {99--127},
year = {2021},
url = {https://doi.org/10.3233/FI-2021-2053},
doi = {10.3233/FI-2021-2053},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/GeffertB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/GeffertO21,
author = {Viliam Geffert and
Alexander Okhotin},
editor = {Yo{-}Sub Han and
Sang{-}Ki Ko},
title = {Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata
over Small Alphabets},
booktitle = {Descriptional Complexity of Formal Systems - 23rd {IFIP} {WG} 1.02
International Conference, {DCFS} 2021, Virtual Event, September 5,
2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13037},
pages = {26--37},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-93489-7\_3},
doi = {10.1007/978-3-030-93489-7\_3},
timestamp = {Fri, 14 Jan 2022 09:56:32 +0100},
biburl = {https://dblp.org/rec/conf/dcfs/GeffertO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Geffert19,
author = {Viliam Geffert},
title = {Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)},
journal = {Theory Comput. Syst.},
volume = {63},
number = {4},
pages = {688--714},
year = {2019},
url = {https://doi.org/10.1007/s00224-018-9844-7},
doi = {10.1007/S00224-018-9844-7},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Geffert19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/GeffertBS19,
author = {Viliam Geffert and
Zuzana Bedn{\'{a}}rov{\'{a}} and
Alexander Szabari},
editor = {Piotrek Hofman and
Michal Skrzypczak},
title = {Input-Driven Pushdown Automata for Edit Distance Neighborhood},
booktitle = {Developments in Language Theory - 23rd International Conference, {DLT}
2019, Warsaw, Poland, August 5-9, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11647},
pages = {113--126},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24886-4\_8},
doi = {10.1007/978-3-030-24886-4\_8},
timestamp = {Fri, 27 Mar 2020 08:49:52 +0100},
biburl = {https://dblp.org/rec/conf/dlt/GeffertBS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Geffert18,
author = {Viliam Geffert},
editor = {Fedor V. Fomin and
Vladimir V. Podolskii},
title = {Complement for Two-Way Alternating Automata},
booktitle = {Computer Science - Theory and Applications - 13th International Computer
Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10846},
pages = {132--144},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90530-3\_12},
doi = {10.1007/978-3-319-90530-3\_12},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/Geffert18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mcu/GeffertB18,
author = {Viliam Geffert and
Zuzana Bedn{\'{a}}rov{\'{a}}},
editor = {J{\'{e}}r{\^{o}}me Durand{-}Lose and
Sergey Verlan},
title = {Minimal Useful Size of Counters for (Real-Time) Multicounter Automata},
booktitle = {Machines, Computations, and Universality - 8th International Conference,
{MCU} 2018, Fontainebleau, France, June 28-30, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10881},
pages = {105--120},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-92402-1\_6},
doi = {10.1007/978-3-319-92402-1\_6},
timestamp = {Sun, 02 Oct 2022 16:11:26 +0200},
biburl = {https://dblp.org/rec/conf/mcu/GeffertB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Geffert17,
author = {Viliam Geffert},
title = {Alternating space is closed under complement and other simulations
for sublogarithmic space},
journal = {Inf. Comput.},
volume = {253},
pages = {163--178},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2017.02.001},
doi = {10.1016/J.IC.2017.02.001},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/Geffert17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BednarovaG17,
author = {Zuzana Bedn{\'{a}}rov{\'{a}} and
Viliam Geffert},
title = {Two double-exponential gaps for automata with a limited pushdown},
journal = {Inf. Comput.},
volume = {253},
pages = {381--398},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2016.06.005},
doi = {10.1016/J.IC.2016.06.005},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BednarovaG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BednarovaGMP17,
author = {Zuzana Bedn{\'{a}}rov{\'{a}} and
Viliam Geffert and
Carlo Mereghetti and
Beatrice Palano},
title = {Boolean language operations on nondeterministic automata with a pushdown
of constant height},
journal = {J. Comput. Syst. Sci.},
volume = {90},
pages = {99--114},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2017.06.007},
doi = {10.1016/J.JCSS.2017.06.007},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BednarovaGMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Geffert17,
author = {Viliam Geffert},
editor = {Pascal Weil},
title = {Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)},
booktitle = {Computer Science - Theory and Applications - 12th International Computer
Science Symposium in Russia, {CSR} 2017, Kazan, Russia, June 8-12,
2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10304},
pages = {141--153},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-58747-9\_14},
doi = {10.1007/978-3-319-58747-9\_14},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/Geffert17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BednarovaGRY16,
author = {Zuzana Bedn{\'{a}}rov{\'{a}} and
Viliam Geffert and
Klaus Reinhardt and
Abuzer Yakaryilmaz},
title = {New Results on the Minimum Amount of Useful Space},
journal = {Int. J. Found. Comput. Sci.},
volume = {27},
number = {2},
pages = {259--282},
year = {2016},
url = {https://doi.org/10.1142/S0129054116400098},
doi = {10.1142/S0129054116400098},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BednarovaGRY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/Geffert16,
author = {Viliam Geffert},
editor = {Srecko Brlek and
Christophe Reutenauer},
title = {Alternating Demon Space Is Closed Under Complement and Other Simulations
for Sublogarithmic Space},
booktitle = {Developments in Language Theory - 20th International Conference, {DLT}
2016, Montr{\'{e}}al, Canada, July 25-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9840},
pages = {190--202},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53132-7\_16},
doi = {10.1007/978-3-662-53132-7\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/Geffert16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/GeffertY15,
author = {Viliam Geffert and
Abuzer Yakaryilmaz},
title = {Classical Automata on Promise Problems},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {17},
number = {2},
pages = {157--180},
year = {2015},
url = {https://doi.org/10.46298/dmtcs.2138},
doi = {10.46298/DMTCS.2138},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/GeffertY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BednarovaGMP14,
author = {Zuzana Bedn{\'{a}}rov{\'{a}} and
Viliam Geffert and
Carlo Mereghetti and
Beatrice Palano},
title = {Removing nondeterminism in constant height pushdown automata},
journal = {Inf. Comput.},
volume = {237},
pages = {257--267},
year = {2014},
url = {https://doi.org/10.1016/j.ic.2014.03.002},
doi = {10.1016/J.IC.2014.03.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BednarovaGMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GeffertGP14,
author = {Viliam Geffert and
Bruno Guillon and
Giovanni Pighizzini},
title = {Two-way automata making choices only at the endmarkers},
journal = {Inf. Comput.},
volume = {239},
pages = {71--86},
year = {2014},
url = {https://doi.org/10.1016/j.ic.2014.08.009},
doi = {10.1016/J.IC.2014.08.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GeffertGP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/GeffertY14,
author = {Viliam Geffert and
Abuzer Yakaryilmaz},
editor = {Helmut J{\"{u}}rgensen and
Juhani Karhum{\"{a}}ki and
Alexander Okhotin},
title = {Classical Automata on Promise Problems},
booktitle = {Descriptional Complexity of Formal Systems - 16th International Workshop,
{DCFS} 2014, Turku, Finland, August 5-8, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8614},
pages = {126--137},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09704-6\_12},
doi = {10.1007/978-3-319-09704-6\_12},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/GeffertY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BednarovaG14,
author = {Zuzana Bedn{\'{a}}rov{\'{a}} and
Viliam Geffert},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide and
Jos{\'{e}} Luis Sierra{-}Rodr{\'{\i}}guez and
Bianca Truthe},
title = {Two Double-Exponential Gaps for Automata with a Limited Pushdown},
booktitle = {Language and Automata Theory and Applications - 8th International
Conference, {LATA} 2014, Madrid, Spain, March 10-14, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8370},
pages = {113--125},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04921-2\_9},
doi = {10.1007/978-3-319-04921-2\_9},
timestamp = {Sun, 02 Oct 2022 16:11:11 +0200},
biburl = {https://dblp.org/rec/conf/lata/BednarovaG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GeffertO14,
author = {Viliam Geffert and
Alexander Okhotin},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic
Automata},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {8634},
pages = {291--302},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44522-8\_25},
doi = {10.1007/978-3-662-44522-8\_25},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GeffertO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sofsem/2014,
editor = {Viliam Geffert and
Bart Preneel and
Branislav Rovan and
Julius Stuller and
A Min Tjoa},
title = {{SOFSEM} 2014: Theory and Practice of Computer Science - 40th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 26-29, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8327},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04298-5},
doi = {10.1007/978-3-319-04298-5},
isbn = {978-3-319-04297-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeffertY14,
author = {Viliam Geffert and
Abuzer Yakaryilmaz},
title = {Classical automata on promise problems},
journal = {CoRR},
volume = {abs/1405.6671},
year = {2014},
url = {http://arxiv.org/abs/1405.6671},
eprinttype = {arXiv},
eprint = {1405.6671},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeffertY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GeffertY14,
author = {Viliam Geffert and
Abuzer Yakaryilmaz},
title = {Classical Automata on Promise Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-136}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/136},
eprinttype = {ECCC},
eprint = {TR14-136},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GeffertY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GeffertP13,
author = {Viliam Geffert and
Dana Pardubsk{\'{a}}},
title = {Unary Coded NP-Complete Languages in Aspace(log log n)},
journal = {Int. J. Found. Comput. Sci.},
volume = {24},
number = {7},
pages = {1167},
year = {2013},
url = {https://doi.org/10.1142/S0129054113400376},
doi = {10.1142/S0129054113400376},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GeffertP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GeffertP13,
author = {Viliam Geffert and
Dana Pardubsk{\'{a}}},
title = {Factoring and testing primes in small space},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {47},
number = {3},
pages = {241--259},
year = {2013},
url = {https://doi.org/10.1051/ita/2013038},
doi = {10.1051/ITA/2013038},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/GeffertP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GeffertBMP13,
author = {Viliam Geffert and
Zuzana Bedn{\'{a}}rov{\'{a}} and
Carlo Mereghetti and
Beatrice Palano},
editor = {Andrei A. Bulatov and
Arseny M. Shur},
title = {Boolean Language Operations on Nondeterministic Automata with a Pushdown
of Constant Height},
booktitle = {Computer Science - Theory and Applications - 8th International Computer
Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
25-29, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7913},
pages = {100--111},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38536-0\_9},
doi = {10.1007/978-3-642-38536-0\_9},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/GeffertBMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/GeffertMMMP13,
author = {Viliam Geffert and
Andreas Malcher and
Katja Meckel and
Carlo Mereghetti and
Beatrice Palano},
editor = {Helmut J{\"{u}}rgensen and
Rog{\'{e}}rio Reis},
title = {A Direct Construction of Finite State Automata for Pushdown Store
Languages},
booktitle = {Descriptional Complexity of Formal Systems - 15th International Workshop,
{DCFS} 2013, London, ON, Canada, July 22-25, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8031},
pages = {90--101},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39310-5\_10},
doi = {10.1007/978-3-642-39310-5\_10},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/GeffertMMMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ncma/GeffertO13,
author = {Viliam Geffert and
Alexander Okhotin},
editor = {Suna Bensch and
Frank Drewes and
Rudolf Freund and
Friedrich Otto},
title = {One-way simulation of two-way finite automata over small alphabets},
booktitle = {Fifth Workshop on Non-Classical Models for Automata and Applications
- {NCMA} 2013, Ume{\aa}, Sweden, August 13 - August 14, 2013, Proceedings},
series = {books@ocg.at},
volume = {294},
pages = {151--162},
publisher = {{\"{O}}sterreichische Computer Gesellschaft},
year = {2013},
timestamp = {Thu, 29 Aug 2013 15:25:21 +0200},
biburl = {https://dblp.org/rec/conf/ncma/GeffertO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GeffertP12,
author = {Viliam Geffert and
Giovanni Pighizzini},
title = {Pairs of Complementary Unary Languages with "Balanced" Nondeterministic
Automata},
journal = {Algorithmica},
volume = {63},
number = {3},
pages = {571--587},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9479-9},
doi = {10.1007/S00453-010-9479-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GeffertP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Geffert12,
author = {Viliam Geffert},
title = {An alternating hierarchy for finite automata},
journal = {Theor. Comput. Sci.},
volume = {445},
pages = {1--24},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.04.044},
doi = {10.1016/J.TCS.2012.04.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Geffert12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BednarovaGMP12,
author = {Zuzana Bedn{\'{a}}rov{\'{a}} and
Viliam Geffert and
Carlo Mereghetti and
Beatrice Palano},
title = {The size-cost of Boolean operations on constant height deterministic
pushdown automata},
journal = {Theor. Comput. Sci.},
volume = {449},
pages = {23--36},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.05.009},
doi = {10.1016/J.TCS.2012.05.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BednarovaGMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/BednarovaGMP12,
author = {Zuzana Bedn{\'{a}}rov{\'{a}} and
Viliam Geffert and
Carlo Mereghetti and
Beatrice Palano},
editor = {Martin Kutrib and
Nelma Moreira and
Rog{\'{e}}rio Reis},
title = {Removing Nondeterminism in Constant Height Pushdown Automata},
booktitle = {Descriptional Complexity of Formal Systems - 14th International Workshop,
{DCFS} 2012, Braga, Portugal, July 23-25, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7386},
pages = {76--88},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31623-4\_6},
doi = {10.1007/978-3-642-31623-4\_6},
timestamp = {Sun, 25 Oct 2020 22:35:40 +0100},
biburl = {https://dblp.org/rec/conf/dcfs/BednarovaGMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/GeffertP12,
author = {Viliam Geffert and
Dana Pardubsk{\'{a}}},
editor = {Hsu{-}Chun Yen and
Oscar H. Ibarra},
title = {Unary Coded NP-Complete Languages in {ASPACE} (log log n)},
booktitle = {Developments in Language Theory - 16th International Conference, {DLT}
2012, Taipei, Taiwan, August 14-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7410},
pages = {166--177},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31653-1\_16},
doi = {10.1007/978-3-642-31653-1\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/GeffertP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/GeffertGP12,
author = {Viliam Geffert and
Bruno Guillon and
Giovanni Pighizzini},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide},
title = {Two-Way Automata Making Choices Only at the Endmarkers},
booktitle = {Language and Automata Theory and Applications - 6th International
Conference, {LATA} 2012, {A} Coru{\~{n}}a, Spain, March 5-9, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7183},
pages = {264--276},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28332-1\_23},
doi = {10.1007/978-3-642-28332-1\_23},
timestamp = {Sun, 02 Oct 2022 16:11:11 +0200},
biburl = {https://dblp.org/rec/conf/lata/GeffertGP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GeffertP11,
author = {Viliam Geffert and
Giovanni Pighizzini},
title = {Two-way unary automata versus logarithmic space},
journal = {Inf. Comput.},
volume = {209},
number = {7},
pages = {1016--1025},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2011.03.003},
doi = {10.1016/J.IC.2011.03.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GeffertP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/BednarovaGMP11,
author = {Zuzana Bedn{\'{a}}rov{\'{a}} and
Viliam Geffert and
Carlo Mereghetti and
Beatrice Palano},
editor = {Markus Holzer and
Martin Kutrib and
Giovanni Pighizzini},
title = {The Size-Cost of Boolean Operations on Constant Height Deterministic
Pushdown Automata},
booktitle = {Descriptional Complexity of Formal Systems - 13th International Workshop,
{DCFS} 2011, Gie{\ss}en/Limburg, Germany, July 25-27, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6808},
pages = {80--92},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22600-7\_7},
doi = {10.1007/978-3-642-22600-7\_7},
timestamp = {Sun, 25 Oct 2020 22:35:40 +0100},
biburl = {https://dblp.org/rec/conf/dcfs/BednarovaGMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ncma/Geffert11,
author = {Viliam Geffert},
editor = {Rudolf Freund and
Markus Holzer and
Carlo Mereghetti and
Friedrich Otto and
Beatrice Palano},
title = {An Alternating Hierarchy for Finite Automata},
booktitle = {Third Workshop on Non-Classical Models for Automata and Applications
- {NCMA} 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings},
series = {books@ocg.at},
volume = {282},
pages = {15--36},
publisher = {Austrian Computer Society},
year = {2011},
timestamp = {Thu, 17 Mar 2016 10:50:07 +0100},
biburl = {https://dblp.org/rec/conf/ncma/Geffert11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GeffertG11,
author = {Viliam Geffert and
Jozef Gajdos},
editor = {Ivana Cern{\'{a}} and
Tibor Gyim{\'{o}}thy and
Juraj Hromkovic and
Keith G. Jeffery and
Rastislav Kr{\'{a}}lovic and
Marko Vukolic and
Stefan Wolf},
title = {In-Place Sorting},
booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 22-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6543},
pages = {248--259},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18381-2\_21},
doi = {10.1007/978-3-642-18381-2\_21},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/GeffertG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1263,
author = {Viliam Geffert and
Bruno Guillon and
Giovanni Pighizzini},
title = {Two-Way Automata Making Choices Only at the Endmarkers},
journal = {CoRR},
volume = {abs/1110.1263},
year = {2011},
url = {http://arxiv.org/abs/1110.1263},
eprinttype = {arXiv},
eprint = {1110.1263},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-1263.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/GeffertPM10,
author = {Viliam Geffert and
Giovanni Pighizzini and
Carlo Mereghetti},
title = {One Pebble Versus epsilon * log n Bits},
journal = {Fundam. Informaticae},
volume = {104},
number = {1-2},
pages = {55--69},
year = {2010},
url = {https://doi.org/10.3233/FI-2010-335},
doi = {10.3233/FI-2010-335},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/GeffertPM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GeffertMP10,
author = {Viliam Geffert and
Carlo Mereghetti and
Beatrice Palano},
title = {More concise representation of regular languages by automata and regular
expressions},
journal = {Inf. Comput.},
volume = {208},
number = {4},
pages = {385--394},
year = {2010},
url = {https://doi.org/10.1016/j.ic.2010.01.002},
doi = {10.1016/J.IC.2010.01.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GeffertMP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GeffertI10,
author = {Viliam Geffert and
Lubom{\'{\i}}ra Istonov{\'{a}}},
title = {Translation from classical two-way automata to pebble two-way automata},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {44},
number = {4},
pages = {507--523},
year = {2010},
url = {https://doi.org/10.1051/ita/2011001},
doi = {10.1051/ITA/2011001},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/GeffertI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeffertG10,
author = {Viliam Geffert and
Jozef Gajdos},
title = {Multiway in-place merging},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {16-18},
pages = {1793--1808},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.01.034},
doi = {10.1016/J.TCS.2010.01.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GeffertG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/GeffertP10,
author = {Viliam Geffert and
Giovanni Pighizzini},
editor = {Yuan Gao and
Hanlin Lu and
Shinnosuke Seki and
Sheng Yu},
title = {Two-Way Unary Automata versus Logarithmic Space},
booktitle = {Developments in Language Theory, 14th International Conference, {DLT}
2010, London, ON, Canada, August 17-20, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6224},
pages = {197--208},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14455-4\_19},
doi = {10.1007/978-3-642-14455-4\_19},
timestamp = {Thu, 19 Mar 2020 15:28:05 +0100},
biburl = {https://dblp.org/rec/conf/dlt/GeffertP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GeffertP10,
author = {Viliam Geffert and
Giovanni Pighizzini},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Pairs of Complementary Unary Languages with "Balanced" Nondeterministic
Automata},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {196--207},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_19},
doi = {10.1007/978-3-642-12200-2\_19},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/GeffertP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BadrGS09,
author = {Andrew Badr and
Viliam Geffert and
Ian Shipman},
title = {Hyper-minimizing minimized deterministic finite state automata},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {43},
number = {1},
pages = {69--94},
year = {2009},
url = {https://doi.org/10.1051/ita:2007061},
doi = {10.1051/ITA:2007061},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BadrGS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/GeffertG09,
author = {Viliam Geffert and
Jozef Gajdos},
editor = {Miroslaw Kutylowski and
Witold Charatonik and
Maciej Gebala},
title = {Multiway In-Place Merging},
booktitle = {Fundamentals of Computation Theory, 17th International Symposium,
{FCT} 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5699},
pages = {133--144},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03409-1\_13},
doi = {10.1007/978-3-642-03409-1\_13},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/GeffertG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ncma/GeffertMP09,
author = {Viliam Geffert and
Carlo Mereghetti and
Giovanni Pighizzini},
editor = {Henning Bordihn and
Rudolf Freund and
Markus Holzer and
Martin Kutrib and
Friedrich Otto},
title = {One Pebble Versus log(n) Bits},
booktitle = {Workshop on Non-Classical Models for Automata and Applications - {NCMA}
2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings},
series = {books@ocg.at},
volume = {256},
pages = {121--134},
publisher = {Austrian Computer Society},
year = {2009},
timestamp = {Thu, 17 Mar 2016 10:50:07 +0100},
biburl = {https://dblp.org/rec/conf/ncma/GeffertMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GeffertP09,
author = {Viliam Geffert and
Dana Pardubsk{\'{a}}},
editor = {Mogens Nielsen and
Anton{\'{\i}}n Kucera and
Peter Bro Miltersen and
Catuscia Palamidessi and
Petr Tuma and
Frank D. Valencia},
title = {Factoring and Testing Primes in Small Space},
booktitle = {{SOFSEM} 2009: Theory and Practice of Computer Science, 35th Conference
on Current Trends in Theory and Practice of Computer Science, Spindleruv
Ml{\'{y}}n, Czech Republic, January 24-30, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5404},
pages = {291--302},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-540-95891-8\_28},
doi = {10.1007/978-3-540-95891-8\_28},
timestamp = {Fri, 30 Aug 2019 10:02:27 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/GeffertP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-0907-5127,
author = {Viliam Geffert and
Lubom{\'{\i}}ra Istonov{\'{a}}},
editor = {J{\"{u}}rgen Dassow and
Giovanni Pighizzini and
Bianca Truthe},
title = {Translation from Classical Two-Way Automata to Pebble Two-Way Automata},
booktitle = {Proceedings Eleventh International Workshop on Descriptional Complexity
of Formal Systems, {DCFS} 2009, Magdeburg, Germany, July 6-9, 2009},
series = {{EPTCS}},
volume = {3},
pages = {131--140},
year = {2009},
url = {https://doi.org/10.4204/EPTCS.3.12},
doi = {10.4204/EPTCS.3.12},
timestamp = {Wed, 12 Sep 2018 01:05:14 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-5127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GeffertP08,
author = {Viliam Geffert and
Giovanni Pighizzini},
title = {Preface},
journal = {Int. J. Found. Comput. Sci.},
volume = {19},
number = {4},
pages = {747--749},
year = {2008},
url = {https://doi.org/10.1142/S0129054108005929},
doi = {10.1142/S0129054108005929},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GeffertP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/afl/GeffertBS08,
author = {Viliam Geffert and
Andrew Badr and
Ian Shipman},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Zolt{\'{a}}n {\'{E}}sik},
title = {Hyper-Minimizing Minimized Deterministic Automata},
booktitle = {Automata and Formal Languages, 12th International Conference, {AFL}
2008, Balatonf{\"{u}}red, Hungary, May 27-30, 2008, Proceedings},
pages = {9--30},
year = {2008},
timestamp = {Fri, 18 Nov 2011 12:16:10 +0100},
biburl = {https://dblp.org/rec/conf/afl/GeffertBS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/GeffertMP08,
author = {Viliam Geffert and
Carlo Mereghetti and
Beatrice Palano},
editor = {Masami Ito and
Masafumi Toyama},
title = {More Concise Representation of Regular Languages by Automata and Regular
Expressions},
booktitle = {Developments in Language Theory, 12th International Conference, {DLT}
2008, Kyoto, Japan, September 16-19, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5257},
pages = {359--370},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85780-8\_28},
doi = {10.1007/978-3-540-85780-8\_28},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/GeffertMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itat/GeffertG08,
author = {Viliam Geffert and
Jozef Gajdos},
editor = {Peter Vojt{\'{a}}s},
title = {Multiway blockwise in-place merging},
booktitle = {Proceedings of the Conference on Theory and Practice of Information
Technologies, {ITAT} 2008, Hrebienok, Slovakia, September 22-26, 2008},
series = {{CEUR} Workshop Proceedings},
volume = {414},
publisher = {CEUR-WS.org},
year = {2008},
url = {https://ceur-ws.org/Vol-414/paper3.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:21 +0100},
biburl = {https://dblp.org/rec/conf/itat/GeffertG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sofsem/2008,
editor = {Viliam Geffert and
Juhani Karhum{\"{a}}ki and
Alberto Bertoni and
Bart Preneel and
Pavol N{\'{a}}vrat and
M{\'{a}}ria Bielikov{\'{a}}},
title = {{SOFSEM} 2008: Theory and Practice of Computer Science, 34th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 19-25, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4910},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-77566-9},
doi = {10.1007/978-3-540-77566-9},
isbn = {978-3-540-77565-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sofsem/2008-2,
editor = {Viliam Geffert and
Juhani Karhum{\"{a}}ki and
Alberto Bertoni and
Bart Preneel and
Pavol N{\'{a}}vrat and
M{\'{a}}ria Bielikov{\'{a}}},
title = {{SOFSEM} 2008: Theory and Practice of Computer Science, 34th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 19-25, 2008, Volume {II} - Student Research
Forum},
publisher = {Safarik University, Kosice, Slovakia},
year = {2008},
isbn = {978-80-7097-697-5},
timestamp = {Tue, 25 Nov 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/2008-2.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GeffertMP07,
author = {Viliam Geffert and
Carlo Mereghetti and
Giovanni Pighizzini},
title = {Complementing two-way finite automata},
journal = {Inf. Comput.},
volume = {205},
number = {8},
pages = {1173--1187},
year = {2007},
url = {https://doi.org/10.1016/j.ic.2007.01.008},
doi = {10.1016/J.IC.2007.01.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GeffertMP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Geffert07,
author = {Viliam Geffert},
title = {Magic numbers in the state hierarchy of finite automata},
journal = {Inf. Comput.},
volume = {205},
number = {11},
pages = {1652--1670},
year = {2007},
url = {https://doi.org/10.1016/j.ic.2007.07.001},
doi = {10.1016/J.IC.2007.07.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Geffert07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/Geffert07,
author = {Viliam Geffert},
title = {State Hierarchy for One-Way Finite Automata},
journal = {J. Autom. Lang. Comb.},
volume = {12},
number = {1-2},
pages = {139--145},
year = {2007},
url = {https://doi.org/10.25596/jalc-2007-139},
doi = {10.25596/JALC-2007-139},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/Geffert07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dcfs/2007,
editor = {Viliam Geffert and
Giovanni Pighizzini},
title = {9th International Workshop on Descriptional Complexity of Formal Systems
- {DCFS} 2007, High Tatras, Slovakia, July 20 - 22, 2007},
publisher = {University of Kosice, Slovakia},
year = {2007},
isbn = {978-80-7097-688-3},
timestamp = {Fri, 21 Oct 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cai/GeffertK06,
author = {J{\'{a}}n Koll{\'{a}}r and
Viliam Geffert},
title = {Linear-Time In-Place Selection with epsilon.n Element Moves},
journal = {Comput. Artif. Intell.},
volume = {25},
number = {4},
pages = {333--350},
year = {2006},
url = {http://www.cai.sk/ojs/index.php/cai/article/view/345},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cai/GeffertK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GeffertI06,
author = {Viliam Geffert and
Lubom{\'{\i}}ra Istonov{\'{a}}},
title = {Conversion of regular expressions into realtime automata},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {40},
number = {4},
pages = {611--629},
year = {2006},
url = {https://doi.org/10.1051/ita:2006036},
doi = {10.1051/ITA:2006036},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/GeffertI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Geffert06,
author = {Viliam Geffert},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {Magic Numbers in the State Hierarchy of Finite Automata},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {412--423},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_36},
doi = {10.1007/11821069\_36},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Geffert06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FranceschiniG05,
author = {Gianni Franceschini and
Viliam Geffert},
title = {An in-place sorting with \emph{O}(\emph{n}log \emph{n}) comparisons
and \emph{O}(\emph{n}) moves},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {515--537},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082037},
doi = {10.1145/1082036.1082037},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FranceschiniG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/Geffert05,
author = {Viliam Geffert},
editor = {Carlo Mereghetti and
Beatrice Palano and
Giovanni Pighizzini and
Detlef Wotschke},
title = {(Non)determinism and the Size of One-Way Finite Automata},
booktitle = {7th International Workshop on Descriptional Complexity of Formal Systems
- {DCFS} 2005, Como, Italy, June 30 - July 2, 2005. Proceedings},
pages = {23--37},
publisher = {Universit{\`{a}} degli Studi di Milano, Milan, Italy},
year = {2005},
timestamp = {Fri, 21 Oct 2011 15:06:32 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/Geffert05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/GeffertMP05,
author = {Viliam Geffert and
Carlo Mereghetti and
Giovanni Pighizzini},
editor = {Clelia de Felice and
Antonio Restivo},
title = {Complementing Two-Way Finite Automata},
booktitle = {Developments in Language Theory, 9th International Conference, {DLT}
2005, Palermo, Italy, July 4-8, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3572},
pages = {260--271},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11505877\_23},
doi = {10.1007/11505877\_23},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/GeffertMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Geffert03,
author = {Viliam Geffert},
title = {Translation of binary regular expressions into nondeterministic {\(\epsilon\)}-free
automata with transitions},
journal = {J. Comput. Syst. Sci.},
volume = {66},
number = {3},
pages = {451--472},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00036-9},
doi = {10.1016/S0022-0000(03)00036-9},
timestamp = {Mon, 19 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Geffert03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Geffert03,
author = {Viliam Geffert},
title = {Space hierarchy theorem revised},
journal = {Theor. Comput. Sci.},
volume = {295},
pages = {171--187},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00402-4},
doi = {10.1016/S0304-3975(02)00402-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Geffert03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeffertMP03,
author = {Viliam Geffert and
Carlo Mereghetti and
Giovanni Pighizzini},
title = {Converting two-way nondeterministic unary automata into simpler automata},
journal = {Theor. Comput. Sci.},
volume = {295},
pages = {189--203},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00403-6},
doi = {10.1016/S0304-3975(02)00403-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GeffertMP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FranceschiniG03,
author = {Gianni Franceschini and
Viliam Geffert},
title = {An In-Place Sorting with O(n log n) Comparisons and O(n) Moves},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {242--250},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238198},
doi = {10.1109/SFCS.2003.1238198},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FranceschiniG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0305005,
author = {Gianni Franceschini and
Viliam Geffert},
title = {An In-Place Sorting with O(n log n) Comparisons and O(n) Moves},
journal = {CoRR},
volume = {cs.DS/0305005},
year = {2003},
url = {http://arxiv.org/abs/cs/0305005},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0305005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cai/GeffertP02,
author = {Viliam Geffert and
Norbert Pop{\'{e}}ly},
title = {Refinement of the Alternating Space Hierarchy},
journal = {Comput. Artif. Intell.},
volume = {21},
number = {6},
year = {2002},
url = {http://www.cai.sk/ojs/index.php/cai/article/view/477},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cai/GeffertP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Geffert01,
author = {Viliam Geffert},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Space Hierarchy Theorem Revised},
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 = {387--397},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_34},
doi = {10.1007/3-540-44683-4\_34},
timestamp = {Sat, 19 Oct 2019 20:31:50 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Geffert01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GeffertMP01,
author = {Viliam Geffert and
Carlo Mereghetti and
Giovanni Pighizzini},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Converting Two-Way Nondeterministic Unary Automata into Simpler Automata},
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 = {398--407},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_35},
doi = {10.1007/3-540-44683-4\_35},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GeffertMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GeffertP00,
author = {Viliam Geffert and
Norbert Pop{\'{e}}ly},
title = {A space lower bound for acceptance by one-way II\({}_{\mbox{2}}\)-alternating
machines},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {34},
number = {5},
pages = {357--372},
year = {2000},
url = {https://doi.org/10.1051/ita:2000101},
doi = {10.1051/ITA:2000101},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/GeffertP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeffertKP00,
author = {Viliam Geffert and
Jyrki Katajainen and
Tomi Pasanen},
title = {Asymptotically efficient in-place merging},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {159--181},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00162-5},
doi = {10.1016/S0304-3975(98)00162-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GeffertKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Geffert00,
author = {Viliam Geffert},
title = {A variant of inductive counting},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {465--475},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00338-2},
doi = {10.1016/S0304-3975(99)00338-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Geffert00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Geffert98,
author = {Viliam Geffert},
title = {Bridging Across the log(n) Space Frontier},
journal = {Inf. Comput.},
volume = {142},
number = {2},
pages = {127--158},
year = {1998},
url = {https://doi.org/10.1006/inco.1997.2682},
doi = {10.1006/INCO.1997.2682},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Geffert98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeffertMP98,
author = {Viliam Geffert and
Carlo Mereghetti and
Giovanni Pighizzini},
title = {Sublogarithmic Bounds on Space and Reversals},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {1},
pages = {325--340},
year = {1998},
url = {https://doi.org/10.1137/S0097539796301306},
doi = {10.1137/S0097539796301306},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GeffertMP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Geffert98,
author = {Viliam Geffert},
title = {A Communication Hierarchy of Parallel Computations},
journal = {Theor. Comput. Sci.},
volume = {198},
number = {1-2},
pages = {99--130},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00033-9},
doi = {10.1016/S0304-3975(97)00033-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Geffert98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Geffert95,
author = {Viliam Geffert},
editor = {Jir{\'{\i}} Wiedermann and
Petr H{\'{a}}jek},
title = {Bridging Across the log(n) Space Frontier},
booktitle = {Mathematical Foundations of Computer Science 1995, 20th International
Symposium, MFCS'95, Prague, Czech Republic, August 28 - September
1, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {969},
pages = {50--65},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60246-1\_112},
doi = {10.1007/3-540-60246-1\_112},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Geffert95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Geffert94,
author = {Viliam Geffert},
title = {A Hierarchy That Does Not Collapse: Alternations in Low Level Space},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {28},
number = {5},
pages = {465--512},
year = {1994},
url = {https://doi.org/10.1051/ita/1994280504651},
doi = {10.1051/ITA/1994280504651},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Geffert94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Geffert93,
author = {Viliam Geffert},
title = {Sublogarithmic Sigma\({}_{\mbox{2}}\)-Space is not Closed under Complement
and Other Separation Results},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {27},
number = {4},
pages = {349--366},
year = {1993},
url = {https://doi.org/10.1051/ita/1993270403491},
doi = {10.1051/ITA/1993270403491},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Geffert93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Geffert93,
author = {Viliam Geffert},
title = {Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for
Sublogarithmic Space},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {1},
pages = {102--113},
year = {1993},
url = {https://doi.org/10.1137/0222009},
doi = {10.1137/0222009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Geffert93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Geffert93,
author = {Viliam Geffert},
title = {A Speed-Up Theorem Without Tape Compression},
journal = {Theor. Comput. Sci.},
volume = {118},
number = {1},
pages = {49--79},
year = {1993},
url = {https://doi.org/10.1016/0304-3975(93)90362-W},
doi = {10.1016/0304-3975(93)90362-W},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Geffert93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AltGM92,
author = {Helmut Alt and
Viliam Geffert and
Kurt Mehlhorn},
title = {A Lower Bound for the Nondeterministic Space Complexity of Context-Free
Recognition},
journal = {Inf. Process. Lett.},
volume = {42},
number = {1},
pages = {25--27},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90127-H},
doi = {10.1016/0020-0190(92)90127-H},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AltGM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/Geffert91,
author = {Viliam Geffert},
title = {How to Generate Languages Using Only Two Pairs of Parentheses},
journal = {J. Inf. Process. Cybern.},
volume = {27},
number = {5/6},
pages = {303--315},
year = {1991},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/Geffert91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Geffert91,
author = {Viliam Geffert},
title = {Normal forms for phrase-structure grammars},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {25},
pages = {473--496},
year = {1991},
url = {https://doi.org/10.1051/ita/1991250504731},
doi = {10.1051/ITA/1991250504731},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Geffert91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Geffert91,
author = {Viliam Geffert},
title = {Nondeterministic Computations in Sublogarithmic Space and Space Constructibility},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {3},
pages = {484--498},
year = {1991},
url = {https://doi.org/10.1137/0220031},
doi = {10.1137/0220031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Geffert91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Geffert90,
author = {Viliam Geffert},
editor = {Mike Paterson},
title = {Nondeterministic Computations in Sublogarithmic Space and Space Constructibility},
booktitle = {Automata, Languages and Programming, 17th International Colloquium,
ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {443},
pages = {111--124},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0032026},
doi = {10.1007/BFB0032026},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Geffert90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Geffert90,
author = {Viliam Geffert},
editor = {Branislav Rovan},
title = {Speed-Up Theorem Without Tape Compression},
booktitle = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'{a}}
Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {452},
pages = {285--291},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0029620},
doi = {10.1007/BFB0029620},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Geffert90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Geffert88,
author = {Viliam Geffert},
title = {A Representation of Recursively Enumerable Languages by Two Homomorphisms
and a Quotient},
journal = {Theor. Comput. Sci.},
volume = {62},
number = {3},
pages = {235--249},
year = {1988},
url = {https://doi.org/10.1016/0304-3975(88)90068-0},
doi = {10.1016/0304-3975(88)90068-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Geffert88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Geffert88,
author = {Viliam Geffert},
editor = {Michal Chytil and
Ladislav Janiga and
V{\'{a}}clav Koubek},
title = {Context-Free-Like Forms for the Phrase-Structure Grammars},
booktitle = {Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad,
Czechoslovakia, August 29 - September 2, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {324},
pages = {309--317},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0017154},
doi = {10.1007/BFB0017154},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Geffert88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Geffert86,
author = {Viliam Geffert},
editor = {Jozef Gruska and
Branislav Rovan and
Juraj Wiedermann},
title = {Grammars with Context Dependency Restricted to Synchronization},
booktitle = {Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia,
August 25-29, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {233},
pages = {370--378},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/BFb0016261},
doi = {10.1007/BFB0016261},
timestamp = {Sat, 30 Sep 2023 09:52:35 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Geffert86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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 2024-05-20 00:52 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:
