Journals in DBLP
Christiane Frougny Context-Free Grammars with Cancellation Properties. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:3-13 [Journal ] Jean-Louis Lassez , Michael J. Maher Optimal Fixedpoints of Logic Programs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:15-25 [Journal ] Colin Stirling A Proof-Theoretic Characterization of Observational Equivalence. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:27-45 [Journal ] Ralph-Johan Back , Heikki Mannila On the Suitability of Trace Semantics for Modular Proofs of Communicating Processes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:47-68 [Journal ] R. Kannan Solving Systems of Linear Equations over Polynomials. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:69-88 [Journal ] Oscar H. Ibarra , Michael A. Palis , Jik H. Chang On Efficient Recognition of Transductions and Relations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:89-106 [Journal ] Lutz Priese On a Fast Decomposition Method in Some Models of Concurrent Computations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:107-121 [Journal ] Deepak Kapur , Paliath Narendran , Mukkai S. Krishnamoorthy , Robert McNaughton The Church-Rosser Property and Special Thue Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:123-133 [Journal ] Corrado Böhm , Alessandro Berarducci Automatic Synthesis of Typed Lambda-Programs on Term Algebras. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:135-154 [Journal ] Michel Parigot , Elisabeth Pelz A Logical Approach of Petri Net Languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:155-169 [Journal ] Jean-Claude Spehner Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:171-188 [Journal ] Mario Rodríguez-Artalejo Some Questions about Expressiveness and Relative Completeness in Hoare's Logic. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:189-206 [Journal ] Stephen R. Mahaney , Paul Young Reductions Among Polynomial Isomorphism Types. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:207-224 [Journal ] Deborah Joseph , Paul Young Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:225-237 [Journal ] Richard Hull Non-Finite Specifiability of Projections of Functional Dependency Families. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:239-265 [Journal ] Jörg Vogel , Klaus Wagner Two-Way Automata with More than one Storage Medium. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:267-280 [Journal ] Rani Siromoney , V. Rajkumar Dare On Infinite Words Obtained by Selective Substitution Grammars. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:281-295 [Journal ] Armin Haken The Intractability of Resolution. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:297-308 [Journal ] Seymour Ginsburg , Edwin H. Spanier On Completing Tables to Satisfy Functional Dependencies. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:309-317 [Journal ] Ronald V. Book , Friedrich Otto On the Security of Name-Stamp Protocols. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:319-325 [Journal ] Ernst L. Leiss On Solving Star Equations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:327-332 [Journal ] André Arnold A Syntactic Congruence for Rational omega-Language. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:333-335 [Journal ] Martin W. Bunder An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:337-342 [Journal ] Joos Heintz Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:39, n:, pp:343- [Journal ]