|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
14 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions |
Neergaard, Peter Møller |
2002 |
178 | 1 |
p. 149-179 31 p. |
article |
|
| 2 | Context-Sensitive Rewriting Strategies |
Lucas, Salvador |
2002 |
178 | 1 |
p. 294-343 50 p. |
article |
|
| 3 | Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees |
Kurata, Toshihiko |
2002 |
178 | 1 |
p. 1-11 11 p. |
article |
|
| 4 | Learning Closed Horn Expressions |
Arias, Marta |
2002 |
178 | 1 |
p. 214-240 27 p. |
article |
|
| 5 | Linear Time and the Power of One First-Order Universal Quantifier |
Durand, Arnaud |
2002 |
178 | 1 |
p. 12-22 11 p. |
article |
|
| 6 | On Complexity of Easy Predictable Sequences |
Vyugin, Michael V |
2002 |
178 | 1 |
p. 241-252 12 p. |
article |
|
| 7 | On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs |
Bollig, Beate |
2002 |
178 | 1 |
p. 263-278 16 p. |
article |
|
| 8 | Ordered SOS Process Languages for Branching and Eager Bisimulations |
Ulidowski, Irek |
2002 |
178 | 1 |
p. 180-213 34 p. |
article |
|
| 9 | Prelogical Relations |
Honsell, Furio |
2002 |
178 | 1 |
p. 23-43 21 p. |
article |
|
| 10 | Relative Undecidability in Term Rewriting |
Geser, Alfons |
2002 |
178 | 1 |
p. 132-148 17 p. |
article |
|
| 11 | Relative Undecidability in Term Rewriting |
Geser, Alfons |
2002 |
178 | 1 |
p. 101-131 31 p. |
article |
|
| 12 | The Box Algebra=Petri Nets+Process Expressions |
Best, Eike |
2002 |
178 | 1 |
p. 44-100 57 p. |
article |
|
| 13 | The Complexity of Solving Equations over Finite Groups |
Goldmann, Mikael |
2002 |
178 | 1 |
p. 253-262 10 p. |
article |
|
| 14 | The Small Model Property: How Small Can It Be? |
Pnueli, Amir |
2002 |
178 | 1 |
p. 279-293 15 p. |
article |
14 results found