Journals in DBLP

Theor. Comput. Sci.
1992, volume: 106, number: 2

1. Christiane Frougny
   Confluent Linear Numeration Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:183-219 [Journal]
   
2. Pascal Michel
   Complexity of Logical Theories Involving Coprimality. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:221-241 [Journal]
   
3. Muhammad El-Taha, Shaler Stidham Jr.
   Deterministic Analysis of Queueing Systems with Heterogeneous Servers. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:243-264 [Journal]
   
4. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber
   Fast Geometric Approximation Techniques and Geometric Embedding Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:265-281 [Journal]
   
5. Roland Hausser
   Complexity in Left-Associative Grammar. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:283-308 [Journal]
   
6. Hans L. Bodlaender, Dieter Kratsch
   The Complexity of Coloring Games on Perfect Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:309-326 [Journal]
   
7. J. M. Robson
   More Languages of Generalised Star Height 1. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:327-335 [Journal]
   
8. Roger Villemaire
   The Theory of (N, +, Vk, V1) is Undecidable. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:337-349 [Journal]
   
9. Carsten Damm, Christoph Meinel
   Separating Complexity Classes Related to Omega-Decision Trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:106, n:2, pp:351-360 [Journal]
   
10. Shou-Hsuan Stephen Huang, Hongfei Liu, Venkatraman Viswanathan
    A Sublinear Parallel Algorithm for Some Dynamic Programming Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:361-371 [Journal]
    
11. K. G. Subramanian, Rani Siromoney, Lisa Mathew
    Lyndon Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:373-383 [Journal]
    
12. Alexander A. Razborov
    On the Distributional Complexity of Disjointness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:385-390 [Journal]
    
13. Arne Andersson
    Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:391-393 [Journal]
    
14. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
    Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:395-400 [Journal]