default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElektronische Informationsverarbeitung und Kybernetik, Band 25
Volume 25, Number 1/2, January / February 1989
- Konrad Engel:
About k-optimal Representations of Posets. J. Inf. Process. Cybern. 25(1/2): 3-10 (1989) - Bernhard Thalheim:
On Semantic Issues Connected with Keys in Relational Databases Permitting Null Values. J. Inf. Process. Cybern. 25(1/2): 11-20 (1989) - Frank van Harmelen:
An Overview of Metal-level Architectures for Control in Experts Systems. J. Inf. Process. Cybern. 25(1/2): 21-35 (1989) - János Sztrik:
Asymptotic Reliability Analysis of Some Complex Systems with Repair Operating in Random Environments. J. Inf. Process. Cybern. 25(1/2): 37-43 (1989)
Volume 25, Number 3, March 1989
- Knut Richter, Jozef Vörös:
A Parametric Analysis of the Dynamic Lot-sizing Problem. J. Inf. Process. Cybern. 25(3): 67-73 (1989) - Norbert Grünwald, Karl Weber:
On Optimal Pair Sequences. J. Inf. Process. Cybern. 25(3): 75-86 (1989) - Martin Sonntag:
Hamiltonian Properties of the Cartesian Sum of Hypergraphs. J. Inf. Process. Cybern. 25(3): 87-100 (1989) - Hans-Dietrich Hecker, Dietmar Herwig:
Some NP-hard Polygon Cover Problems. J. Inf. Process. Cybern. 25(3): 101-108 (1989)
Volume 25, Number 4, April 1989
- Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars:
Two Models for the Reconstruction Problem for Dynamic Data Structures. J. Inf. Process. Cybern. 25(4): 131-155 (1989) - Galina Kumicáková-Jirásková:
Chomsky Hierarchy and Communication Complexity. J. Inf. Process. Cybern. 25(4): 157-164 (1989) - Guido Walz:
Die Ermittlung der Komplexität paralleler Prozesse auf Mikro-Computern. J. Inf. Process. Cybern. 25(4): 165-172 (1989)
Volume 25, Number 5/6, May / June 1989
- Hartmut Ehrig, Werner Fey, Horst Hansen, Michael Löwe, Dean Jacobs, Anno Langen, Francesco Parisi-Presicce:
Algebraic Specification of Modules and Configuration Families. J. Inf. Process. Cybern. 25(5/6): 205-232 (1989) - Thomas M. Fischer:
Lower Bound Proofs via Voronoi Diagrams. J. Inf. Process. Cybern. 25(5/6): 233-238 (1989) - Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. J. Inf. Process. Cybern. 25(5/6): 239-243 (1989) - Zdzislaw Habasinski:
Solving Generalized Equations Over Infinite Trees. J. Inf. Process. Cybern. 25(5/6): 245-254 (1989) - Gerhard Lischke:
Types of Separations for Relativized Complexity Classes. J. Inf. Process. Cybern. 25(5/6): 255-262 (1989) - Alberto Pettorossi, Andrzej Skowron:
The Power of the Lambda Abstraction Strategy for Program Derivation. J. Inf. Process. Cybern. 25(5/6): 263-281 (1989) - Gerard R. Renardel de Lavalette:
Modularisation, Parametrisation, Interpolation. J. Inf. Process. Cybern. 25(5/6): 283-292 (1989) - Gisela Schäfer-Richter:
A Time Logic for Hierarchical Modelling of Dynamic Systems. J. Inf. Process. Cybern. 25(5/6): 293-306 (1989)
Volume 25, Number 7, July 1989
- Ahmed M. Rashad:
On Symmetrical Superimposed Codes. J. Inf. Process. Cybern. 25(7): 337-341 (1989) - Andreas Makris:
A Generalized Multi-commodity Location-Allocation Model. J. Inf. Process. Cybern. 25(7): 343-350 (1989) - Eckhard Manthei:
Zusammenhangswahrscheinlichkeit und Möbiusinversion. J. Inf. Process. Cybern. 25(7): 351-359 (1989) - Marlies Reschke, Klaus Denecke:
Ein neuer Beweis für die Ergebnisse von E. L. Post über abgeschlossene Klassen Boolescher Funktionen. J. Inf. Process. Cybern. 25(7): 361-380 (1989)
Volume 25, Number 8/9, August / September 1989
- Bernhard Convent:
Deciding Finiteness, Groundness and Domain Independence of Pure Datalog Queries. J. Inf. Process. Cybern. 25(8/9): 401-416 (1989) - Ingo Wegener, László Zádori:
A Note on the Relations Between Critical and Sensitive Complexity. J. Inf. Process. Cybern. 25(8/9): 417-421 (1989) - Jürgen Dassow:
Graph-theoretical Properties and Chain Code Picture Languages. J. Inf. Process. Cybern. 25(8/9): 423-433 (1989) - Efim B. Kinber:
Inductive Synthesis of Programs for Recursive Functions from Sample Computations. J. Inf. Process. Cybern. 25(8/9): 435-456 (1989) - Behnam Pourbabai:
A Finite Capacity Telecommunication System With Repeated Calls. J. Inf. Process. Cybern. 25(8/9): 457-467 (1989)
Volume 25, Number 10, October 1989
- Juraj Wiedermann:
On the Power of Synchronization. J. Inf. Process. Cybern. 25(10): 499-506 (1989) - Günter Hotz, Thomas Kretschmer:
The Power of the Greibach Normal Form. J. Inf. Process. Cybern. 25(10): 507-512 (1989) - Rainer Kemp:
Binary Search Trees for d-dimensional Keys. J. Inf. Process. Cybern. 25(10): 513-527 (1989) - Gerhard Lischke:
The Quality of Separation Between Polynomial Time and Exponential Time. J. Inf. Process. Cybern. 25(10): 529-534 (1989) - Frank Bauernöppel:
A Parallel Dictionary with Good Amortized Behavior. J. Inf. Process. Cybern. 25(10): 535-541 (1989) - Thomas Zeugmann:
Improved Parallel Computations in the Ring Z/palpha. J. Inf. Process. Cybern. 25(10): 543-547 (1989)
Volume 25, Number 11/12, November / Dezember 1989
- Ulrich Huckenbeck:
An Equivalence Result for Oracle Sets. J. Inf. Process. Cybern. 25(11/12): 561-572 (1989) - János Sztrik, Vladimir V. Anisimov:
Reliability Analysis of a Complex Renewable System with Fast Repair. J. Inf. Process. Cybern. 25(11/12): 573-580 (1989) - Olaf Möller:
A Fast Statistical Procedure Solving Wicksell's Corpuscle Problem. J. Inf. Process. Cybern. 25(11/12): 581-585 (1989) - Kristel Unger:
The Convex Hull Problem on Special Planar Point Sets. J. Inf. Process. Cybern. 25(11/12): 587-601 (1989) - Sándor Horváth:
A Definition and a Generating System for Elementary Sequence Functions. J. Inf. Process. Cybern. 25(11/12): 603-606 (1989) - Albert G. Dragálin:
Some Trends in Automated Reasoning. J. Inf. Process. Cybern. 25(11/12): 607-618 (1989) - Michal Grabowski:
Open Problems Related to Axiomatic Descriptions of Programs. J. Inf. Process. Cybern. 25(11/12): 619-624 (1989)
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-10-31 20:17 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:
