default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs39.bht:"
@article{DBLP:journals/tcs/Arnold85, author = {Andr{\'{e}} Arnold}, title = {A Syntactic Congruence for Rational omega-Language}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {333--335}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90148-3}, doi = {10.1016/0304-3975(85)90148-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Arnold85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BackM85, author = {Ralph{-}Johan Back and Heikki Mannila}, title = {On the Suitability of Trace Semantics for Modular Proofs of Communicating Processes}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {47--68}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90130-6}, doi = {10.1016/0304-3975(85)90130-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BackM85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BohmB85, author = {Corrado B{\"{o}}hm and Alessandro Berarducci}, title = {Automatic Synthesis of Typed Lambda-Programs on Term Algebras}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {135--154}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90135-5}, doi = {10.1016/0304-3975(85)90135-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BohmB85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BookO85, author = {Ronald V. Book and Friedrich Otto}, title = {On the Security of Name-Stamp Protocols}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {319--325}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90146-X}, doi = {10.1016/0304-3975(85)90146-X}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BookO85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Bunder85, author = {Martin W. Bunder}, title = {An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {337--342}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90149-5}, doi = {10.1016/0304-3975(85)90149-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Bunder85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Frougny85, author = {Christiane Frougny}, title = {Context-Free Grammars with Cancellation Properties}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {3--13}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90127-6}, doi = {10.1016/0304-3975(85)90127-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Frougny85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GinsburgS85, author = {Seymour Ginsburg and Edwin H. Spanier}, title = {On Completing Tables to Satisfy Functional Dependencies}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {309--317}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90145-8}, doi = {10.1016/0304-3975(85)90145-8}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GinsburgS85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Haken85, author = {Armin Haken}, title = {The Intractability of Resolution}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {297--308}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90144-6}, doi = {10.1016/0304-3975(85)90144-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Haken85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Heintz85, author = {Joos Heintz}, title = {Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {343}, year = {1985}, timestamp = {Fri, 26 Oct 2012 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Heintz85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Hull85, author = {Richard Hull}, title = {Non-Finite Specifiability of Projections of Functional Dependency Families}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {239--265}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90141-0}, doi = {10.1016/0304-3975(85)90141-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Hull85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/IbarraPC85, author = {Oscar H. Ibarra and Michael A. Palis and Jik H. Chang}, title = {On Efficient Recognition of Transductions and Relations}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {89--106}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90132-X}, doi = {10.1016/0304-3975(85)90132-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/IbarraPC85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JosephY85, author = {Deborah Joseph and Paul Young}, title = {Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in {NP}}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {225--237}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90140-9}, doi = {10.1016/0304-3975(85)90140-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/JosephY85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Kannan85, author = {Ravindran Kannan}, title = {Solving Systems of Linear Equations over Polynomials}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {69--88}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90131-8}, doi = {10.1016/0304-3975(85)90131-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Kannan85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KapurNKM85, author = {Deepak Kapur and Paliath Narendran and Mukkai S. Krishnamoorthy and Robert McNaughton}, title = {The Church-Rosser Property and Special Thue Systems}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {123--133}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90134-3}, doi = {10.1016/0304-3975(85)90134-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KapurNKM85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LassezM85, author = {Jean{-}Louis Lassez and Michael J. Maher}, title = {Optimal Fixedpoints of Logic Programs}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {15--25}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90128-8}, doi = {10.1016/0304-3975(85)90128-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LassezM85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Leiss85b, author = {Ernst L. Leiss}, title = {On Solving Star Equations}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {327--332}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90147-1}, doi = {10.1016/0304-3975(85)90147-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Leiss85b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MahaneyY85, author = {Stephen R. Mahaney and Paul Young}, title = {Reductions Among Polynomial Isomorphism Types}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {207--224}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90139-2}, doi = {10.1016/0304-3975(85)90139-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MahaneyY85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ParigotP85, author = {Michel Parigot and Elisabeth Pelz}, title = {A Logical Approach of Petri Net Languages}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {155--169}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90136-7}, doi = {10.1016/0304-3975(85)90136-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ParigotP85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Priese85, author = {Lutz Priese}, title = {On a Fast Decomposition Method in Some Models of Concurrent Computations}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {107--121}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90133-1}, doi = {10.1016/0304-3975(85)90133-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Priese85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Rodriguez-Artalejo85, author = {Mario Rodr{\'{\i}}guez{-}Artalejo}, title = {Some Questions about Expressiveness and Relative Completeness in Hoare's Logic}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {189--206}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90138-0}, doi = {10.1016/0304-3975(85)90138-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Rodriguez-Artalejo85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SiromoneyD85, author = {Rani Siromoney and V. Rajkumar Dare}, title = {On Infinite Words Obtained by Selective Substitution Grammars}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {281--295}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90143-4}, doi = {10.1016/0304-3975(85)90143-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/SiromoneyD85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Spehner85, author = {Jean{-}Claude Spehner}, title = {Syst{\`{e}}mes Entiers d'{\'{E}}quations sur un Alphabet Fini et Conjecture d'Ehrenfeucht}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {171--188}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90137-9}, doi = {10.1016/0304-3975(85)90137-9}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Spehner85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Stirling85, author = {Colin Stirling}, title = {A Proof-Theoretic Characterization of Observational Equivalence}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {27--45}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90129-X}, doi = {10.1016/0304-3975(85)90129-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Stirling85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/VogelW85, author = {J{\"{o}}rg Vogel and Klaus W. Wagner}, title = {Two-Way Automata with More than one Storage Medium}, journal = {Theor. Comput. Sci.}, volume = {39}, pages = {267--280}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90142-2}, doi = {10.1016/0304-3975(85)90142-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/VogelW85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.