Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 8
Volume 8, 1979
- Eljas Soisalon-Soininen:
On the Covering Problem for Left-Recursive Grammars. 1-11 - Mitchell Wand:
Fixed-Point Constructions in Order-Enriched Categories. 13-30 - Wolfgang Bibel:
Tautology Testing with a Generalized Matrix Reduction Method. 31-44 - Franco P. Preparata, David E. Muller:
Finding the Intersection of n Half-Spaces in Time O(n log n). 45-55 - Peter Johansen:
The Generating Function of the Number of Subpatterns of a D0L Sequence. 57-68 - Kosaburo Hashiguchi:
A Decision Procedure for the Order of Regular Events. 69-72 - Krzysztof R. Apt, Jan A. Bergstra, Lambert G. L. T. Meertens:
Recursive Assertions are not enough - or are they? 73-87 - Mila E. Majster-Cederbaum:
Data Types, Abstract Data Types and Their Specification Problem. 89-127 - John E. Hopcroft, Jean-Jacques Pansiot:
On the Reachability Problem for 5-Dimensional Vector Addition Systems. 135-159 - Helmut Prodinger, Friedrich J. Urbanek:
Language Operators Related to Init. 161-175 - Theodore P. Baker, Alan L. Selman:
A Second Step Toward the Polynomial Hierarchy. 177-187 - Leslie G. Valiant:
The Complexity of Computing the Permanent. 189-201 - Pavel Pudlák, Frederick N. Springsteel:
Complexity in Mechanized Hypothesis Formation. 203-225 - Petr Hájek:
Arithmetical Hierarchy and Complexity of Computation. 227-237 - Juris Hartmanis:
Relations Between Diagonalization, Proof Systems, and Complexity Gaps. 239-253 - Jacques Morgenstern:
Une Extension du Theoreme de Winograd. 255-259 - André Arnold, Michel Latteux:
A New Proof of two Theorems about Rational Transductions. 261-263 - Corrado Böhm, Mariangiola Dezani-Ciancaglini, P. Peretti, Simona Ronchi Della Rocca:
A Discrimination Algorithm Inside lambda-beta-Calculus. 265-292 - Joffroy Beauquier:
Generateurs Algebriques et Systemes de Paires Iterantes. 293-323 - Calvin C. Elgot, John C. Shepherdson:
A Semantically Meaningful Characterization of Reducible Flowchart Schemes. 325-357 - Shmuel Winograd:
On Multiplication in Algebraic Extension Fields. 359-377 - Danny Dolev:
Commutation Preperties and Generating Sets Characterize Slices of Various Synchronization Primitives. 379-391 - J. Roger Hindley:
The Discrimination Theorem Holds for Combinatory Weak Reduction. 393-394 - Jean-Michel Autebert:
Une Note sur le Cylindre des Langages Déterministes. 395-399
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-22 20:59 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:
