Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 119
Volume 119, Number 1 1993
- Kablan Barbar:
Attributed Tree Grammars. 3-22 - Marc-Michel Corsini, Kaninda Musumbu:
Type Inference in Prolog: A New Approach. 23-38 - Philippe Devienne, Patrick Lebègue, Max Dauchet:
Weighted Systems of Equations. 39-62 - Alexander Ja. Dikovsky:
On the Computational Complexity of Prolog Programs. 63-102 - Walter Dosch:
On a Generalized Product of Domains. 103-125 - Zineb Habbas:
A Compete Modal Proof for HAL: the Herbrand Agent Language. 127-143 - Alexander A. Letichevsky, Julia V. Kapitonova, S. V. Konozenko:
Computations in APS. 145-171 - Valery A. Nepomniaschy, A. A. Sulimov:
Problem-Oriented Verification System and its Application to Linear Algebra Programs. 173-185 - Vladimir Yu. Sazonov:
Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability. 187-214 - Anatol Slissenko:
On Fault Tolerance of Syntax. 215-222 - Mars K. Valiev:
Product 1 over 1-Universality of Some Propositional Logics of Concurrent Programs. 223-232
Volume 119, Number 2 1993
- Miroslaw Kutylowski:
Stack versus Sensitivity for One-Way Automata. 233-245 - Alberto Apostolico, Andrzej Ehrenfeucht:
Efficient Detection of Quasiperiodicities in Strings. 247-265 - Jean-Camille Birget:
Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity. 267-291 - Marius Zimand:
If not Empty, NP - P is Topologically Large. 293-310 - Walter Stromquist
, Daniel Ullman:
Sequential Compounds of Combinatorial Games. 311-321 - David Wolfe:
Snakes in Domineering Games. 323-329 - Roberto Tamassia, Ioannis G. Tollis:
Dynamic Reachability in Planar Digraphs with One Source and One Sink. 331-343 - Bruce E. Litow, Philippe Dumas:
Additive Cellular Automata and Algebraic Series. 345-354 - B. John Oommen, David T. H. Ng:
An Optimal Absorbing List Organization Strategy with Constant Memory Requirements. 355-361 - Tao Jiang, Ming Li:
On the Complexity of Learning Strings and Sequences. 363-371
a service of 
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.
last updated on 2024-04-25 05:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
