


default search action
Elektronische Informationsverarbeitung und Kybernetik, Band 27
Volume 27, Number 1, 1991
- Paul Molitor:

A Survey on Wiring. J. Inf. Process. Cybern. 27(1): 3-19 (1991) - Henning Fernau:

On Function-limited Lindenmayer Systems. J. Inf. Process. Cybern. 27(1): 21-53 (1991) - Ferucio Laurentiu Tiplea, Toader Jucan, Cristian Masalagiu:

Conditional Petri Net Languages. J. Inf. Process. Cybern. 27(1): 55-66 (1991)
Volume 27, Number 2, 1991
- Jovisa D. Zunic:

Inner and Outer Convex Hull Approximation for Finite Planar Point Sets. J. Inf. Process. Cybern. 27(2): 75-83 (1991) - Uwe Wolter:

An Algebraic Approach to Deduction in Equational Partial Horn Theories. J. Inf. Process. Cybern. 27(2): 85-128 (1991) - Eckhard Manthei:

Domination Theory and Network Reliability Analysis. J. Inf. Process. Cybern. 27(2): 129-139 (1991)
Volume 27, Number 3, 1991
- Matthias Wentzlau:

Preuniquely k-colourable Graphs and k-colouring Matrices. J. Inf. Process. Cybern. 27(3): 151-158 (1991) - Alexander Meduna:

Global Context Conditional Grammars. J. Inf. Process. Cybern. 27(3): 159-165 (1991) - Dietlinde Lau:

On Closed Subsets of Boolean Functions (A New Proof for Post's Theorem). J. Inf. Process. Cybern. 27(3): 167-178 (1991) - Martin Kutrib, Roland Vollmar:

Minimal Time Synchronization in Restricted Defective Cellular Automata. J. Inf. Process. Cybern. 27(3): 179-196 (1991)
Volume 27, Number 4, 1991
- Claudia Leopold:

Reading Data in a Hierarchical Memory. J. Inf. Process. Cybern. 27(4): 207-216 (1991) - Joachim Biskup, János Demetrovics, Leonid Libkin, Ilya B. Muchnik:

On Relational Database Schemes Having Unique Minimal Key. J. Inf. Process. Cybern. 27(4): 217-225 (1991) - Louchka Popova-Zeugmann:

On Time Petri Nets. J. Inf. Process. Cybern. 27(4): 227-244 (1991) - Martin Hartwig, Eckhard Stein, Roland Strobel:

Specification and Implementation of a Tree Interface for Ada. J. Inf. Process. Cybern. 27(4): 245-255 (1991)
Volume 27, Number 5/6, 1991
- Guntram Scheithauer:

A Three-dimensional Bin Packing Algorithm. J. Inf. Process. Cybern. 27(5/6): 263-271 (1991) - Reinhard Röpling-Lenhart:

A Lower Bound for the Length of Snakes. J. Inf. Process. Cybern. 27(5/6): 273-282 (1991) - Gunter Bär:

A Special Problem on Rectangular Floorplans Solvable in Polynomial Time. J. Inf. Process. Cybern. 27(5/6): 283-288 (1991) - Martin Sonntag:

Hamiltonicity and Traceability of the Lexicographic Product of Hypergraphs. J. Inf. Process. Cybern. 27(5/6): 289-301 (1991) - Viliam Geffert:

How to Generate Languages Using Only Two Pairs of Parentheses. J. Inf. Process. Cybern. 27(5/6): 303-315 (1991) - Peter Tittmann, Andrea Blechschmidt:

Reliability Bounds Based on Network Splitting. J. Inf. Process. Cybern. 27(5/6): 317-326 (1991)
Volume 27, Number 7, 1991
- Sos S. Agaian, Arthur A. Petrosian:

On the Relationship between Compression Coefficient, Precision of Reconstruction and Complexity of Calculations. J. Inf. Process. Cybern. 27(7): 335-345 (1991) - David N. Gevorkian:

On Subgroup Subcodes of BCH Codes. J. Inf. Process. Cybern. 27(7): 347-350 (1991) - G. H. Khachatrian, H. A. Shamoyan:

The Cardinality of Uniquely-decodable Codes for Two-User Adder Channel. J. Inf. Process. Cybern. 27(7): 351-355 (1991) - A. H. Mkhitarian:

Multi Asymmetric Error-correcting Code. J. Inf. Process. Cybern. 27(7): 373-376 (1991) - Ludwig Staiger:

On Codes having Dual Distance d'>=k. J. Inf. Process. Cybern. 27(7): 377-383 (1991) - Martin Sonntag:

Corrigendum to: "Hamiltonicity of the Normal Product of Hypergraphs" in: J. Inform. Process. Cybernet. EIK26(1990) 7, 415-433. J. Inf. Process. Cybern. 27(7): 385-386 (1991)
Volume 27, Number 8, 1991
- Heiner Fauck:

Covering Polygons with Rectangles via Edge Coverings of Bipartite Permutation Graphs. J. Inf. Process. Cybern. 27(8): 391-409 (1991) - Juraj Hromkovic, Ladislav Janiga, Václav Koubek:

Variable Multihead Machines. J. Inf. Process. Cybern. 27(8): 411-424 (1991) - Manfred Koebe:

Tolerance Graphs and Trapezoid Graphs. J. Inf. Process. Cybern. 27(8): 425-431 (1991) - Li Sek Su:

Relationships Between Classes of Petri Net Language. J. Inf. Process. Cybern. 27(8): 433-443 (1991)

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














