Journals in DBLP
Joaquim Gabarró , Conrado Martinez , Xavier Messeguer A Design of a Parallel Dictionary Using Skip Lists. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:1-33 [Journal ] Michel Koskas About the p-Paperfolding Words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:35-51 [Journal ] Afonso Ferreira , Miltos D. Grammatikakis Randomized Routing on Generalized Hypercubes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:53-64 [Journal ] Stéphane Fabre Dépendance de systèmes de numération associés à des puissances d'un nombre de Pisot. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:65-79 [Journal ] Natasa Jonoska Sofic Shifts with Synchronizing Presentations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:81-115 [Journal ] Marc Demange , Vangelis Th. Paschos On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:117-141 [Journal ] Yoram Hirshfeld , Mark Jerrum , Faron Moller A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:143-159 [Journal ] Taishin Y. Nishida , Arto Salomaa Slender 0L Languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:161-176 [Journal ] Dany Breslauer Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:177-192 [Journal ] Manindra Agrawal , Vikraman Arvind Geometric Sets of Low Information Content. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:193-219 [Journal ] Sarah Mocas Separating Classes in the Exponential-Time Hierarchy From Classes in PH. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:221-231 [Journal ] G. Ramalingam , Thomas W. Reps On the Computational Complexity of Dynamic Graph Problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:233-277 [Journal ] Yoshikane Takahashi Solving Optimization Problems with Variable-Constraint by an Extended Cohen-Grossberg Model. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:279-341 [Journal ] Uri Zwick , Mike Paterson The Complexity of Mean Payoff Games on Graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:343-359 [Journal ] Manindra Agrawal , Vikraman Arvind Quasi-Linear Truth-Table Reductions to p-Selective Sets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:361-370 [Journal ] Serge Burckel Closed Iterative Calculus. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:371-378 [Journal ]