Viliam Geffert
According to our database1,
Viliam Geffert
authored at least 66 papers
between 1986 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
2023
Proceedings of the Implementation and Application of Automata, 2023
2022
Theor. Comput. Sci., 2022
2021
Fundam. Informaticae, 2021
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets.
Proceedings of the Descriptional Complexity of Formal Systems, 2021
2019
Theory Comput. Syst., 2019
2018
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018
Proceedings of the Computer Science - Theory and Applications, 2018
2017
Boolean language operations on nondeterministic automata with a pushdown of constant height.
J. Comput. Syst. Sci., 2017
Alternating space is closed under complement and other simulations for sublogarithmic space.
Inf. Comput., 2017
2016
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016
2014
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
2013
Int. J. Found. Comput. Sci., 2013
One-way simulation of two-way finite automata over small alphabets.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013
Proceedings of the Descriptional Complexity of Formal Systems, 2013
2012
The size-cost of Boolean operations on constant height deterministic pushdown automata.
Theor. Comput. Sci., 2012
Algorithmica, 2012
2011
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011
2010
More concise representation of regular languages by automata and regular expressions.
Inf. Comput., 2010
2009
RAIRO Theor. Informatics Appl., 2009
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009
One Pebble Versus log(n) Bits.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009
2008
Proceedings of the Conference on Theory and Practice of Information Technologies, 2008
Hyper-Minimizing Minimized Deterministic Automata.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008
2007
2006
RAIRO Theor. Informatics Appl., 2006
Comput. Artif. Intell., 2006
2005
An in-place sorting with <i>O</i>(<i>n</i>log <i>n</i>) comparisons and <i>O</i>(<i>n</i>) moves.
J. ACM, 2005
(Non)determinism and the Size of One-Way Finite Automata.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005
2003
Theor. Comput. Sci., 2003
Translation of binary regular expressions into nondeterministic ε-free automata with transitions.
J. Comput. Syst. Sci., 2003
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
2002
2000
RAIRO Theor. Informatics Appl., 2000
1998
1994
RAIRO Theor. Informatics Appl., 1994
1993
Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space.
SIAM J. Comput., 1993
Sublogarithmic Sigma<sub>2</sub>-Space is not Closed under Complement and Other Separation Results.
RAIRO Theor. Informatics Appl., 1993
1992
Inf. Process. Lett., 1992
1991
SIAM J. Comput., 1991
How to Generate Languages Using Only Two Pairs of Parentheses.
J. Inf. Process. Cybern., 1991
1988
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient.
Theor. Comput. Sci., 1988
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988
1986
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986