| 2009 |
|---|
| 40 | EE | Viliam Geffert,
Dana Pardubská:
Factoring and Testing Primes in Small Space.
SOFSEM 2009: 291-302 |
| 2008 |
|---|
| 39 | | Viliam Geffert,
Juhani Karhumäki,
Alberto Bertoni,
Bart Preneel,
Pavol Návrat,
Mária Bieliková:
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
Safarik University, Kosice, Slovakia 2008 |
| 38 | | Viliam Geffert,
Juhani Karhumäki,
Alberto Bertoni,
Bart Preneel,
Pavol Návrat,
Mária Bieliková:
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
Springer 2008 |
| 37 | EE | Viliam Geffert,
Carlo Mereghetti,
Beatrice Palano:
More Concise Representation of Regular Languages by Automata and Regular Expressions.
Developments in Language Theory 2008: 359-370 |
| 36 | EE | Viliam Geffert,
Giovanni Pighizzini:
Preface.
Int. J. Found. Comput. Sci. 19(4): 747-749 (2008) |
| 2007 |
|---|
| 35 | EE | Viliam Geffert:
Magic numbers in the state hierarchy of finite automata.
Inf. Comput. 205(11): 1652-1670 (2007) |
| 34 | EE | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Complementing two-way finite automata.
Inf. Comput. 205(8): 1173-1187 (2007) |
| 33 | | Viliam Geffert:
State Hierarchy for One-Way Finite Automata.
Journal of Automata, Languages and Combinatorics 12(1-2): 139-145 (2007) |
| 2006 |
|---|
| 32 | EE | Viliam Geffert:
Magic Numbers in the State Hierarchy of Finite Automata.
MFCS 2006: 412-423 |
| 31 | | Viliam Geffert,
Ján Kollár:
Linear-Time In-Place Selection with epsilon.n Element Moves.
Computers and Artificial Intelligence 25(4): (2006) |
| 2005 |
|---|
| 30 | EE | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Complementing Two-Way Finite Automata.
Developments in Language Theory 2005: 260-271 |
| 29 | EE | Gianni Franceschini,
Viliam Geffert:
An in-place sorting with O(nlog n) comparisons and O(n) moves.
J. ACM 52(4): 515-537 (2005) |
| 2003 |
|---|
| 28 | EE | Gianni Franceschini,
Viliam Geffert:
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.
FOCS 2003: 242-250 |
| 27 | EE | Gianni Franceschini,
Viliam Geffert:
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
CoRR cs.DS/0305005: (2003) |
| 26 | EE | Viliam Geffert:
Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions.
J. Comput. Syst. Sci. 66(3): 451-472 (2003) |
| 25 | EE | Viliam Geffert:
Space hierarchy theorem revised.
Theor. Comput. Sci. 295: 171-187 (2003) |
| 24 | EE | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Converting two-way nondeterministic unary automata into simpler automata.
Theor. Comput. Sci. 295: 189-203 (2003) |
| 2002 |
|---|
| 23 | | Viliam Geffert,
Norbert Popély:
Refinement of the Alternating Space Hierarchy.
Computers and Artificial Intelligence 21(6): (2002) |
| 2001 |
|---|
| 22 | EE | Viliam Geffert:
Space Hierarchy Theorem Revised.
MFCS 2001: 387-397 |
| 21 | EE | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.
MFCS 2001: 398-407 |
| 2000 |
|---|
| 20 | EE | Viliam Geffert,
Norbert Popély:
A space lower bound for acceptance by one-way II2-alternating machines.
ITA 34(5): 357-372 (2000) |
| 19 | EE | Viliam Geffert,
Jyrki Katajainen,
Tomi Pasanen:
Asymptotically efficient in-place merging.
Theor. Comput. Sci. 237(1-2): 159-181 (2000) |
| 18 | EE | Viliam Geffert:
A variant of inductive counting.
Theor. Comput. Sci. 237(1-2): 465-475 (2000) |
| 1998 |
|---|
| 17 | | Viliam Geffert:
Bridging Across the log(n) Space Frontier.
Inf. Comput. 142(2): 127-158 (1998) |
| 16 | | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Sublogarithmic Bounds on Space and Reversals.
SIAM J. Comput. 28(1): 325-340 (1998) |
| 15 | EE | Viliam Geffert:
A Communication Hierarchy of Parallel Computations.
Theor. Comput. Sci. 198(1-2): 99-130 (1998) |
| 1995 |
|---|
| 14 | | Viliam Geffert:
Bridging Across the log(n) Space Frontier.
MFCS 1995: 50-65 |
| 1994 |
|---|
| 13 | | Viliam Geffert:
A Hierarchy That Does Not Collapse: Alternations in Low Level Space.
ITA 28(5): 465-512 (1994) |
| 1993 |
|---|
| 12 | | Viliam Geffert:
Sublogarithmic Sigma2-Space is not Closed under Complement and Other Separation Results.
ITA 27(4): 349-366 (1993) |
| 11 | | Viliam Geffert:
Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space.
SIAM J. Comput. 22(1): 102-113 (1993) |
| 10 | | Viliam Geffert:
A Speed-Up Theorem Without Tape Compression.
Theor. Comput. Sci. 118(1): 49-79 (1993) |
| 1992 |
|---|
| 9 | | Helmut Alt,
Viliam Geffert,
Kurt Mehlhorn:
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.
Inf. Process. Lett. 42(1): 25-27 (1992) |
| 1991 |
|---|
| 8 | | Viliam Geffert:
How to Generate Languages Using Only Two Pairs of Parentheses.
Elektronische Informationsverarbeitung und Kybernetik 27(5/6): 303-315 (1991) |
| 7 | | Viliam Geffert:
Normal forms for phrase-structure grammars.
ITA 25: 473-498 (1991) |
| 6 | | Viliam Geffert:
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility.
SIAM J. Comput. 20(3): 484-498 (1991) |
| 1990 |
|---|
| 5 | | Viliam Geffert:
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility.
ICALP 1990: 111-124 |
| 4 | | Viliam Geffert:
Speed-Up Theorem Without Tape Compression.
MFCS 1990: 285-291 |
| 1988 |
|---|
| 3 | | Viliam Geffert:
Context-Free-Like Forms for the Phrase-Structure Grammars.
MFCS 1988: 309-317 |
| 2 | | Viliam Geffert:
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient.
Theor. Comput. Sci. 62(3): 235-249 (1988) |
| 1986 |
|---|
| 1 | | Viliam Geffert:
Grammars with Context Dependency Restricted to Synchronization.
MFCS 1986: 370-378 |
