The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Emanuela Fachini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  20. On the permutation capacity of digraphs [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002