default search action
Information and Computation, Volume 110
Volume 110, Number 1, 1994
- Jonathan Sorenson
:
Polylog Depth Circuits for Integer Factoring and Discrete Logarithms. 1-18 - Peter Thanisch, George Loizou, Jyrki Nummenmaa:
Finding Compact Scheme Forests in Nested Normal Form is NP-Hard. 19-41 - Raymond T. Ng, V. S. Subrahmanian:
Stable Semantics for Probabilistic Deductive Databases. 42-83 - Ludek Kucera, Alberto Marchetti-Spaccamela
On Learning Monotone DNF Formulae under Uniform Distributions. 84-95 - Jerry L. Trahan
Parallel Random Access Machines with both Multiplication and Shifts. 96-118 - Steven Homer, Jie Wang:
Immunity of Complete Problems. 119-129 - Marc J. van Kreveld, Mark H. Overmars:
Concatenable Structures for Decomposable Problems. 130-148 - Bernhard Steffen, Anna Ingólfsdóttir:
Characteristic Formulae for Processes with Divergence. 149-163 - Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On Confluent Semi-commutations: Decidability and Complexity Results. 164-182 - Hagit Attiya
Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty. 183-232 - Guo-Qiang Zhang
A Representation of SFP. 233-263
Volume 110, Number 2, 1994
- Gilles Kahn:
Preface. Inf. Comput. 110(2): iii (1994) - Antonio Bucciarelli, Thomas Ehrhard:
Sequentiality in an Extensional Framework. 265-296 - Thierry Coquand:
An Analysis of Ramsey's Theorem. 297-304 - Patrice Godefroid, Pierre Wolper
A Partial Approach to Model Checking. 305-326 - Joshua S. Hodas, Dale Miller
Logic Programming in a Fragment of Intuitionistic Linear Logic. 327-365 - Dexter Kozen:
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. 366-390 - Daniel Leivant:
A Foundational Delineation of Poly-time. 391-420
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-12-19 22:16 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: