Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5839 Publications
1984 | Journal Article | LibreCat-ID: 15124
Domik, G., Kobrick, M., & Leberl, F. (1984). Analyse von Radarbildern mittels digitaler Hoehenmodelle. Bildmessung Und Luftbildwesen, 52(5), 249–263.
LibreCat
1983 | Conference Paper | LibreCat-ID: 8255
Nagl, M., Engels, G., Gall, R., & Schäfer, W. (1983). Software Specification by Graph Grammars. In Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany) (Vol. 153, pp. 267–287). Berlin/Heidelberg: Springer. https://doi.org/dx.doi.org/10.1007/BFb0000113
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 7411
Engels, G., Gall, R., Nagl, M., & Schäfer, W. (1983). Software Specification Using Graph Grammars. Computing, 31(4), 317–346. http://dx.doi.org/10.1007/BF02251236
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 7412
Engels, G., Pletat, U., & Ehrich, H.-D. (1983). An Operational Semantics for Specifications of Abstract Data Types with Error Handling. Acta Informatica, 9(3), 235–254. http://dx.doi.org/10.1007/BF00265557
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. Acta Informatica, 269–296. https://doi.org/10.1007/bf00265559
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16807
Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. Acta Informatica, 385–395. https://doi.org/10.1007/bf00290735
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information Processing Letters, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7
LibreCat
| DOI
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83. https://doi.org/10.1145/800061.808734
LibreCat
| DOI
1983 | Book Chapter | LibreCat-ID: 16810
Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0036483
LibreCat
| DOI
1982 | Conference Paper | LibreCat-ID: 7811
Engels, G., & Schäfer, W. (1982). Specification of a Programming Support Environment by Graph Grammars. In Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany) (pp. 47–62). München/Leipzig: Hanser.
LibreCat
1982 | Conference Paper | LibreCat-ID: 7812
Pletat, U., Engels, G., & Ehrich, H.-D. (1982). An Operational Approach to Conditional Algebraic Specifications. In Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France) (Vol. 82, pp. 254–270).
LibreCat
1981 | Report | LibreCat-ID: 8184
Engels, G., Pletat, U., & Ehrich, H.-D. (1981). Handling Errors and Exceptions in the Algebraic Specifications of Data Types. University of Osnabrück.
LibreCat
1981 | Report | LibreCat-ID: 8185
Pletat, U., Engels, G., & Ehrich, H.-D. (1981). Operational Semantics of Algebraic Specifications with Conditional Equations. University of Dortmund, Department of Computer Science.
LibreCat
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, F., & Rollik, A. (1981). Random access machines and straight-line programs. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_29
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111
LibreCat
| DOI
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7
LibreCat
| DOI
1980 | Book Chapter | LibreCat-ID: 16815
Klein, P., & Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_34
LibreCat
| DOI
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming. ICALP 1979, 411–421. https://doi.org/10.1007/3-540-09510-1_32
LibreCat
| DOI
[n.d.] | Journal Article | LibreCat-ID: 15596
Biehler, R., Budde, L., Frischemeier, D., Heinemann, B., Podworny, S., Schulte, C., & Wassong, T. (n.d.). Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts.
LibreCat