default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 108
Volume 108, Number 1, 1994
- Sauro Tulipani:
Decidability of the Existential Theory of Infinite Terms with Subterm Relation. 1-33 - Hans L. Bodlaender
, Shlomo Moran, Manfred K. Warmuth:
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. 34-50 - Gérard Boudol:
Lambda-Calculi for (Strict) Parallel Functions. 51-127 - Frank S. de Boer, Catuscia Palamidessi:
Embedding as a Tool for Language Comparison. 128-157 - Rafail E. Krichevsky:
Occam's Razor, Partially Specified Boolean Functions, String Matching, and Independent Sets. 158-174
Volume 108, Number 2, 1994
- Takeshi Shinohara:
Rich Classes Inferable from Positive Data: Length-Bounded Elementary Formal Systems. 175-186 - Ricardo A. Baeza-Yates, Gaston H. Gonnet:
Fast String Matching with Mismatches. 187-199 - Johan Håstad, Ingo Wegener, Norbert Wurm, Sang-Zin Yi:
Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC0. 200-211 - Nick Littlestone, Manfred K. Warmuth:
The Weighted Majority Algorithm. 212-261 - Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini:
On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages. 262-285
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:
