default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDViliam Geffert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j50]Viliam Geffert, Dominika Palisínová, Alexander Szabari:
State complexity of binary coded regular languages. Theor. Comput. Sci. 990: 114399 (2024)- 2023
- [c40]Viliam Geffert:
Binary Coded Unary Regular Languages. CIAA 2023: 3-20 - 2022
- [j49]Viliam Geffert, Christos A. Kapoutsis
, Mohammad Zakzok:
Improved complement for two-way alternating automata. Acta Informatica 59(5): 619-669 (2022) - [j48]Viliam Geffert, Zuzana Bednárová, Alexander Szabari:
Input-driven pushdown automata for edit distance neighborhood. Theor. Comput. Sci. 918: 105-122 (2022) - [c39]Viliam Geffert, Dominika Palisínová, Alexander Szabari:
State Complexity of Binary Coded Regular Languages. DCFS 2022: 72-84 - 2021
- [j47]Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok:
Complement for two-way alternating automata. Acta Informatica 58(5): 463-495 (2021) - [j46]Viliam Geffert, Zuzana Bednárová:
Minimal Size of Counters for (Real-Time) Multicounter Automata. Fundam. Informaticae 181(2-3): 99-127 (2021) - [c38]Viliam Geffert, Alexander Okhotin:
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets. DCFS 2021: 26-37
2010 – 2019
- 2019
- [j45]Viliam Geffert:
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). Theory Comput. Syst. 63(4): 688-714 (2019) - [c37]Viliam Geffert, Zuzana Bednárová, Alexander Szabari:
Input-Driven Pushdown Automata for Edit Distance Neighborhood. DLT 2019: 113-126 - 2018
- [c36]Viliam Geffert:
Complement for Two-Way Alternating Automata. CSR 2018: 132-144 - [c35]Viliam Geffert, Zuzana Bednárová:
Minimal Useful Size of Counters for (Real-Time) Multicounter Automata. MCU 2018: 105-120 - 2017
- [j44]Viliam Geffert:
Alternating space is closed under complement and other simulations for sublogarithmic space. Inf. Comput. 253: 163-178 (2017) - [j43]Zuzana Bednárová, Viliam Geffert:
Two double-exponential gaps for automata with a limited pushdown. Inf. Comput. 253: 381-398 (2017) - [j42]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
Boolean language operations on nondeterministic automata with a pushdown of constant height. J. Comput. Syst. Sci. 90: 99-114 (2017) - [c34]Viliam Geffert:
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). CSR 2017: 141-153 - 2016
- [j41]Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz:
New Results on the Minimum Amount of Useful Space. Int. J. Found. Comput. Sci. 27(2): 259-282 (2016) - [c33]Viliam Geffert:
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space. DLT 2016: 190-202 - 2015
- [j40]Viliam Geffert, Abuzer Yakaryilmaz:
Classical Automata on Promise Problems. Discret. Math. Theor. Comput. Sci. 17(2): 157-180 (2015) - 2014
- [j39]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
Removing nondeterminism in constant height pushdown automata. Inf. Comput. 237: 257-267 (2014) - [j38]Viliam Geffert, Bruno Guillon, Giovanni Pighizzini:
Two-way automata making choices only at the endmarkers. Inf. Comput. 239: 71-86 (2014) - [c32]Viliam Geffert, Abuzer Yakaryilmaz:
Classical Automata on Promise Problems. DCFS 2014: 126-137 - [c31]Zuzana Bednárová, Viliam Geffert:
Two Double-Exponential Gaps for Automata with a Limited Pushdown. LATA 2014: 113-125 - [c30]Viliam Geffert, Alexander Okhotin:
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata. MFCS (1) 2014: 291-302 - [e4]Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, A Min Tjoa:
SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings. Lecture Notes in Computer Science 8327, Springer 2014, ISBN 978-3-319-04297-8 [contents] - [i4]Viliam Geffert, Abuzer Yakaryilmaz:
Classical automata on promise problems. CoRR abs/1405.6671 (2014) - [i3]Viliam Geffert, Abuzer Yakaryilmaz:
Classical Automata on Promise Problems. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j37]Viliam Geffert, Dana Pardubská:
Unary Coded NP-Complete Languages in Aspace(log log n). Int. J. Found. Comput. Sci. 24(7): 1167- (2013) - [j36]Viliam Geffert, Dana Pardubská:
Factoring and testing primes in small space. RAIRO Theor. Informatics Appl. 47(3): 241-259 (2013) - [c29]Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano:
Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height. CSR 2013: 100-111 - [c28]Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS 2013: 90-101 - [c27]Viliam Geffert, Alexander Okhotin:
One-way simulation of two-way finite automata over small alphabets. NCMA 2013: 151-162 - 2012
- [j35]Viliam Geffert, Giovanni Pighizzini:
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. Algorithmica 63(3): 571-587 (2012) - [j34]Viliam Geffert:
An alternating hierarchy for finite automata. Theor. Comput. Sci. 445: 1-24 (2012) - [j33]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
The size-cost of Boolean operations on constant height deterministic pushdown automata. Theor. Comput. Sci. 449: 23-36 (2012) - [c26]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
Removing Nondeterminism in Constant Height Pushdown Automata. DCFS 2012: 76-88 - [c25]Viliam Geffert, Dana Pardubská:
Unary Coded NP-Complete Languages in ASPACE (log log n). Developments in Language Theory 2012: 166-177 - [c24]Viliam Geffert, Bruno Guillon, Giovanni Pighizzini:
Two-Way Automata Making Choices Only at the Endmarkers. LATA 2012: 264-276 - 2011
- [j32]Viliam Geffert, Giovanni Pighizzini:
Two-way unary automata versus logarithmic space. Inf. Comput. 209(7): 1016-1025 (2011) - [c23]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. DCFS 2011: 80-92 - [c22]Viliam Geffert:
An Alternating Hierarchy for Finite Automata. NCMA 2011: 15-36 - [c21]Viliam Geffert, Jozef Gajdos:
In-Place Sorting. SOFSEM 2011: 248-259 - [i2]Viliam Geffert, Bruno Guillon, Giovanni Pighizzini:
Two-Way Automata Making Choices Only at the Endmarkers. CoRR abs/1110.1263 (2011) - 2010
- [j31]Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti:
One Pebble Versus epsilon * log n Bits. Fundam. Informaticae 104(1-2): 55-69 (2010) - [j30]Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208(4): 385-394 (2010) - [j29]Viliam Geffert, Lubomíra Istonová:
Translation from classical two-way automata to pebble two-way automata. RAIRO Theor. Informatics Appl. 44(4): 507-523 (2010) - [j28]Viliam Geffert, Jozef Gajdos:
Multiway in-place merging. Theor. Comput. Sci. 411(16-18): 1793-1808 (2010) - [c20]Viliam Geffert, Giovanni Pighizzini:
Two-Way Unary Automata versus Logarithmic Space. Developments in Language Theory 2010: 197-208 - [c19]Viliam Geffert, Giovanni Pighizzini:
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. LATIN 2010: 196-207
2000 – 2009
- 2009
- [j27]Andrew Badr, Viliam Geffert, Ian Shipman:
Hyper-minimizing minimized deterministic finite state automata. RAIRO Theor. Informatics Appl. 43(1): 69-94 (2009) - [c18]Viliam Geffert, Jozef Gajdos:
Multiway In-Place Merging. FCT 2009: 133-144 - [c17]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
One Pebble Versus log(n) Bits. NCMA 2009: 121-134 - [c16]Viliam Geffert, Dana Pardubská:
Factoring and Testing Primes in Small Space. SOFSEM 2009: 291-302 - [c15]Viliam Geffert, Lubomíra Istonová:
Translation from Classical Two-Way Automata to Pebble Two-Way Automata. DCFS 2009: 131-140 - 2008
- [j26]Viliam Geffert, Giovanni Pighizzini:
Preface. Int. J. Found. Comput. Sci. 19(4): 747-749 (2008) - [c14]Viliam Geffert, Andrew Badr, Ian Shipman:
Hyper-Minimizing Minimized Deterministic Automata. AFL 2008: 9-30 - [c13]Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
More Concise Representation of Regular Languages by Automata and Regular Expressions. Developments in Language Theory 2008: 359-370 - [c12]Viliam Geffert, Jozef Gajdos:
Multiway blockwise in-place merging. ITAT 2008 - [e3]Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková:
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings. Lecture Notes in Computer Science 4910, Springer 2008, ISBN 978-3-540-77565-2 [contents] - [e2]Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková:
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II - Student Research Forum. Safarik University, Kosice, Slovakia 2008, ISBN 978-80-7097-697-5 [contents] - 2007
- [j25]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
Complementing two-way finite automata. Inf. Comput. 205(8): 1173-1187 (2007) - [j24]Viliam Geffert:
Magic numbers in the state hierarchy of finite automata. Inf. Comput. 205(11): 1652-1670 (2007) - [j23]Viliam Geffert:
State Hierarchy for One-Way Finite Automata. J. Autom. Lang. Comb. 12(1-2): 139-145 (2007) - [e1]Viliam Geffert, Giovanni Pighizzini:
9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007. University of Kosice, Slovakia 2007, ISBN 978-80-7097-688-3 [contents] - 2006
- [j22]Ján Kollár, Viliam Geffert:
Linear-Time In-Place Selection with epsilon.n Element Moves. Comput. Artif. Intell. 25(4): 333-350 (2006) - [j21]Viliam Geffert, Lubomíra Istonová:
Conversion of regular expressions into realtime automata. RAIRO Theor. Informatics Appl. 40(4): 611-629 (2006) - [c11]Viliam Geffert:
Magic Numbers in the State Hierarchy of Finite Automata. MFCS 2006: 412-423 - 2005
- [j20]Gianni Franceschini, Viliam Geffert:
An in-place sorting with O(nlog n) comparisons and O(n) moves. J. ACM 52(4): 515-537 (2005) - [c10]Viliam Geffert:
(Non)determinism and the Size of One-Way Finite Automata. DCFS 2005: 23-37 - [c9]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
Complementing Two-Way Finite Automata. Developments in Language Theory 2005: 260-271 - 2003
- [j19]Viliam Geffert:
Translation of binary regular expressions into nondeterministic ε-free automata with transitions. J. Comput. Syst. Sci. 66(3): 451-472 (2003) - [j18]Viliam Geffert:
Space hierarchy theorem revised. Theor. Comput. Sci. 295: 171-187 (2003) - [j17]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295: 189-203 (2003) - [c8]Gianni Franceschini, Viliam Geffert:
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. FOCS 2003: 242-250 - [i1]Gianni Franceschini, Viliam Geffert:
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. CoRR cs.DS/0305005 (2003) - 2002
- [j16]Viliam Geffert, Norbert Popély:
Refinement of the Alternating Space Hierarchy. Comput. Artif. Intell. 21(6) (2002) - 2001
- [c7]Viliam Geffert:
Space Hierarchy Theorem Revised. MFCS 2001: 387-397 - [c6]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. MFCS 2001: 398-407 - 2000
- [j15]Viliam Geffert, Norbert Popély:
A space lower bound for acceptance by one-way II2-alternating machines. RAIRO Theor. Informatics Appl. 34(5): 357-372 (2000) - [j14]Viliam Geffert, Jyrki Katajainen, Tomi Pasanen:
Asymptotically efficient in-place merging. Theor. Comput. Sci. 237(1-2): 159-181 (2000) - [j13]Viliam Geffert:
A variant of inductive counting. Theor. Comput. Sci. 237(1-2): 465-475 (2000)
1990 – 1999
- 1998
- [j12]Viliam Geffert:
Bridging Across the log(n) Space Frontier. Inf. Comput. 142(2): 127-158 (1998) - [j11]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
Sublogarithmic Bounds on Space and Reversals. SIAM J. Comput. 28(1): 325-340 (1998) - [j10]Viliam Geffert:
A Communication Hierarchy of Parallel Computations. Theor. Comput. Sci. 198(1-2): 99-130 (1998) - 1995
- [c5]Viliam Geffert:
Bridging Across the log(n) Space Frontier. MFCS 1995: 50-65 - 1994
- [j9]Viliam Geffert:
A Hierarchy That Does Not Collapse: Alternations in Low Level Space. RAIRO Theor. Informatics Appl. 28(5): 465-512 (1994) - 1993
- [j8]Viliam Geffert:
Sublogarithmic Sigma2-Space is not Closed under Complement and Other Separation Results. RAIRO Theor. Informatics Appl. 27(4): 349-366 (1993) - [j7]Viliam Geffert:
Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space. SIAM J. Comput. 22(1): 102-113 (1993) - [j6]Viliam Geffert:
A Speed-Up Theorem Without Tape Compression. Theor. Comput. Sci. 118(1): 49-79 (1993) - 1992
- [j5]Helmut Alt, Viliam Geffert, Kurt Mehlhorn:
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. 42(1): 25-27 (1992) - 1991
- [j4]Viliam Geffert:
How to Generate Languages Using Only Two Pairs of Parentheses. J. Inf. Process. Cybern. 27(5/6): 303-315 (1991) - [j3]Viliam Geffert:
Normal forms for phrase-structure grammars. RAIRO Theor. Informatics Appl. 25: 473-496 (1991) - [j2]Viliam Geffert:
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. SIAM J. Comput. 20(3): 484-498 (1991) - 1990
- [c4]Viliam Geffert:
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. ICALP 1990: 111-124 - [c3]Viliam Geffert:
Speed-Up Theorem Without Tape Compression. MFCS 1990: 285-291
1980 – 1989
- 1988
- [j1]Viliam Geffert:
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient. Theor. Comput. Sci. 62(3): 235-249 (1988) - [c2]Viliam Geffert:
Context-Free-Like Forms for the Phrase-Structure Grammars. MFCS 1988: 309-317 - 1986
- [c1]Viliam Geffert:
Grammars with Context Dependency Restricted to Synchronization. MFCS 1986: 370-378
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 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:
