|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
13 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | An infinite word language which is not co-CFL |
Grazon, Anne |
1987 |
24 | 2 |
p. 81-85 5 p. |
article |
|
| 2 | An off-line storage allocation algorithm |
Ślusarek, Maciej |
1987 |
24 | 2 |
p. 71-75 5 p. |
article |
|
| 3 | A note on a new data structure for in-the-past queries |
Field, Dan |
1987 |
24 | 2 |
p. 95-96 2 p. |
article |
|
| 4 | A simple realization of LR-parsers for regular right part grammars |
Sassa, Masataka |
1987 |
24 | 2 |
p. 113-120 8 p. |
article |
|
| 5 | Comment on “Worst-case choice for the stable marriage problem” [2] |
Pujari, A.K. |
1987 |
24 | 2 |
p. 139- 1 p. |
article |
|
| 6 | Concurrent execution of transaction copies |
Wolfson, Ouri |
1987 |
24 | 2 |
p. 87-93 7 p. |
article |
|
| 7 | On determining the on-line minimax linear fit to a discrete point set in the plane |
Rey, Claudio |
1987 |
24 | 2 |
p. 97-101 5 p. |
article |
|
| 8 | Parallelism and the maximal path problem |
Anderson, Richard |
1987 |
24 | 2 |
p. 121-126 6 p. |
article |
|
| 9 | Subsumption and implication |
Gottlob, Georg |
1987 |
24 | 2 |
p. 109-111 3 p. |
article |
|
| 10 | The maximum k-colorable subgraph problem for chordal graphs |
Yannakakis, Mihalis |
1987 |
24 | 2 |
p. 133-137 5 p. |
article |
|
| 11 | The program dependence graph in static program testing |
Korel, Bogdan |
1987 |
24 | 2 |
p. 103-108 6 p. |
article |
|
| 12 | The weakest prespecification |
Hoare, C.A.R. |
1987 |
24 | 2 |
p. 127-132 6 p. |
article |
|
| 13 | Uniform inevitability is tree automation ineffable |
Emerson, E.Allen |
1987 |
24 | 2 |
p. 77-79 3 p. |
article |
13 results found