The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1996, volume: 158, number: 1&2

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Serge Burckel
    Closed Iterative Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:371-378 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002