| Normal forms for phrase-structure grammars V Geffert RAIRO-Theoretical Informatics and Applications 25 (5), 473-496, 1991 | 110 | 1991 |
| Converting two-way nondeterministic unary automata into simpler automata V Geffert, C Mereghetti, G Pighizzini Theoretical Computer Science 295 (1-3), 189-203, 2003 | 83 | 2003 |
| Asymptotically efficient in-place merging V Geffert, J Katajainen, T Pasanen Theoretical Computer Science 237 (1-2), 159-181, 2000 | 74 | 2000 |
| Complementing two-way finite automata V Geffert, C Mereghetti, G Pighizzini Information and Computation 205 (8), 1173-1187, 2007 | 73 | 2007 |
| Nondeterministic computations in sublogarithmic space and space constructibility V Geffert SIAM Journal on Computing 20 (3), 484-498, 1991 | 63 | 1991 |
| Context-free-like forms for the phrase-structure grammars V Geffert International Symposium on Mathematical Foundations of Computer Science, 309-317, 1988 | 59 | 1988 |
| Magic numbers in the state hierarchy of finite automata V Geffert Information and Computation 205 (11), 1652-1670, 2007 | 57 | 2007 |
| An In-Place Sorting with O (n log n) Comparisons and O (n) Moves G Franceschini, V Geffert Journal of the ACM (JACM) 52 (4), 515-537, 2005 | 53 | 2005 |
| Hyper-minimizing minimized deterministic finite state automata A Badr, V Geffert, I Shipman RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2009 | 43 | 2009 |
| More concise representation of regular languages by automata and regular expressions V Geffert, C Mereghetti, B Palano Information and computation 208 (4), 385-394, 2010 | 40 | 2010 |
| Tally versions of the Savitch and Immerman–Szelepcsényi theorems for sublogarithmic space V Geffert SIAM Journal on Computing 22 (1), 102-113, 1993 | 36 | 1993 |
| A hierarchy that does not collapse: alternations in low level space V Geffert RAIRO-Theoretical Informatics and Applications 28 (5), 465-512, 1994 | 33 | 1994 |
| An alternating hierarchy for finite automata V Geffert Theoretical Computer Science 445, 1-24, 2012 | 29 | 2012 |
| Two-way unary automata versus logarithmic space V Geffert, G Pighizzini Information and Computation 209 (7), 1016-1025, 2011 | 26 | 2011 |
| Transforming two-way alternating finite automata to one-way nondeterministic automata V Geffert, A Okhotin International Symposium on Mathematical Foundations of Computer Science, 291-302, 2014 | 23 | 2014 |
| A lower bound for the nondeterministic space complexity of context-free recognition H Alt, V Geffert, K Mehlhorn Information Processing Letters 42 (1), 25-27, 1992 | 23 | 1992 |
| The size-cost of Boolean operations on constant height deterministic pushdown automata Z Bednárová, V Geffert, C Mereghetti, B Palano Theoretical Computer Science 449, 23-36, 2012 | 22 | 2012 |
| Translation of binary regular expressions into nondeterministic ε-free automata with O (nlogn) transitions V Geffert Journal of Computer and System Sciences 66 (3), 451-472, 2003 | 21 | 2003 |
| Space hierarchy theorem revised V Geffert Theoretical computer science 295 (1-3), 171-187, 2003 | 20 | 2003 |
| A representation of recursively enumerable languages by two homomorphisms and a quotient V Geffert Theoretical Computer Science 62 (3), 235-249, 1988 | 20 | 1988 |
