| 2003 |
| 19 | | Emanuela Fachini,
János Körner:
Codes for a long silence.
IEEE Transactions on Information Theory 49(8): 2020-2023 (2003) |
| 2001 |
| 18 | | Emanuela Fachini,
János Körner:
A Note On Counting Very Different Sequences.
Combinatorics, Probability & Computing 10(6): (2001) |
| 17 | | Emanuela Fachini,
Alon Nilli:
Recursive bounds for perfect hashing.
Discrete Applied Mathematics 111(3): 307-311 (2001) |
| 16 | EE | Emanuela Fachini,
János Körner,
Angelo Monti:
A Better Bound for Locally Thin Set Families.
J. Comb. Theory, Ser. A 95(2): 209-218 (2001) |
| 2000 |
| 15 | | Noga Alon,
Emanuela Fachini,
János Körner:
Locally Thin Set Families.
Combinatorics, Probability & Computing 9(6): (2000) |
| 1997 |
| 14 | | Emanuela Fachini,
Angelo Monti:
Chomsky Hierarchy and Systolic Y-Tree Automata.
Fundam. Inform. 29(4): 325-339 (1997) |
| 1996 |
| 13 | EE | Emanuela Fachini,
János Körner:
Tight Packings of Hamming Spheres.
J. Comb. Theory, Ser. A 76(2): 292-294 (1996) |
| 1995 |
| 12 | | Emanuela Fachini,
Jozef Gruska,
Margherita Napoli,
Domenico Parente:
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata.
Mathematical Systems Theory 28(3): 245-266 (1995) |
| 1994 |
| 11 | | Emanuela Fachini,
Angelo Monti:
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata.
J. Comput. Syst. Sci. 49(1): 133-147 (1994) |
| 1992 |
| 10 | | Emanuela Fachini,
Andrea Maggiolo-Schettini,
Davide Sangiorgi:
Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata.
Acta Inf. 29(6/7): 623-643 (1992) |
| 9 | | Emanuela Fachini,
Angelo Monti,
Margherita Napoli,
Domenico Parente:
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.
Acta Inf. 29(8): 761-778 (1992) |
| 1991 |
| 8 | | Emanuela Fachini,
Angelo Monti,
Margherita Napoli,
Domenico Parente:
Systolic Y-Tree Automata: Closure Properties and Decision Problems.
FCT 1991: 210-219 |
| 7 | | Emanuela Fachini,
Andrea Maggiolo-Schettini,
Giovanni Resta,
Davide Sangiorgi:
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.
Theor. Comput. Sci. 83(2): 249-260 (1991) |
| 1990 |
| 6 | | Emanuela Fachini,
Andrea Maggiolo-Schettini,
Davide Sangiorgi:
Comparisons Among Classes of Y-Tree Systolic Automata.
MFCS 1990: 254-260 |
| 5 | | Emanuela Fachini,
Jozef Gruska,
Andrea Maggiolo-Schettini,
Davide Sangiorgi:
Simulation of Systolic Tree Automata on Trellis Automata.
Int. J. Found. Comput. Sci. 1(2): 87-110 (1990) |
| 1988 |
| 4 | | Emanuela Fachini,
Margherita Napoli:
C-Tree Systolic Automata.
Theor. Comput. Sci. 56: 155-186 (1988) |
| 1986 |
| 3 | | Emanuela Fachini,
Lorenzo Iania:
A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood.
Bulletin of the EATCS 28: 26-29 (1986) |
| 1985 |
| 2 | | Emanuela Fachini,
Margherita Napoli:
Synchronized Bottom-Up Tree Automata and L-Systems.
TAPSOFT, Vol.1 1985: 298-307 |
| 1984 |
| 1 | | Emanuela Fachini,
Margherita Napoli:
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems.
Theor. Comput. Sci. 29: 185-227 (1984) |