@inbook{16815,
author = {Klein, P. and Meyer auf der Heide, Friedhelm},
booktitle = {GI - 10. Jahrestagung},
isbn = {9783540103882},
issn = {0343-3005},
title = {{Untere Zeitschranken für das Rucksack-Problem}},
doi = {10.1007/978-3-642-67838-7_34},
year = {1980},
}
@book{15510,
editor = {Hagengruber, Ruth},
isbn = {3882213183},
publisher = {Matthes & Seitz},
title = {{Inseln im Ich}},
year = {1980},
}
@inbook{16813,
author = {Meyer auf der Heide, Friedhelm and Rollik, Anton},
booktitle = {Fundamentals of Computation Theory},
isbn = {9783540108542},
issn = {0302-9743},
title = {{Random access machines and straight-line programs}},
doi = {10.1007/3-540-10854-8_29},
year = {1981},
}
@article{16820,
author = {Meyer auf der Heide, Friedhelm},
issn = {0304-3975},
journal = {Theoretical Computer Science},
pages = {315--322},
title = {{A comparison of two variations of a pebble game on graphs}},
doi = {10.1016/s0304-3975(81)80004-7},
year = {1981},
}
@techreport{8184,
author = {Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich},
publisher = {University of Osnabrück},
title = {{Handling Errors and Exceptions in the Algebraic Specifications of Data Types}},
year = {1981},
}
@inbook{16814,
author = {Meyer auf der Heide, Friedhelm},
booktitle = {Lecture Notes in Computer Science},
isbn = {9783540108566},
issn = {0302-9743},
title = {{Time-processor trade-offs for universal parallel computers}},
doi = {10.1007/3-540-10856-4_111},
year = {1981},
}
@techreport{8185,
author = {Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich},
publisher = {University of Dortmund, Department of Computer Science},
title = {{Operational Semantics of Algebraic Specifications with Conditional Equations}},
year = {1981},
}
@inproceedings{7811,
author = {Engels, Gregor and Schäfer, Wilhelm},
booktitle = {Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)},
pages = {47--62},
publisher = {Hanser},
title = {{Specification of a Programming Support Environment by Graph Grammars}},
year = {1982},
}
@inproceedings{7812,
abstract = {We suppose to give conditional specifications of abstract data types hierarchically. Considering algebraic specifications from an operational point of view this approach enables us to present simple syntactic criteria for the Church-Rosser property, which implies the welldefinedness of the operational semantics of a conditional specification. Furthermore, these criteria are su?cient for the termination of the full substitution reduction strategy.},
author = {Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich},
booktitle = {Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)},
pages = {254--270},
title = {{An Operational Approach to Conditional Algebraic Specifications}},
volume = {82},
year = {1982},
}
@article{16808,
author = {Meyer auf der Heide, Friedhelm},
issn = {0020-0190},
journal = {Information Processing Letters},
pages = {1--2},
title = {{Infinite cube-connected cycles}},
doi = {10.1016/0020-0190(83)90001-7},
year = {1983},
}
@inbook{16810,
author = {Meyer auf der Heide, Friedhelm},
booktitle = {Lecture Notes in Computer Science},
isbn = {3540119736},
title = {{Efficiency of universal parallel computers}},
doi = {10.1007/bfb0036483},
year = {1983},
}
@article{7412,
abstract = {A new approach to an operational treatment of errors and exceptions in specifications of abstract data types is presented. Considering a specification as a term rewriting system, we define an operational semantics and give conditions that are sufficient for its well-definedness (Church-Rosser property). Also, we give conditions that are sufficient for the termination of reduction strategies, respecting the specified error and exception handling.},
author = {Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich},
journal = {Acta Informatica},
number = {3},
pages = {235--254},
title = {{An Operational Semantics for Specifications of Abstract Data Types with Error Handling}},
doi = {http://dx.doi.org/10.1007/BF00265557},
volume = {9},
year = {1983},
}
@inproceedings{16809,
author = {Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83},
isbn = {0897910990},
title = {{A polynomial linear search algorithm for the n-dimensional knapsack problem}},
doi = {10.1145/800061.808734},
year = {1983},
}
@article{16806,
author = {Meyer auf der Heide, Friedhelm},
issn = {0001-5903},
journal = {Acta Informatica},
pages = {269--296},
title = {{Efficiency of universal parallel computers}},
doi = {10.1007/bf00265559},
year = {1983},
}
@article{16807,
author = {Klein, Peter and Meyer auf der Heide, Friedhelm},
issn = {0001-5903},
journal = {Acta Informatica},
pages = {385--395},
title = {{A lower time bound for the knapsack problem on random access machines}},
doi = {10.1007/bf00290735},
year = {1983},
}
@article{7411,
abstract = {The following paper,demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify tbe changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to "specification engineering" using graph grammars. This approach is influenced by the syntactical definition of the underlying language for Programming in the Small, the module concept etc. to be supported on one side but also by the idea of the user interface.},
author = {Engels, Gregor and Gall, Rupert and Nagl, Manfred and Schäfer, Wilhelm},
journal = {Computing},
number = {4},
pages = {317--346},
title = {{Software Specification Using Graph Grammars}},
doi = {http://dx.doi.org/10.1007/BF02251236},
volume = {31},
year = {1983},
}
@inproceedings{8255,
abstract = {The following paper demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify the changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to specification engineering using graph grammars. This approach is influenced by the syntactical definition of the underlying programming language or module concept etc. to be supported but also by the idea of the user interface.},
author = {Nagl, Manfred and Engels, Gregor and Gall, Rupert and Schäfer, Wilhelm},
booktitle = {Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)},
pages = {267--287},
publisher = {Springer},
title = {{Software Specification by Graph Grammars}},
doi = {dx.doi.org/10.1007/BFb0000113},
volume = {153},
year = {1983},
}
@inproceedings{21605,
author = {Domik, Gitta},
booktitle = {ESA IGARSS 84: Remote Sensing: From Res. towards Operational Use,},
title = {{Evaluation of radar stereo viewability by means of a simulation technique}},
volume = {2},
year = {1984},
}
@article{15124,
author = {Domik, Gitta and Kobrick, M and Leberl, Franz},
journal = {Bildmessung und luftbildwesen},
number = {5},
pages = {249--263},
title = {{Analyse von Radarbildern mittels digitaler Hoehenmodelle}},
volume = {52},
year = {1984},
}
@article{16785,
author = {Meyer auf der Heide, Friedhelm},
issn = {0004-5411},
journal = {Journal of the ACM (JACM)},
pages = {668--676},
title = {{A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem}},
doi = {10.1145/828.322450},
year = {1984},
}