Theoretical Computer Science, Volume 197
Volume 197, Numbers 1-2, 15 May 1998
Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa: Shuffle on Trajectories: Syntactic Constraints. 1-56- Ning Zhong: Recursively Enumerable Subsets of Rq in Two Computing Models: Blum-Shub-Smale Machine and Turing Machine. 79-94
- Susanne Albers: A Competitive Analysis of the List Update Problem with Lookahead. 95-109
- Palash Sarkar, Rana Barua: Multidimenstional Sigma-Automata, Pi-Polynomials and Generalised S-Matrices. 111-138
- Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan: On the Relative Sizes of Learnable Sets. 139-156
- Guoliang Xue: An O(n) Time Hierarchical Tree Algorithm for Computing Force Field in n-Body Simulations. 157-169
- Roberto De Prisco, Angelo Monti, Linda Pagli: Testing and Reconfiguration of VLSI Linear Arrays. 171-188
- Lawrence L. Larmore, Wojciech Rytter: Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. 189-201
- Ngoc-Minh Lê: On Determining Optimal Strategies in Pursuit Games in the Plane. 203-234
- Ioan Tomescu: On Words Containing all Short Subwords. 235-240
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team