Ning Zhong Recursively Enumerable Subsets of Rq in Two Computing Models: Blum-Shub-Smale Machine and Turing Machine. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:197, n:1-2, pp:79-94 [Journal]
Susanne Albers A Competitive Analysis of the List Update Problem with Lookahead. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:197, n:1-2, pp:95-109 [Journal]
Guoliang Xue An O(n) Time Hierarchical Tree Algorithm for Computing Force Field in n-Body Simulations. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:197, n:1-2, pp:157-169 [Journal]
Lawrence L. Larmore, Wojciech Rytter Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:197, n:1-2, pp:189-201 [Journal]
Ngoc-Minh Lê On Determining Optimal Strategies in Pursuit Games in the Plane. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:197, n:1-2, pp:203-234 [Journal]