![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 95
Volume 95, Number 1, 1992
- Victor Vianu, Gottfried Vossen:
Conceptual Level Concurrency Control of Relational Update Transactions. 1-42 - Laura Giordano
, Alberto Martelli, Gianfranco Rossi
:
Extending Horn Clause Logic with Implication Goals. 43-74 - Ildikó Sain:
Temporal Logics Need Their Clocks. 75-95 - Setsuo Arikawa, Takeshi Shinohara, Akihiro Yamamoto:
Learning Elementary Formal Systems. 97-113 - Gianluigi Bellin, Jussi Ketonen:
A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation. 115-142 - Bart Jacobs, Ines Margaria, Maddalena Zacchi:
Filter Models with Polymorphic Types. 143-148 - Sylviane R. Schwer:
Fine Covers of a VAS Language. 159-168 - Joffroy Beauquier:
Two Distributed Problems Involving Byzantine Processes. 169-185
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 - Patrice Quinton, Yves Robert
:
Systolic Convolution of Arithmetic Functions. 207-229 - Yuval Rabani, Zvi Galil:
On the Space Complexity of Some Algorithms for Sequence Comparison. 231-244 - Giorgio Ausiello, Giuseppe F. Italiano
, Alberto Marchetti-Spaccamela
, Umberto Nanni
:
On-Line Computation of Minimal and Maximal Length Paths. 245-261 - Shuhua Zhang:
Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata. 263-277 - Laurent Pierre:
Rational Indexes of Generators of the Cone of Context-Free Languages. 279-305 - Joel Spencer:
Ulam's Searching Game with a Fixed Number of Lies. 307-321 - Selim G. Akl, Michel Cosnard, Afonso Ferreira:
Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. 323-337 - Priti Shankar, B. S. Adiga:
Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages. 339-340
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.