| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Viliam Geffert, Giovanni Pighizzini |
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Bruno Guillon, Giovanni Pighizzini |
Two-Way Automata Making Choices Only at the Endmarkers. |
LATA |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Giovanni Pighizzini |
Two-way unary automata versus logarithmic space. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Bruno Guillon, Giovanni Pighizzini |
Two-Way Automata Making Choices Only at the Endmarkers |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert |
An Alternating Hierarchy for Finite Automata. |
NCMA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano |
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. |
DCFS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Jozef Gajdos |
In-Place Sorting. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Jozef Gajdos |
Multiway in-place merging. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Lubomíra Istonová |
Translation from classical two-way automata to pebble two-way automata. |
RAIRO - Theor. Inf. and Applic. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Carlo Mereghetti, Beatrice Palano |
More concise representation of regular languages by automata and regular expressions. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti |
One Pebble Versus epsilon * log n Bits. |
Fundam. Inform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Giovanni Pighizzini |
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Giovanni Pighizzini |
Two-Way Unary Automata versus Logarithmic Space. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Badr, Viliam Geffert, Ian Shipman |
Hyper-minimizing minimized deterministic finite state automata. |
ITA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Lubomíra Istonová |
Translation from Classical Two-Way Automata to Pebble Two-Way Automata |
DCFS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Jozef Gajdos |
Multiway In-Place Merging. |
FCT |
2009 |
DBLP DOI BibTeX RDF |
In-place algorithms, sorting, merging |
| 1 | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
One Pebble Versus log(n) Bits. |
NCMA |
2009 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert, Dana Pardubská |
Factoring and Testing Primes in Small Space. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
sublogarithmic space, computational complexity, factoring, prime numbers |
| 1 | Viliam Geffert, Giovanni Pighizzini |
Preface. |
Int. J. Found. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Carlo Mereghetti, Beatrice Palano |
More Concise Representation of Regular Languages by Automata and Regular Expressions. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
regular expressions, descriptional complexity, Pushdown automata, straight line programs |
| 1 | Viliam Geffert, Andrew Badr, Ian Shipman |
Hyper-Minimizing Minimized Deterministic Automata. |
AFL |
2008 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková (eds.) |
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 |
2008 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková (eds.) |
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 |
2008 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert |
Magic numbers in the state hierarchy of finite automata. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
Complementing two-way finite automata. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
State Hierarchy for One-Way Finite Automata. |
Journal of Automata, Languages and Combinatorics |
2007 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert, Giovanni Pighizzini (eds.) |
9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007 |
DCFS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ján Kollár, Viliam Geffert |
Linear-Time In-Place Selection with epsilon.n Element Moves. |
Computers and Artificial Intelligence |
2006 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert, Lubomíra Istonová |
Conversion of regular expressions into realtime automata. |
ITA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Magic Numbers in the State Hierarchy of Finite Automata. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Viliam Geffert |
An in-place sorting with O(nlog n) comparisons and O(n) moves. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
Sorting in-place |
| 1 | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
Complementing Two-Way Finite Automata. |
Developments in Language Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
(Non)determinism and the Size of One-Way Finite Automata. |
DCFS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
Converting two-way nondeterministic unary automata into simpler automata. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Space hierarchy theorem revised. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Viliam Geffert |
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert |
Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Viliam Geffert |
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Norbert Popély |
Refinement of the Alternating Space Hierarchy. |
Computers and Artificial Intelligence |
2002 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
unary languages, formal languages, finite state automata |
| 1 | Viliam Geffert |
Space Hierarchy Theorem Revised. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
Computational complexity, Space complexity |
| 1 | Viliam Geffert, Jyrki Katajainen, Tomi Pasanen |
Asymptotically efficient in-place merging. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
A variant of inductive counting. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Norbert Popély |
A space lower bound for acceptance by one-way II2-alternating machines. |
ITA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
A Communication Hierarchy of Parallel Computations. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Bridging Across the log(n) Space Frontier. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
Sublogarithmic Bounds on Space and Reversals. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Bridging Across the log(n) Space Frontier. |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
A Hierarchy That Does Not Collapse: Alternations in Low Level Space. |
ITA |
1994 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert |
A Speed-Up Theorem Without Tape Compression. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Sublogarithmic Sigma2-Space is not Closed under Complement and Other Separation Results. |
ITA |
1993 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert |
Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space. |
SIAM J. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Helmut Alt, Viliam Geffert, Kurt Mehlhorn |
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Normal forms for phrase-structure grammars. |
ITA |
1991 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert |
How to Generate Languages Using Only Two Pairs of Parentheses. |
Elektronische Informationsverarbeitung und Kybernetik |
1991 |
DBLP BibTeX RDF |
|
| 1 | Viliam Geffert |
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. |
SIAM J. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. |
ICALP |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Speed-Up Theorem Without Tape Compression. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Context-Free-Like Forms for the Phrase-Structure Grammars. |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Grammars with Context Dependency Restricted to Synchronization. |
MFCS |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")