|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
11 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A YACC extension for LRR grammar parsing |
Seite, B. |
1987 |
52 | 1-2 |
p. 91-143 53 p. |
article |
|
| 2 | Editorial Board |
1987 |
52 | 1-2 |
p. ii-iii nvt p. |
article |
||
| 3 | Factoring polynomials and primitive elements for special primes |
von zur Gathen, Joachim |
1987 |
52 | 1-2 |
p. 77-89 13 p. |
article |
|
| 4 | On helping by robust oracle machines |
Ko, Ker-I |
1987 |
52 | 1-2 |
p. 15-36 22 p. |
article |
|
| 5 | On “on graph rewritings” |
Kennaway, Richard |
1987 |
52 | 1-2 |
p. 37-58 22 p. |
article |
|
| 6 | On regular trace languages |
Sakarovitch, Jacques |
1987 |
52 | 1-2 |
p. 59-75 17 p. |
article |
|
| 7 | Satisfiability in many-valued sentential logic is NP-complete |
Mundici, Daniele |
1987 |
52 | 1-2 |
p. 145-153 9 p. |
article |
|
| 8 | The parallel complexity of deadlock detection |
Spirakis, Paul |
1987 |
52 | 1-2 |
p. 155-163 9 p. |
article |
|
| 9 | Third annual symposium on logic in computer science |
1987 |
52 | 1-2 |
p. 173-175 3 p. |
article |
||
| 10 | Topological characterizations of infinite tree languages |
Moriya, Tetsuo |
1987 |
52 | 1-2 |
p. 165-171 7 p. |
article |
|
| 11 | Word operation definable in the typed λ-calculus |
Zaionc, Marek |
1987 |
52 | 1-2 |
p. 1-14 14 p. |
article |
11 results found