Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Hans Leiß
2010 – today
- 2011
[c14]
2000 – 2009
- 2009
[j6]Martin Lange, Hans Leiß: To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. Informatica Didactica 8 (2009)- 2006
[j5]- 2005
[j4]Zoltán Ésik, Hans Leiß: Algebraically complete semirings and Greibach normal form. Ann. Pure Appl. Logic 133(1-3): 173-203 (2005)- 2003
[j3]Foto N. Afrati, Hans Leiß, Michel de Rougemont: Definability and Compression. Fundam. Inform. 56(1-2): 155-180 (2003)
[c13]- 2002
[c12]
[c11]- 2001
[c10]- 2000
[c9]
1990 – 1999
- 1999
[j2]Martin Emms, Hans Leiß: Extending the Type Checker of Standard ML by Polymorphic Recursion. Theor. Comput. Sci. 212(1-2): 157-181 (1999)- 1998
[c8]- 1995
[c7]- 1993
[c6]- 1991
[c5]
[c4]- 1990
[j1]Hans Leiß: On Kilbury's Modification of Earley's Algorithm. ACM Trans. Program. Lang. Syst. 12(4): 610-640 (1990)
[c3]
1980 – 1989
- 1989
[c2]- 1987
[c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:31 CET by the dblp team



