default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmanuela Fachini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j32]Emanuela Fachini, János Körner
:
Divergent permutations. J. Comb. Theory A 173: 105231 (2020)
2010 – 2019
- 2019
- [j31]Gérard D. Cohen, Emanuela Fachini, János Körner:
Interlocked Permutations. SIAM J. Discret. Math. 33(3): 1662-1668 (2019) - [i3]Emanuela Fachini, János Körner:
Divergent permutations. CoRR abs/1904.05113 (2019) - 2017
- [j30]Gérard D. Cohen, Emanuela Fachini, János Körner:
Path Separation by Short Cycles. J. Graph Theory 85(1): 107-114 (2017) - [j29]Emanuela Fachini, János Körner:
Hamilton Paths With Lasting Separation. IEEE Trans. Inf. Theory 63(10): 6344-6346 (2017) - 2016
- [j28]Gérard D. Cohen, Emanuela Fachini, János Körner:
Zero-Error Capacity of Binary Channels With Memory. IEEE Trans. Inf. Theory 62(1): 3-7 (2016) - 2014
- [j27]Gérard D. Cohen, Emanuela Fachini, János Körner:
Connector Families of Graphs. Graphs Comb. 30(6): 1417-1425 (2014) - [i2]Gérard D. Cohen, Emanuela Fachini, János Körner:
Zero-error capacity of binary channels with memory. CoRR abs/1402.0349 (2014) - 2013
- [j26]Gérard D. Cohen, Emanuela Fachini, János Körner:
More on Connector Families. Electron. Notes Discret. Math. 44: 23-29 (2013) - 2011
- [j25]Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth:
Permutation Capacities and Oriented Infinite Paths. Electron. Notes Discret. Math. 38: 195-199 (2011) - [j24]Emanuela Fachini, János Körner:
Forbiddance and Capacity. Graphs Comb. 27(4): 495-503 (2011) - [j23]Gérard D. Cohen, Emanuela Fachini, János Körner:
Skewincidence. IEEE Trans. Inf. Theory 57(11): 7313-7316 (2011) - 2010
- [j22]Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth:
Permutation Capacities of Families of Oriented Infinite Paths. SIAM J. Discret. Math. 24(2): 441-456 (2010)
2000 – 2009
- 2008
- [i1]Gérard D. Cohen, Emanuela Fachini, János Körner:
On the permutation capacity of digraphs. CoRR abs/0809.1522 (2008) - 2007
- [j21]Emanuela Fachini, János Körner:
Cross-intersecting couples of graphs. J. Graph Theory 56(2): 105-112 (2007) - 2003
- [j20]Emanuela Fachini, János Körner:
Codes for a long silence. IEEE Trans. Inf. Theory 49(8): 2020-2023 (2003) - 2001
- [j19]Emanuela Fachini, János Körner, Angelo Monti:
Self-Similarity Bounds for Locally Thin Set Families. Comb. Probab. Comput. 10(4): 309-315 (2001) - [j18]Emanuela Fachini, János Körner:
A Note On Counting Very Different Sequences. Comb. Probab. Comput. 10(6): 501-504 (2001) - [j17]Emanuela Fachini, Alon Nilli:
Recursive bounds for perfect hashing. Discret. Appl. Math. 111(3): 307-311 (2001) - [j16]Emanuela Fachini, János Körner, Angelo Monti:
A Better Bound for Locally Thin Set Families. J. Comb. Theory A 95(2): 209-218 (2001) - 2000
- [j15]Noga Alon, Emanuela Fachini, János Körner:
Locally Thin Set Families. Comb. Probab. Comput. 9(6): 481-488 (2000) - [j14]Emanuela Fachini, János Körner:
Colour Number, Capacity, and Perfectness of Directed Graphs. Graphs Comb. 16(4): 389-398 (2000)
1990 – 1999
- 1997
- [j13]Emanuela Fachini, Angelo Monti:
Chomsky Hierarchy and Systolic Y-Tree Automata. Fundam. Informaticae 29(4): 325-339 (1997) - 1996
- [j12]Emanuela Fachini, János Körner:
Tight Packings of Hamming Spheres. J. Comb. Theory A 76(2): 292-294 (1996) - 1995
- [j11]Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente:
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata. Math. Syst. Theory 28(3): 245-266 (1995) - 1994
- [j10]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
- [j9]Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi:
Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata. Acta Informatica 29(6/7): 623-643 (1992) - [j8]Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations. Acta Informatica 29(8): 761-778 (1992) - 1991
- [j7]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) - [c3]Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Systolic Y-Tree Automata: Closure Properties and Decision Problems. FCT 1991: 210-219 - 1990
- [j6]Emanuela Fachini, L. Vassallo:
Cellular Automata with Regular Behavior. Complex Syst. 4(4) (1990) - [j5]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) - [c2]Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi:
Comparisons Among Classes of Y-Tree Systolic Automata. MFCS 1990: 254-260
1980 – 1989
- 1988
- [j4]Emanuela Fachini, Margherita Napoli:
C-Tree Systolic Automata. Theor. Comput. Sci. 56: 155-186 (1988) - 1986
- [j3]Emanuela Fachini, Lorenzo Iania:
A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood. Bull. EATCS 28: 26-29 (1986) - 1985
- [c1]Emanuela Fachini, Margherita Napoli:
Synchronized Bottom-Up Tree Automata and L-Systems. TAPSOFT, Vol.1 1985: 298-307 - 1984
- [j2]Emanuela Fachini, Margherita Napoli:
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems. Theor. Comput. Sci. 29: 185-227 (1984) - 1982
- [j1]Emanuela Fachini, Andrea Maggiolo-Schettini:
Comparing Hierarchies of Primitive Recursive Sequence Functions. Math. Log. Q. 28(27-32): 431-445 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
