Emanuela Fachini

38 papers B 2Journal 35Unranked 1
YearRankTypeTitle / Venue / Authors
2020 J jnl
Divergent permutations.
J. Comb. Theory A
Emanuela Fachini, János Körner
2019 J jnl
Divergent permutations.
CoRR
Emanuela Fachini, János Körner
2019 J jnl
Interlocked Permutations.
SIAM J. Discret. Math.
Gérard D. Cohen, Emanuela Fachini, János Körner
2017 J jnl
Hamilton Paths With Lasting Separation.
IEEE Trans. Inf. Theory
Emanuela Fachini, János Körner
2017 J jnl
Path Separation by Short Cycles.
J. Graph Theory
Gérard D. Cohen, Emanuela Fachini, János Körner
2016 J jnl
Zero-Error Capacity of Binary Channels With Memory.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Emanuela Fachini, János Körner
2014 J jnl
Connector Families of Graphs.
Graphs Comb.
Gérard D. Cohen, Emanuela Fachini, János Körner
2014 J jnl
Zero-error capacity of binary channels with memory.
CoRR
Gérard D. Cohen, Emanuela Fachini, János Körner
2013 J jnl
More on Connector Families.
Electron. Notes Discret. Math.
Gérard D. Cohen, Emanuela Fachini, János Körner
2011 J jnl
Forbiddance and Capacity.
Graphs Comb.
Emanuela Fachini, János Körner
2011 J jnl
Permutation Capacities and Oriented Infinite Paths.
Electron. Notes Discret. Math.
Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth
2011 J jnl
Skewincidence.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Emanuela Fachini, János Körner
2010 J jnl
Permutation Capacities of Families of Oriented Infinite Paths.
SIAM J. Discret. Math.
Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth
2008 J jnl
On the permutation capacity of digraphs
CoRR
Gérard D. Cohen, Emanuela Fachini, János Körner
2007 J jnl
Cross-intersecting couples of graphs.
J. Graph Theory
Emanuela Fachini, János Körner
2003 J jnl
Codes for a long silence.
IEEE Trans. Inf. Theory
Emanuela Fachini, János Körner
2001 J jnl
A Better Bound for Locally Thin Set Families.
J. Comb. Theory A
Emanuela Fachini, János Körner, Angelo Monti
2001 J jnl
A Note On Counting Very Different Sequences.
Comb. Probab. Comput.
Emanuela Fachini, János Körner
2001 J jnl
Recursive bounds for perfect hashing.
Discret. Appl. Math.
Emanuela Fachini, Alon Nilli
2001 J jnl
Self-Similarity Bounds for Locally Thin Set Families.
Comb. Probab. Comput.
Emanuela Fachini, János Körner, Angelo Monti
2000 J jnl
Colour Number, Capacity, and Perfectness of Directed Graphs.
Graphs Comb.
Emanuela Fachini, János Körner
2000 J jnl
Locally Thin Set Families.
Comb. Probab. Comput.
Noga Alon, Emanuela Fachini, János Körner
1997 J jnl
Chomsky Hierarchy and Systolic Y-Tree Automata.
Fundam. Informaticae
Emanuela Fachini, Angelo Monti
1996 J jnl
Tight Packings of Hamming Spheres.
J. Comb. Theory A
Emanuela Fachini, János Körner
1995 J jnl
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata.
Math. Syst. Theory
Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente
1994 J jnl
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata.
J. Comput. Syst. Sci.
Emanuela Fachini, Angelo Monti
1992 J jnl
Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata.
Acta Informatica
Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
1992 J jnl
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.
Acta Informatica
Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente
1991 J jnl
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.
Theor. Comput. Sci.
Emanuela Fachini, Andrea Maggiolo-Schettini, Giovanni Resta, Davide Sangiorgi
1991 B conf
Systolic Y-Tree Automata: Closure Properties and Decision Problems.
FCT
Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente
1990 J jnl
Cellular Automata with Regular Behavior.
Complex Syst.
Emanuela Fachini, L. Vassallo
1990 B conf
Comparisons Among Classes of Y-Tree Systolic Automata.
MFCS
Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
1990 J jnl
Simulation of Systolic Tree Automata on Trellis Automata.
Int. J. Found. Comput. Sci.
Emanuela Fachini, Jozef Gruska, Andrea Maggiolo-Schettini, Davide Sangiorgi
1988 J jnl
C-Tree Systolic Automata.
Theor. Comput. Sci.
Emanuela Fachini, Margherita Napoli
1986 J jnl
A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood.
Bull. EATCS
Emanuela Fachini, Lorenzo Iania
1985 — conf
Synchronized Bottom-Up Tree Automata and L-Systems.
TAPSOFT, Vol.1
Emanuela Fachini, Margherita Napoli
1984 J jnl
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems.
Theor. Comput. Sci.
Emanuela Fachini, Margherita Napoli
1982 J jnl
Comparing Hierarchies of Primitive Recursive Sequence Functions.
Math. Log. Q.
Emanuela Fachini, Andrea Maggiolo-Schettini