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