Journals in DBLP
G. Braga , G. Cattaneo , Paola Flocchini , C. Quaranta Vogliotti Pattern Growth in Elementary Cellular Automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:1-26 [Journal ] G. Srikrishna , C. Pandu Rangan Optimal Parallel Algorithms for Path Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:27-43 [Journal ] Yuri Breitbart , Harry B. Hunt III , Daniel J. Rosenkrantz On the Size of Binary Decision Diagrams Representing Boolean Functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:45-69 [Journal ] Ernst L. Leiss Implicit Language Equations: Existence and Uniqueness of Solutions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:71-93 [Journal ] Krzysztof Diks , Evangelos Kranakis , Adam Malinowski , Andrzej Pelc Anonymous Wireless Rings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:95-109 [Journal ] Nadia Creignou The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:111-145 [Journal ] Iain A. Stewart Complete Problems for Monotone NP. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:147-157 [Journal ] Frank Drewes , Annegret Habel , Hans-Jörg Kreowski , Stefan Taubenberger Generating Self-Affine Fractals by Collage Grammars. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:159-187 [Journal ] Jiazhen Cai , Robert Paige Using Multiset Discrimination to Solve Language Processing Problems Without Hashing. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:189-228 [Journal ] Christophe Reutenauer , Marcel Paul Schützenberger Variétés et fonctions rationnelles. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:229-240 [Journal ] Ker-I Ko A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:241-270 [Journal ] Ofer Biran , Shlomo Moran , Shmuel Zaks Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:271-290 [Journal ] Seymour Ginsburg , Katsumi Tanaka Interval Queries on Object Histories. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:291-316 [Journal ] Martin Middendorf On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:317-327 [Journal ] Beverly Jamison , Stephan Olariu A Linear-Time Recognition Algorithm for P4-Reducible Graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:329-344 [Journal ] Liang Zhang , Zhonghui Shen Completion of Recognizable Bifix Codes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:345-355 [Journal ] Gary Benson A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:357-369 [Journal ] Lane A. Hemaspaandra , Zhigen Jiang P-Selectivity: Intersections and Indices. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:371-380 [Journal ] Shang-Hua Teng Independent Sets Versus Perfect Matchings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:381-390 [Journal ] Oded Maler A Decomposition Theorem for Probabilistic Transition Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:391-396 [Journal ]