Jens M. Dill A counter-example for ``A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars''. [Citation Graph (0, 0)][DBLP] J. ACM, 1989, v:36, n:1, pp:92-96 [Journal]
Paul Helman A common schema for dynamic programming and branch and bound algorithms. [Citation Graph (0, 0)][DBLP] J. ACM, 1989, v:36, n:1, pp:97-128 [Journal]
Joan Boyar Inferring sequences produced by pseudo-random number generators. [Citation Graph (0, 0)][DBLP] J. ACM, 1989, v:36, n:1, pp:129-141 [Journal]