default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 1
Volume 1, Number 1, March 1990
- Claire Kenyon, Andrew Chi-Chih Yao:
On Evaluating Boolean Functions with Unreliable Tests. 1-10 - Ahmed Saoudi, David E. Muller, Paul E. Schupp:
On the Complexity of omega-Tree Sets and Nerode Theorem. 11-22 - V. S. Subrahmanian:
A Ring-Theoretic Basis for Logic Programming. 23-48 - Marek A. Suchenek:
Applications of Lyndon Homomorphism Theorems to the Theory of Minimal Models. 49-60 - W.-D. Wei:
On A Personnel Assignment Problem. 61-70 - Franco P. Preparata:
Planar Point Location Revisited (Review Paper). 71-86
Volume 1, Number 2, June 1990
- Emanuela Fachini, Jozef Gruska, Andrea Maggiolo-Schettini, Davide Sangiorgi:
Simulation of Systolic Tree Automata on Trellis Automata. 87-110 - Giorgio Ausiello, Marco Protasi:
Limiting Polynomial Approximation of Complexity Classes. 111-122 - Sergio De Agostino, Rossella Petreschi:
Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. 123-130 - Keqin Li, Kam-Hoi Cheng:
Generalized First-Fit Algorithms in Two and Three Dimensions. 131-150 - Roberto Barbuti, Maurizio Martelli:
Recognizing Non-Floundering Logic Programs and Goals. 151-164
Volume 1, Number 3, September 1990
- Franco Barbanera:
Combining Term Rewriting and Type Assignment Systems. 165-184 - Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi:
Deadlock Prediction in the Case of Dynamic Routing. 185-200 - Danilo Bruschi, Deborah Joseph, Paul Young:
Strong Separations for the Boolean Hierarchy over RP. 201-218 - Alessandra Cherubini, Claudio Citrini, Stefano Crespi-Reghizzi, Dino Mandrioli:
Breath and Depth Grammars and Deque Automata. 219-232 - Stefania Costantini:
Semantics of a Metalogic Programming Language. 233-248 - Moreno Falaschi, Maurizio Gabbrielli, Giorgio Levi, Masaki Murakami:
Nested Guarded Horn Clauses. 249-264 - Massimiliano Goldwurm:
Some Limit Distributions in Analysis of Algorithms for Problems on Trace Languages. 265-276 - Roberto Gorrieri, Ugo Montanari:
Towards Hierarchical Description of Systems: A Proof System for Strong Prefixing. 277-294 - Erich Grädel:
On the Notion of Linear Time Computability. 295-308 - Filippo Mignosi:
Sturmian Words and Ambigous Context-Free Languages. 309-324 - Adolfo Piperno, Enrico Tronci:
Regular Systems in lambda-Calculus. 325-340 - Giuseppe Rosolini:
About Modest Sets. 341-354
Volume 1, Number 4, December 1990
- Robert McNaughton:
The Development of Formal Language Theory Since 1956 (Review Paper). 355-368 - William M. Farmer, Ronald J. Watro:
Redex Capturing in Term Graph Rewriting. 369-386 - Hubert Comon:
Solving Symbolic Ordering Constraints. 387-412 - Manfred Droste, Rüdiger Göbel:
Universal Information Systems. 413-424 - Jyrki Katajainen, Erkki Mäkinen:
Tree Compression and Optimization with Applications. 425-448 - A. P. Korah, M. R. Kaimal:
Dynamic Optimal Binary Search Tree. 449-464 - V. S. Subrahmanian:
Errata: A Ring-Theoretic Basis for Logic Programming. 465-
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 2026-04-17 23:12 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:
