default search action
Elektronische Informationsverarbeitung und Kybernetik, Band 22
Volume 22, Number 1, January 1986
- Lev A. Kaloujnine, Reinhard Pöschel:
Zur Darstellung und Behandlung algebraisch-kombinatorischer Objekte. J. Inf. Process. Cybern. 22(1): 5-24 (1986) - Rotraut Goebel:
Zn-critical Digraphs. J. Inf. Process. Cybern. 22(1): 25-30 (1986) - Gustav Burosch, Klaus-Dieter Drews:
Maximale Familien bezüglich einer verallgemeinerten Sperner-Bedingung. J. Inf. Process. Cybern. 22(1): 31-43 (1986) - Konrad Engel:
A Continuous Version of a Sperner-type Theorem. J. Inf. Process. Cybern. 22(1): 45-50 (1986) - Hartwig Hetzheim:
Minimierung des Einflusses der in der Praxis auftretenden Störungen der Samplingwerte I. Zeitdiskrete Betrachtung. J. Inf. Process. Cybern. 22(1): 51-57 (1986)
Volume 22, Number 2/3, February / March 1986
- Siegfried Gottwald:
Characterizations of the Solvability of Fuzzy Equations. J. Inf. Process. Cybern. 22(2/3): 67-91 (1986) - Erik A. van Doorn:
Some Aspects of the Peakedness Concept in Teletraffic Theory. J. Inf. Process. Cybern. 22(2/3): 93-104 (1986) - Klaus-Dieter Wirth:
Stability Conditions for Single Server Queues with Varying Service Rate. J. Inf. Process. Cybern. 22(2/3): 105-123 (1986) - Wolfgang Preuss:
Formulas for the Availability of Units with Age Replacement Policy. J. Inf. Process. Cybern. 22(2/3): 125-129 (1986) - Hartwig Hetzheim:
Minimierung des Einflusses der in der Praxis auftretenden Störungen der Samplingwerte II. Zeitkontinuierliche Betrachtung und Spektraldarstellung. J. Inf. Process. Cybern. 22(2/3): 131-140 (1986)
Volume 22, Number 4, April 1986
- Dung T. Huynh:
A Simple Proof for the Sump2 Upper Bound of the Inequivalence Problem for Semilinear Sets. J. Inf. Process. Cybern. 22(4): 147-156 (1986) - Paulis Kilkusts:
Another Algorithm Determining the Independence Number of a Graph. J. Inf. Process. Cybern. 22(4): 157-166 (1986) - Gerhard Bergholz:
Modellierung einer EDVA durch ein Bedienungssystem mit virtuellem Bedienungsknoten. J. Inf. Process. Cybern. 22(4): 167-177 (1986) - Pavel Bocharov, Valery Naumov:
Matrix-Geometric Stationary Distribution for the PH/PH/1/r Queue. J. Inf. Process. Cybern. 22(4): 179-186 (1986)
Volume 22, Number 5/6, May / June 1986
- Ludwig Staiger:
Hierarchies of Recursive omega-languages. J. Inf. Process. Cybern. 22(5/6): 219-241 (1986) - Peter Bachmann, Phan Minh Dung:
Nondeterministic Computations - Structure and Axioms. J. Inf. Process. Cybern. 22(5/6): 243-261 (1986) - Andreas Brandstädt, Dieter Kratsch:
On Partitions of Permutations into Increasing and Decreasing Subsequences. J. Inf. Process. Cybern. 22(5/6): 263-273 (1986) - Klaus P. Jantke:
The Recursive Power of Algebraic Semantics. J. Inf. Process. Cybern. 22(5/6): 275-296 (1986) - Hans-Dieter Burkhard:
Adaptive Experiments at Finite Automata. J. Inf. Process. Cybern. 22(5/6): 297-303 (1986) - Rolf Wiehagen:
On the Complexity of Program Synthesis from Examples. J. Inf. Process. Cybern. 22(5/6): 305-323 (1986) - Jan Grabowski:
Unificational Dynamic Logic. J. Inf. Process. Cybern. 22(5/6): 325-338 (1986)
Volume 22, Number 7/8, July / August 1986
- Christoph Meinel:
Symbolic Simulation of Synchronous Parallel Systems. J. Inf. Process. Cybern. 22(7/8): 355-370 (1986) - Manfred Koebe:
Über die Anzahl der Spuren für die Lösung des Kanaltrassierungsproblems. J. Inf. Process. Cybern. 22(7/8): 371-384 (1986) - Eugeniusz Eberbach, Jan R. Just:
Analysis and Synthesis of Fault-tolerant Distributed Computer Systems. J. Inf. Process. Cybern. 22(7/8): 385-409 (1986) - Hoang Kiem, Pham Ngoc Khoi:
Some Aspects of Image Coding Based on Run Length Codes and Chain Codes. J. Inf. Process. Cybern. 22(7/8): 411-421 (1986) - Hendrik Schäbe:
Ein Erneuerungsprozeß mit Informationsverlusten. J. Inf. Process. Cybern. 22(7/8): 423-428 (1986)
Volume 22, Number 9, September 1986
- Aleksej D. Korshunov:
On the Number of Non-isomorphic Strongly Connected Finite Automata. J. Inf. Process. Cybern. 22(9): 459-462 (1986) - Farit Validov:
On the Standard Star Height of Regular Sets I. J. Inf. Process. Cybern. 22(9): 463-473 (1986) - Roger Labahn:
The Telephone Problem for Trees. J. Inf. Process. Cybern. 22(9): 475-485 (1986) - Walter Eschenbach:
On the Estimation of the Mean Interarrival Time in the System M/GI/1/0 by Observing the Departure Process of Served Demands. J. Inf. Process. Cybern. 22(9): 487-491 (1986)
Volume 22, Number 10/11, October / November 1986
- Helmut Jürgensen, Gabriel Thierrin:
Which Monoids are Syntactic Monoids of omega-Languages? J. Inf. Process. Cybern. 22(10/11): 513-526 (1986) - Erkki Mäkinen:
On Szilard Languages of Pure Context-free Grammars. J. Inf. Process. Cybern. 22(10/11): 527-532 (1986) - Ivan Stojmenovic:
Classification of a Maximal Clone of Three-valued Logical Functions. J. Inf. Process. Cybern. 22(10/11): 533-545 (1986) - Norbert Wischnevski, Karl Weber:
Small Nonplanar Subgraphs of the Cube. J. Inf. Process. Cybern. 22(10/11): 547-552 (1986) - Hans Bandemer, Friedrich Hulsch, Arndt Lehmann:
A Watershed Algorithm Adapted to Functions on Grids. J. Inf. Process. Cybern. 22(10/11): 553-564 (1986) - Søren Asmussen, Helle Johansen:
Über eine Stetigkeitsfrage betreffend das Bedienungssystem GI/GI/s. J. Inf. Process. Cybern. 22(10/11): 565-570 (1986)
Volume 22, Number 12, Dezember 1986
- Karl Weber:
On Components of Random Graphs in the n-Cube. J. Inf. Process. Cybern. 22(12): 601-613 (1986) - Roland Werner:
Kreise im Strukturgraphen eines Netzplanes. J. Inf. Process. Cybern. 22(12): 615-621 (1986) - Karl Straßner:
Zur Dekomposition von Mengensystemen, Booleschen Funktionen und Graphen. J. Inf. Process. Cybern. 22(12): 623-633 (1986) - Andreas Brandt, Hannelore Sulanke:
On the Calculation and Approximation of the Mean Time Between Failure of a System with Two and Three Component Subsystems. J. Inf. Process. Cybern. 22(12): 635-645 (1986)
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.