Journals in DBLP

Theor. Comput. Sci.
1998, volume: 191, number: 1-2

1. Patrice Naudin, Claude Quitté
   Univariate Polynomial Factorization Over Finite Fields. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:1-36 [Journal]
   
2. Victor L. Selivanov
   Fine Hierarchy of Regular Omega-Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:37-59 [Journal]
   
3. Christiane Frougny, Jacques Sakarovitch
   Synchronisation déterministe des automates à délai borné. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:61-77 [Journal]
   
4. Douadi Mihoubi
   Characterization and Closure Properties of Linear Omega-Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:79-95 [Journal]
   
5. Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
   Parameterized Circuit Complexity and the W Hierarchy. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:97-115 [Journal]
   
6. Véronique Bruyère, Denis Derencourt, Michel Latteux
   The Meet Operation in the Lattice of Codes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:117-129 [Journal]
   
7. Dany Breslauer
   The Suffix Tree of a Tree and Minimizing Sequential Transducers. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:131-144 [Journal]
   
8. Antoni Koscielski, Leszek Pacholski
   Makanin's Algorithm is not Primitive Recursive. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:145-156 [Journal]
   
9. Thomas S. Ferguson
   Some Chip Transfer Games. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:191, n:1-2, pp:157-171 [Journal]
   
10. Valtteri Niemi, Ari Renvall
    Secure Multiparty Computations Without Computers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:173-183 [Journal]
    
11. Steven M. Kautz
    An Improved Zero-One Law for Algorithmically Random Sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:185-192 [Journal]
    
12. Gerd Eriksson, Henrik Eriksson, Kimmo Eriksson
    Moving a Food Trolley Around a Corner. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:193-203 [Journal]
    
13. Martin Middendorf
    Shortest Common Superstrings and Scheduling with Coordinated Starting Times. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:205-214 [Journal]
    
14. Oded Goldreich, Bernd Meyer
    Computational Indistinguishability: Algorithms vs. Circuits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:215-218 [Journal]
    
15. Jing Wang
    Finite Derivation Type for Semi-Direct Products of Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:219-228 [Journal]
    
16. Eric Angel, Vassilis Zissimopoulos
    Autocorrelation Coefficient for the Graph Bipartitioning Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:229-243 [Journal]
    
17. Richard Beigel, William I. Gasarch, Ming Li, Louxin Zhang
    Addition in log₂n + O(1) Steps on Average: A Simple Analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:245-248 [Journal]