Emanuela Fachini

According to our database1, Emanuela Fachini
  • authored at least 34 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Hamilton Paths With Lasting Separation.
IEEE Trans. Information Theory, 2017

Path Separation by Short Cycles.
Journal of Graph Theory, 2017

2016
Zero-Error Capacity of Binary Channels With Memory.
IEEE Trans. Information Theory, 2016

2014
Connector Families of Graphs.
Graphs and Combinatorics, 2014

Zero-error capacity of binary channels with memory.
CoRR, 2014

2013
More on Connector Families.
Electronic Notes in Discrete Mathematics, 2013

2011
Skewincidence.
IEEE Trans. Information Theory, 2011

Forbiddance and Capacity.
Graphs and Combinatorics, 2011

Permutation Capacities and Oriented Infinite Paths.
Electronic Notes in Discrete Mathematics, 2011

2010
Permutation Capacities of Families of Oriented Infinite Paths.
SIAM J. Discrete Math., 2010

2008
On the permutation capacity of digraphs
CoRR, 2008

2007
Cross-intersecting couples of graphs.
Journal of Graph Theory, 2007

2003
Codes for a long silence.
IEEE Trans. Information Theory, 2003

2001
A Better Bound for Locally Thin Set Families.
J. Comb. Theory, Ser. A, 2001

Recursive bounds for perfect hashing.
Discrete Applied Mathematics, 2001

A Note On Counting Very Different Sequences.
Combinatorics, Probability & Computing, 2001

2000
Colour Number, Capacity, and Perfectness of Directed Graphs.
Graphs and Combinatorics, 2000

Locally Thin Set Families.
Combinatorics, Probability & Computing, 2000

1997
Chomsky Hierarchy and Systolic Y-Tree Automata.
Fundam. Inform., 1997

1996
Tight Packings of Hamming Spheres.
J. Comb. Theory, Ser. A, 1996

1995
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata.
Mathematical Systems Theory, 1995

1994
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata.
J. Comput. Syst. Sci., 1994

1992
Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata.
Acta Inf., 1992

Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.
Acta Inf., 1992

1991
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.
Theor. Comput. Sci., 1991

Systolic Y-Tree Automata: Closure Properties and Decision Problems.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
Simulation of Systolic Tree Automata on Trellis Automata.
Int. J. Found. Comput. Sci., 1990

Cellular Automata with Regular Behavior.
Complex Systems, 1990

Comparisons Among Classes of Y-Tree Systolic Automata.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1988
C-Tree Systolic Automata.
Theor. Comput. Sci., 1988

1986
A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood.
Bulletin of the EATCS, 1986

1985
Synchronized Bottom-Up Tree Automata and L-Systems.
Proceedings of the Mathematical Foundations of Software Development, 1985

1984
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems.
Theor. Comput. Sci., 1984

1982
Comparing Hierarchies of Primitive Recursive Sequence Functions.
Math. Log. Q., 1982


  Loading...