Journals in DBLP

Theor. Comput. Sci.
1995, volume: 147, number: 1&2

1. Evripidis Bampis, Jean-Claude König, Denis Trystram
   Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:1-18 [Journal]
   
2. Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
   The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:19-30 [Journal]
   
3. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
   The Parameterized Complexity of Sequence Alignment and Consensus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:31-54 [Journal]
   
4. Claude Sureson
   NP != co-NP and Models of Arithmetic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:55-67 [Journal]
   
5. Klaus Jansen, Haiko Müller
   The Minimum Broadcast Time Problem for Several Processor Networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:69-85 [Journal]
   
6. Taishin Y. Nishida
   Quasi-Deterministic 0L Systems and Their Representation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:87-116 [Journal]
   
7. Allan Cheng, Javier Esparza, Jens Palsberg
   Complexity Results for 1-Safe Nets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:117-136 [Journal]
   
8. Marius Zimand
   On the Topological Size of p-m-Complete Degrees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:137-147 [Journal]
   
9. Gerhard Schurz
   Most General First Order Theorems are not Recursively Enumerable. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:147, n:1&2, pp:149-163 [Journal]
   
10. Philippe Aigrain, Danièle Beauquier
    Polyomino Tilings, Cellular Automata and Codicity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:165-180 [Journal]
    
11. Edoardo Amaldi, Viggo Kann
    The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:181-210 [Journal]
    
12. Didier Arquès, Olivier Grange
    A Fast Scan-Line Algorithm For Topological Filling Of Well-Nested Objects in 2.5D Digital Pictures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:211-248 [Journal]
    
13. Chang-Wu Yu, Gen-Huey Chen
    Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:249-265 [Journal]
    
14. Joë Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
    Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:267-298 [Journal]