Theoretical Computer Science, Volume 158
Volume 158, Numbers 1&2, 20 May 1996
Joaquim Gabarró, Conrado Martinez, Xavier Messeguer: A Design of a Parallel Dictionary Using Skip Lists. 1-33- Michel Koskas: About the p-Paperfolding Words. 35-51
- Stéphane Fabre: Dépendance de systèmes de numération associés à des puissances d'un nombre de Pisot. 65-79
- Natasa Jonoska: Sofic Shifts with Synchronizing Presentations. 81-115
- Marc Demange, Vangelis Th. Paschos: On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. 117-141
- Yoram Hirshfeld, Mark Jerrum, Faron Moller: A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. 143-159
- Dany Breslauer: Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. 177-192
- Sarah Mocas: Separating Classes in the Exponential-Time Hierarchy From Classes in PH. 221-231
- Yoshikane Takahashi: Solving Optimization Problems with Variable-Constraint by an Extended Cohen-Grossberg Model. 279-341
- Serge Burckel: Closed Iterative Calculus. 371-378
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team