Theoretical Computer Science, Volume 95

Volume 95, Number 1, 1992

• Victor Vianu, Gottfried Vossen: Conceptual Level Concurrency Control of Relational Update Transactions. 1-42 BibTeX
• Laura Giordano, Alberto Martelli, Gianfranco Rossi: Extending Horn Clause Logic with Implication Goals. 43-74 BibTeX
• Ildikó Sain: Temporal Logics Need Their Clocks. 75-95 BibTeX
• Setsuo Arikawa, Takeshi Shinohara, Akihiro Yamamoto: Learning Elementary Formal Systems. 97-113 BibTeX
• Gianluigi Bellin, Jussi Ketonen: A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation. 115-142 BibTeX
• Bart Jacobs, Ines Margaria, Maddalena Zacchi: Filter Models with Polymorphic Types. 143-148 BibTeX
• Sylviane R. Schwer: Fine Covers of a VAS Language. 159-168 BibTeX
• Joffroy Beauquier: Two Distributed Problems Involving Byzantine Processes. 169-185 BibTeX

Volume 95, Number 2, 1992

• Jean Moulin Ollagnier: Proof of Dejean's Conjecture for Alphabets with 5, 6, 7, 8, 9, 10 and 11 Letters. 187-205 BibTeX
• Patrice Quinton, Yves Robert: Systolic Convolution of Arithmetic Functions. 207-229 BibTeX
• Yuval Rabani, Zvi Galil: On the Space Complexity of Some Algorithms for Sequence Comparison. 231-244 BibTeX
• Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: On-Line Computation of Minimal and Maximal Length Paths. 245-261 BibTeX
• Shuhua Zhang: Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata. 263-277 BibTeX
• Laurent Pierre: Rational Indexes of Generators of the Cone of Context-Free Languages. 279-305 BibTeX
• Joel Spencer: Ulam's Searching Game with a Fixed Number of Lies. 307-321 BibTeX
• Selim G. Akl, Michel Cosnard, Afonso Ferreira: Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. 323-337 BibTeX
• Priti Shankar, B. S. Adiga: Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages. 339-340 BibTeX