default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 140
Volume 140, Number 1, January 10, 1998
- Douglas A. Cenzer, Jeffrey B. Remmel:
Complexity and Categoricity. 2-25 - Erich Grädel, Yuri Gurevich:
Metafinite Model Theory. 26-81 - Jan Krajícek, Pavel Pudlák:
Some Consequences of Cryptographical Conjectures for S12 and EF. 82-94
Volume 140, Number 2, February 1, 1998
- Mads Dam:
Proving Properties of Dynamic Process Networks. 95-114 - Ron van der Meyden:
Common Knowledge and Update in Finite Environments. 115-157 - Steven H. Low, Nicholas F. Maxemchuk:
A Collusion Problem and Its Solution. 158-182 - Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson
, Hadas Shachnai, Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation. 183-202 - Aaron Feigelson, Lisa Hellerstein:
Conjunctions of Unate DNF Formulas: Learning and Structure. 203-228 - Anne Brüggemann-Klein, Derick Wood:
One-Unambiguous Regular Languages. 229-253 - Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. 254-283
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-11-11 21:34 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:
