Viliam Geffert

101 papers A* 2B 13C 11Misc 3Journal 56Unranked 14
YearRankTypeTitle / Venue / Authors
2025 J jnl
Binary Coded Unary Regular Languages.
Int. J. Found. Comput. Sci.
Viliam Geffert, Dominika Palisínová, Juraj Sebej
2025 J jnl
Converting Binary Automata to Unary Automata.
J. Autom. Lang. Comb.
Viliam Geffert
2025 C conf
Simulating Two-Way Nondeterministic Finite Automata Over Small Alphabets by One-Way Nondeterministic Automata.
CIAA
Viliam Geffert, Alexander Okhotin
2024 J jnl
State complexity of binary coded regular languages.
Theor. Comput. Sci.
Viliam Geffert, Dominika Palisínová, Alexander Szabari
2023 C conf
Binary Coded Unary Regular Languages.
CIAA
Viliam Geffert
2022 J jnl
Improved complement for two-way alternating automata.
Acta Informatica
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
2022 J jnl
Input-driven pushdown automata for edit distance neighborhood.
Theor. Comput. Sci.
Viliam Geffert, Zuzana Bednárová, Alexander Szabari
2022 — conf
State Complexity of Binary Coded Regular Languages.
DCFS
Viliam Geffert, Dominika Palisínová, Alexander Szabari
2021 J jnl
Complement for two-way alternating automata.
Acta Informatica
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
2021 — conf
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets.
DCFS
Viliam Geffert, Alexander Okhotin
2021 J jnl
Minimal Size of Counters for (Real-Time) Multicounter Automata.
Fundam. Informaticae
Viliam Geffert, Zuzana Bednárová
2019 C conf
Input-Driven Pushdown Automata for Edit Distance Neighborhood.
DLT
Viliam Geffert, Zuzana Bednárová, Alexander Szabari
2019 J jnl
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n).
Theory Comput. Syst.
Viliam Geffert
2018 Misc conf
Complement for Two-Way Alternating Automata.
CSR
Viliam Geffert
2018 C conf
Minimal Useful Size of Counters for (Real-Time) Multicounter Automata.
MCU
Viliam Geffert, Zuzana Bednárová
2017 J jnl
Alternating space is closed under complement and other simulations for sublogarithmic space.
Inf. Comput.
Viliam Geffert
2017 J jnl
Boolean language operations on nondeterministic automata with a pushdown of constant height.
J. Comput. Syst. Sci.
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2017 J jnl
Two double-exponential gaps for automata with a limited pushdown.
Inf. Comput.
Zuzana Bednárová, Viliam Geffert
2017 Misc conf
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n).
CSR
Viliam Geffert
2016 C conf
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space.
DLT
Viliam Geffert
2016 J jnl
New Results on the Minimum Amount of Useful Space.
Int. J. Found. Comput. Sci.
Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz
2015 J jnl
Classical Automata on Promise Problems.
Discret. Math. Theor. Comput. Sci.
Viliam Geffert, Abuzer Yakaryilmaz
2014 — conf
Classical Automata on Promise Problems.
DCFS
Viliam Geffert, Abuzer Yakaryilmaz
2014 J jnl
Classical Automata on Promise Problems.
Electron. Colloquium Comput. Complex.
Viliam Geffert, Abuzer Yakaryilmaz
2014 J jnl
Classical automata on promise problems.
CoRR
Viliam Geffert, Abuzer Yakaryilmaz
2014 J jnl
Removing nondeterminism in constant height pushdown automata.
Inf. Comput.
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2014 B ed.
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
Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, A Min Tjoa
2014 — conf
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata.
MFCS (1)
Viliam Geffert, Alexander Okhotin
2014 C conf
Two Double-Exponential Gaps for Automata with a Limited Pushdown.
LATA
Zuzana Bednárová, Viliam Geffert
2014 J jnl
Two-way automata making choices only at the endmarkers.
Inf. Comput.
Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
2013 — conf
A Direct Construction of Finite State Automata for Pushdown Store Languages.
DCFS
Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2013 Misc conf
Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height.
CSR
Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano
2013 J jnl
Factoring and testing primes in small space.
RAIRO Theor. Informatics Appl.
Viliam Geffert, Dana Pardubská
2013 — conf
One-way simulation of two-way finite automata over small alphabets.
NCMA
Viliam Geffert, Alexander Okhotin
2013 J jnl
Unary Coded NP-Complete Languages in Aspace(log log n).
Int. J. Found. Comput. Sci.
Viliam Geffert, Dana Pardubská
2012 J jnl
An alternating hierarchy for finite automata.
Theor. Comput. Sci.
Viliam Geffert
2012 J jnl
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata.
Algorithmica
Viliam Geffert, Giovanni Pighizzini
2012 — conf
Removing Nondeterminism in Constant Height Pushdown Automata.
DCFS
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2012 J jnl
The size-cost of Boolean operations on constant height deterministic pushdown automata.
Theor. Comput. Sci.
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2012 C conf
Two-Way Automata Making Choices Only at the Endmarkers.
LATA
Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
2012 C conf
Unary Coded NP-Complete Languages in ASPACE (log log n).
Developments in Language Theory
Viliam Geffert, Dana Pardubská
2011 — conf
An Alternating Hierarchy for Finite Automata.
NCMA
Viliam Geffert
2011 B conf
In-Place Sorting.
SOFSEM
Viliam Geffert, Jozef Gajdos
2011 — conf
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata.
DCFS
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2011 J jnl
Two-Way Automata Making Choices Only at the Endmarkers
CoRR
Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
2011 J jnl
Two-way unary automata versus logarithmic space.
Inf. Comput.
Viliam Geffert, Giovanni Pighizzini
2010 J jnl
More concise representation of regular languages by automata and regular expressions.
Inf. Comput.
Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2010 J jnl
Multiway in-place merging.
Theor. Comput. Sci.
Viliam Geffert, Jozef Gajdos
2010 J jnl
One Pebble Versus epsilon * log n Bits.
Fundam. Informaticae
Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti
2010 B conf
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata.
LATIN
Viliam Geffert, Giovanni Pighizzini
2010 J jnl
Translation from classical two-way automata to pebble two-way automata.
RAIRO Theor. Informatics Appl.
Viliam Geffert, Lubomíra Istonová
2010 C conf
Two-Way Unary Automata versus Logarithmic Space.
Developments in Language Theory
Viliam Geffert, Giovanni Pighizzini
2009 B conf
Factoring and Testing Primes in Small Space.
SOFSEM
Viliam Geffert, Dana Pardubská
2009 J jnl
Hyper-minimizing minimized deterministic finite state automata.
RAIRO Theor. Informatics Appl.
Andrew Badr, Viliam Geffert, Ian Shipman
2009 B conf
Multiway In-Place Merging.
FCT
Viliam Geffert, Jozef Gajdos
2009 — conf
One Pebble Versus log(n) Bits.
NCMA
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2009 — conf
Translation from Classical Two-Way Automata to Pebble Two-Way Automata
DCFS
Viliam Geffert, Lubomíra Istonová
2008 — conf
Hyper-Minimizing Minimized Deterministic Automata.
AFL
Viliam Geffert, Andrew Badr, Ian Shipman
2008 C conf
More Concise Representation of Regular Languages by Automata and Regular Expressions.
Developments in Language Theory
Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2008 — conf
Multiway blockwise in-place merging.
ITAT
Viliam Geffert, Jozef Gajdos
2008 J jnl
Preface.
Int. J. Found. Comput. Sci.
Viliam Geffert, Giovanni Pighizzini
2008 B ed.
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
SOFSEM
Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková
2008 — ed.
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
SOFSEM (2)
Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková
2007 — ed.
9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007
DCFS
Viliam Geffert, Giovanni Pighizzini
2007 J jnl
Complementing two-way finite automata.
Inf. Comput.
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2007 J jnl
Magic numbers in the state hierarchy of finite automata.
Inf. Comput.
Viliam Geffert
2007 J jnl
State Hierarchy for One-Way Finite Automata.
J. Autom. Lang. Comb.
Viliam Geffert
2006 J jnl
Conversion of regular expressions into realtime automata.
RAIRO Theor. Informatics Appl.
Viliam Geffert, Lubomíra Istonová
2006 J jnl
Linear-Time In-Place Selection with epsilon.n Element Moves.
Comput. Artif. Intell.
Ján Kollár, Viliam Geffert
2006 B conf
Magic Numbers in the State Hierarchy of Finite Automata.
MFCS
Viliam Geffert
2005 — conf
(Non)determinism and the Size of One-Way Finite Automata.
DCFS
Viliam Geffert
2005 J jnl
An in-place sorting with
J. ACM
Gianni Franceschini, Viliam Geffert
2005 C conf
Complementing Two-Way Finite Automata.
Developments in Language Theory
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2003 J jnl
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
CoRR
Gianni Franceschini, Viliam Geffert
2003 A* conf
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.
FOCS
Gianni Franceschini, Viliam Geffert
2003 J jnl
Converting two-way nondeterministic unary automata into simpler automata.
Theor. Comput. Sci.
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2003 J jnl
Space hierarchy theorem revised.
Theor. Comput. Sci.
Viliam Geffert
2003 J jnl
Translation of binary regular expressions into nondeterministic ε-free automata with transitions.
J. Comput. Syst. Sci.
Viliam Geffert
2002 J jnl
Refinement of the Alternating Space Hierarchy.
Comput. Artif. Intell.
Viliam Geffert, Norbert Popély
2001 B conf
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.
MFCS
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2001 B conf
Space Hierarchy Theorem Revised.
MFCS
Viliam Geffert
2000 J jnl
A space lower bound for acceptance by one-way II
RAIRO Theor. Informatics Appl.
Viliam Geffert, Norbert Popély
2000 J jnl
A variant of inductive counting.
Theor. Comput. Sci.
Viliam Geffert
2000 J jnl
Asymptotically efficient in-place merging.
Theor. Comput. Sci.
Viliam Geffert, Jyrki Katajainen, Tomi Pasanen
1998 J jnl
A Communication Hierarchy of Parallel Computations.
Theor. Comput. Sci.
Viliam Geffert
1998 J jnl
Bridging Across the log(n) Space Frontier.
Inf. Comput.
Viliam Geffert
1998 J jnl
Sublogarithmic Bounds on Space and Reversals.
SIAM J. Comput.
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
1995 B conf
Bridging Across the log(n) Space Frontier.
MFCS
Viliam Geffert
1994 J jnl
A Hierarchy That Does Not Collapse: Alternations in Low Level Space.
RAIRO Theor. Informatics Appl.
Viliam Geffert
1993 J jnl
A Speed-Up Theorem Without Tape Compression.
Theor. Comput. Sci.
Viliam Geffert
1993 J jnl
Sublogarithmic Sigma
RAIRO Theor. Informatics Appl.
Viliam Geffert
1993 J jnl
Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space.
SIAM J. Comput.
Viliam Geffert
1992 J jnl
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.
Inf. Process. Lett.
Helmut Alt, Viliam Geffert, Kurt Mehlhorn
1991 J jnl
How to Generate Languages Using Only Two Pairs of Parentheses.
J. Inf. Process. Cybern.
Viliam Geffert
1991 J jnl
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility.
SIAM J. Comput.
Viliam Geffert
1991 J jnl
Normal forms for phrase-structure grammars.
RAIRO Theor. Informatics Appl.
Viliam Geffert
1990 A* conf
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility.
ICALP
Viliam Geffert
1990 B conf
Speed-Up Theorem Without Tape Compression.
MFCS
Viliam Geffert
1988 J jnl
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient.
Theor. Comput. Sci.
Viliam Geffert
1988 B conf
Context-Free-Like Forms for the Phrase-Structure Grammars.
MFCS
Viliam Geffert
1986 B conf
Grammars with Context Dependency Restricted to Synchronization.
MFCS
Viliam Geffert