default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 101
Volume 101, Number 1, 1992
- Elias Dahlhaus, Johann A. Makowsky:
Query Languages for Hierarchic Databases. 1-32 - Rakesh M. Verma
, I. V. Ramakrishnan:
Tight Complexity Bounds for Term Matching Problems. 33-69 - Jan Stransky:
A Lattice for Abstract Interpretation of Dynamic (LISP-Like) Structures. 70-102 - Dimiter Vakarelov:
A Modal Logic for Cyclic Repeating. 103-122 - Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig:
k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs. 123-129
Volume 101, Number 2, 1992
- Kosaburo Hashiguchi, Kazuya Yamada:
String Matching Problems over Free Partially Commutative Monoids. 131-149 - Raymond T. Ng, V. S. Subrahmanian:
Probabilistic Logic Programming. 150-201 - Andreas Goerdt:
Characterizing Complexity Classes by General Recursive Definitions in Higher Types. 202-218 - Jean-Eric Pin, Howard Straubing, Denis Thérien:
Some Results on the Generalized Star-Height Problem. 219-250 - Daniel J. Dougherty:
Adding Algebraic Rewriting to the Untyped Lambda Calculus. 251-267
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 2025-12-05 22:23 CET 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:
