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.
8 Publications
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