Emanuela Fachini - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2020

Divergent permutationsEmanuela Fachini, János Körner. jcta, 173:105231, 2020. [doi]

2019

Interlocked PermutationsGérard D. Cohen, Emanuela Fachini, János Körner. siamdm, 33(3):1662-1668, 2019. [doi]

2017

Path Separation by Short CyclesGérard D. Cohen, Emanuela Fachini, János Körner. jgt, 85(1):107-114, 2017. [doi]

Hamilton Paths With Lasting SeparationEmanuela Fachini, János Körner. TIT, 63(10):6344-6346, 2017. [doi]

2016

Zero-Error Capacity of Binary Channels With MemoryGérard D. Cohen, Emanuela Fachini, János Körner. TIT, 62(1):3-7, 2016. [doi]

2014

Connector Families of GraphsGérard D. Cohen, Emanuela Fachini, János Körner. gc, 30(6):1417-1425, 2014. [doi]

2013

More on Connector FamiliesGérard D. Cohen, Emanuela Fachini, János Körner. endm, 44:23-29, 2013. [doi]

2011

Permutation Capacities and Oriented Infinite PathsGraham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth. endm, 38:195-199, 2011. [doi]

SkewincidenceGérard D. Cohen, Emanuela Fachini, János Körner. TIT, 57(11):7313-7316, 2011. [doi]

Forbiddance and CapacityEmanuela Fachini, János Körner. gc, 27(4):495-503, 2011. [doi]

2010

Permutation Capacities of Families of Oriented Infinite PathsGraham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth. siamdm, 24(2):441-456, 2010. [doi]

2007

Cross-intersecting couples of graphsEmanuela Fachini, János Körner. jgt, 56(2):105-112, 2007. [doi]

2003

Codes for a long silenceEmanuela Fachini, János Körner. TIT, 49(8):2020-2023, 2003.

2001

A Note On Counting Very Different SequencesEmanuela Fachini, János Körner. cpc, 10(6):501-504, 2001.

Recursive bounds for perfect hashingEmanuela Fachini, Alon Nilli. DAM, 111(3):307-311, 2001.

Self-Similarity Bounds for Locally Thin Set FamiliesEmanuela Fachini, János Körner, Angelo Monti. cpc, 10(4):309-315, 2001. [doi]

A Better Bound for Locally Thin Set FamiliesEmanuela Fachini, János Körner, Angelo Monti. JCT, 95(2):209-218, 2001. [doi]

2000

Locally Thin Set FamiliesNoga Alon, Emanuela Fachini, János Körner. cpc, 9(6):481-488, 2000.

Colour Number, Capacity, and Perfectness of Directed GraphsEmanuela Fachini, János Körner. gc, 16(4):389-398, 2000. [doi]

1997

Chomsky Hierarchy and Systolic Y-Tree AutomataEmanuela Fachini, Angelo Monti. FUIN, 29(4):325-339, 1997.

1996

Tight Packings of Hamming SpheresEmanuela Fachini, János Körner. JCT, 76(2):292-294, 1996. [doi]

1995

Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic AutomataEmanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente. mst, 28(3):245-266, 1995.

1994

A Kleene-like Characterization of Languages Accepted by Systolic Tree AutomataEmanuela Fachini, Angelo Monti. jcss, 49(1):133-147, 1994.

1992

Languages Accepted by Systolic Y-Tree Automata: Structural CharacterizationsEmanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente. ACTA, 29(8):761-778, 1992.

Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis AutomataEmanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi. ACTA, 29(6/7):623-643, 1992.

1991

Systolic Y-Tree Automata: Closure Properties and Decision ProblemsEmanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente. fct 1991: 210-219

Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree AutomataEmanuela Fachini, Andrea Maggiolo-Schettini, Giovanni Resta, Davide Sangiorgi. TCS, 83(2):249-260, 1991.

1990

Cellular Automata with Regular BehaviorEmanuela Fachini, L. Vassallo. compsys, 4(4), 1990. [doi]

Comparisons Among Classes of Y-Tree Systolic AutomataEmanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi. mfcs 1990: 254-260

Simulation of Systolic Tree Automata on Trellis AutomataEmanuela Fachini, Jozef Gruska, Andrea Maggiolo-Schettini, Davide Sangiorgi. ijfcs, 1(2):87-110, 1990.

1988

C-Tree Systolic AutomataEmanuela Fachini, Margherita Napoli. TCS, 56:155-186, 1988.

1986

A note on the paper Systolic tree acceptors by K. Culik II, A. Salomaa and D. WoodEmanuela Fachini, Lorenzo Iania. eatcs, 28:26-29, 1986.

1985

Synchronized Bottom-Up Tree Automata and L-SystemsEmanuela Fachini, Margherita Napoli. tapsoft 1985: 298-307

1984

Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision ProblemsEmanuela Fachini, Margherita Napoli. TCS, 29:185-227, 1984.

1982

Comparing Hierarchies of Primitive Recursive Sequence FunctionsEmanuela Fachini, Andrea Maggiolo-Schettini. mlq, 28(27-32):431-445, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL