The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hans Leiß: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zoltán Ésik, Hans Leiß
    Greibach Normal Form in Algebraically Complete Semirings. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:135-150 [Conf]
  2. Hans Leiß
    On Type Inference for Object-Oriented Programming Languages. [Citation Graph (0, 0)][DBLP]
    CSL, 1987, pp:151-172 [Conf]
  3. Hans Leiß
    Polymorphic Recursion and Semi-Unification. [Citation Graph (0, 0)][DBLP]
    CSL, 1989, pp:211-224 [Conf]
  4. Hans Leiß
    Towards Kleene Algebra with Recursion. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:242-256 [Conf]
  5. Hans Leiß
    Bounded Fixed-Point Definability and Tabular Recognition of Languages. [Citation Graph (0, 0)][DBLP]
    CSL, 1995, pp:388-402 [Conf]
  6. Hans Leiß, Michel de Rougemont
    Automata on Lempel-ziv Compressed Strings. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:384-396 [Conf]
  7. Hans Leiß
    Kleenean semimodules and linear languages. [Citation Graph (0, 0)][DBLP]
    FICS, 2002, pp:51-53 [Conf]
  8. Hans Leiß
    Polymorphic Constructs in Natural and Programming Languages. [Citation Graph (0, 0)][DBLP]
    JELIA, 1990, pp:348-365 [Conf]
  9. Foto N. Afrati, Hans Leiß, Michel de Rougemont
    Definability and Compression. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:63-73 [Conf]
  10. Hans Leiß, Fritz Henglein
    A Decidable Case of the Semi-Unification Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:318-327 [Conf]
  11. Hans Leiß
    Bounded Fixed-Point Definability and Tabular Recognition of Languages. [Citation Graph (0, 0)][DBLP]
    TAPD, 1998, pp:96-107 [Conf]
  12. Hans Leiß
    Second-Order Pre-Logical Relations and Representation Independence. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:298-314 [Conf]
  13. Hans Leiß
    Combining Recursive and Dynamic Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:258-273 [Conf]
  14. Zoltán Ésik, Hans Leiß
    Algebraically complete semirings and Greibach normal form. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:133, n:1-3, pp:173-203 [Journal]
  15. Foto N. Afrati, Hans Leiß, Michel de Rougemont
    Definability and Compression. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:1-2, pp:155-180 [Journal]
  16. Hans Leiß
    Kleene modules and linear languages. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2006, v:66, n:2, pp:185-194 [Journal]
  17. Martin Emms, Hans Leiß
    Extending the Type Checker of Standard ML by Polymorphic Recursion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:212, n:1-2, pp:157-181 [Journal]
  18. Hans Leiß
    On Kilbury's Modification of Earley's Algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1990, v:12, n:4, pp:610-640 [Journal]

Search in 0.017secs, Finished in 0.018secs
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