|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
8 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | An algorithm for colouring perfect planar graphs |
Stewart, Iain A. |
1989 |
31 | 2 |
p. 97-101 5 p. |
article |
|
| 2 | Analysis of random probing hashing |
Ramakrishna, M.V. |
1989 |
31 | 2 |
p. 83-90 8 p. |
article |
|
| 3 | An approximation algorithm for the TSP |
Basart, J.M. |
1989 |
31 | 2 |
p. 77-81 5 p. |
article |
|
| 4 | A note on higher-order functions versus logical variables |
Burton, F.Warren |
1989 |
31 | 2 |
p. 91-95 5 p. |
article |
|
| 5 | A note on optimal parallel transformations of regular expressions to nondeterministic finite automata |
Rytter, Wojciech |
1989 |
31 | 2 |
p. 103-109 7 p. |
article |
|
| 6 | Counting clique trees and computing perfect elimination schemes in parallel |
Ho, Chin-Wen |
1989 |
31 | 2 |
p. 61-68 8 p. |
article |
|
| 7 | On the upper bound on the rotation distance of binary trees |
Luccio, F. |
1989 |
31 | 2 |
p. 57-60 4 p. |
article |
|
| 8 | Worst-case data structures for the priority queue with attrition |
Sundar, Rajamani |
1989 |
31 | 2 |
p. 69-75 7 p. |
article |
8 results found