|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
12 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A decision procedure for optimal polyhedron partitioning |
Chazelle, Bernard |
1983 |
16 | 2 |
p. 75-78 4 p. |
article |
|
| 2 | A generalization of two code ordering optimizations |
Fraser, Christopher W. |
1983 |
16 | 2 |
p. 67-70 4 p. |
article |
|
| 3 | Connectivity and edge-disjoint spanning trees |
Gusfield, Dan |
1983 |
16 | 2 |
p. 87-89 3 p. |
article |
|
| 4 | Iteration strikes back - at the cyclic towers of Hanoi |
Walsh, T.R. |
1983 |
16 | 2 |
p. 91-93 3 p. |
article |
|
| 5 | Key exchange using ‘keyless cryptography’ |
Alpern, Bowen |
1983 |
16 | 2 |
p. 79-81 3 p. |
article |
|
| 6 | Minimization of demand paging for the LRU stack model of program behavior |
Wood, Christopher |
1983 |
16 | 2 |
p. 99-104 6 p. |
article |
|
| 7 | On-line computation of transitive closures of graphs |
Ibaraki, T. |
1983 |
16 | 2 |
p. 95-97 3 p. |
article |
|
| 8 | On sparse sets in NP–P |
Hartmanis, Juris |
1983 |
16 | 2 |
p. 55-60 6 p. |
article |
|
| 9 | On the enlargement of the class of regular languages by the shuffle closure |
Jȩdrzejowicz, Joanna |
1983 |
16 | 2 |
p. 51-54 4 p. |
article |
|
| 10 | Optimal networks for distributing nonsequential programs |
Eichholz, Stefan |
1983 |
16 | 2 |
p. 71-74 4 p. |
article |
|
| 11 | Should the two-headed disk be greedy? - Yes, it should |
Hofri, Micha |
1983 |
16 | 2 |
p. 83-85 3 p. |
article |
|
| 12 | Stable marriages by coroutines |
Allison, Lloyd |
1983 |
16 | 2 |
p. 61-65 5 p. |
article |
12 results found