| 2019 | DLT | Input-Driven Pushdown Automata for Edit Distance Neighborhood. | Viliam Geffert, Zuzana Bednrov, Alexander Szabari |
| 2018 | CSR | Complement for Two-Way Alternating Automata. | Viliam Geffert |
| 2018 | MCU | Minimal Useful Size of Counters for (Real-Time) Multicounter Automata. | Viliam Geffert, Zuzana Bednrov |
| 2017 | CSR | Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). | Viliam Geffert |
| 2016 | DLT | Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space. | Viliam Geffert |
| 2014 | LATA | Two Double-Exponential Gaps for Automata with a Limited Pushdown. | Zuzana Bednrov, Viliam Geffert |
| 2014 | MFCS | Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata. | Viliam Geffert, Alexander Okhotin |
| 2013 | CSR | Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height. | Viliam Geffert, Zuzana Bednrov, Carlo Mereghetti, Beatrice Palano |
| 2012 | DLT | Unary Coded NP-Complete Languages in ASPACE (log log n). | Viliam Geffert, Dana Pardubsk |
| 2012 | LATA | Two-Way Automata Making Choices Only at the Endmarkers. | Viliam Geffert, Bruno Guillon, Giovanni Pighizzini |
| 2011 | SOFSEM | In-Place Sorting. | Viliam Geffert, Jozef Gajdos |
| 2010 | DLT | Two-Way Unary Automata versus Logarithmic Space. | Viliam Geffert, Giovanni Pighizzini |
| 2010 | LATIN | Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. | Viliam Geffert, Giovanni Pighizzini |
| 2009 | FCT | Multiway In-Place Merging. | Viliam Geffert, Jozef Gajdos |
| 2009 | SOFSEM | Factoring and Testing Primes in Small Space. | Viliam Geffert, Dana Pardubsk |
| 2008 | DLT | More Concise Representation of Regular Languages by Automata and Regular Expressions. | Viliam Geffert, Carlo Mereghetti, Beatrice Palano |
| 2006 | MFCS | Magic Numbers in the State Hierarchy of Finite Automata. | Viliam Geffert |
| 2005 | DLT | Complementing Two-Way Finite Automata. | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
| 2003 | FOCS | An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. | Gianni Franceschini, Viliam Geffert |
| 2001 | MFCS | Space Hierarchy Theorem Revised. | Viliam Geffert |
| 2001 | MFCS | Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
| 1995 | MFCS | Bridging Across the log(n) Space Frontier. | Viliam Geffert |
| 1990 | ICALP | Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. | Viliam Geffert |
| 1990 | MFCS | Speed-Up Theorem Without Tape Compression. | Viliam Geffert |
| 1988 | MFCS | Context-Free-Like Forms for the Phrase-Structure Grammars. | Viliam Geffert |
| 1986 | MFCS | Grammars with Context Dependency Restricted to Synchronization. | Viliam Geffert |