Aarhus University Seal

Publications

Search for publications at Department of Computer Science

Below you find a complete list of publications published and edited by scientists at the Department of Computer Science

Sort by: Date | Author | Title

Nielsen, M. (1986). A Programming Language for Lindenmayer Systems. In G. Rozenberg & A. Salomaa (Eds.), The Book of L (pp. 333-344). Springer.
Mayoh, B. H. (1986). A Uniform Model for the Growth of Biological Organisms: Cooperating Sequential Processes. In G. Rozenberg & A. Salomaa (Eds.), The Book of L (pp. 291-302). Springer.
Bødker, S. & Halskov, K. (1986). More or Less Systems Description. In M. Lassen & L. Mathiassen (Eds.), Report of the Eighth Scandinavian Research Seminar on Systemeering (pp. 57-67). Department of Computer Science, Aarhus University.
Fernández, C., Nielsen, M. & Thiagarajan, P. S. (1986). Notions of Realizable Non-Sequential Processes. Department of Computer Science, Aarhus University.
Jensen, K., Jensen, A. M., Jepsen, L. O. & Huber, P. (1986). Reachability Trees for High-level Petri Nets. Theoretical Computer Science, 45(3), 261-292. https://doi.org/10.1016/0304-3975(86)90046-0
Skyum, S. & Eriksen, O. (1986). Symmetric Distributed Termination. In G. Rozenberg & A. Salomaa (Eds.), The Book of L (pp. 427-430). Springer.
Skyum, S. & Valiant, L. (1985). A complexity theory based on Boolean algebra. Journal of the ACM, 32(2), 484-502. https://doi.org/10.1145/3149.3158
Frandsen, G. S. (1985). A Denotational Semantics for Logic Programming. Department of Computer Science, Aarhus University.
Kristensen, B. B., Madsen, O. L., Møller-Pedersen, B. & Nygaard, K. (1985). An Algebra for Program Fragments. In SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments (pp. 161-170). Association for Computing Machinery. https://doi.org/10.1145/800225.806837
Jensen, K. (1985). An Introduction to High-level Petri Nets. In Proceedings of the 1985 International Symposium on Circuits and Systems: Kyoto 85 (pp. 723-726). IEEE.
Férnandez, C., Nielsen, M. & Thiagarajan, P. S. (1985). A note on observable occurrence nets. In G. Rozenberg (Ed.), Advances in Petri Nets 1984 (pp. 122-138). Springer. https://doi.org/10.1007/3-540-15204-0_8
Frandsen, G. S. (1985). Learnability. Department of Computer Science, Aarhus University.
Frandsen, G. S. (1985). Logic programming and substitutions. In L. Budach (Ed.), Fundamentals of Computation Theory: FCT '85 Cottbus, GDR, September 9–13, 1985 (pp. 146-158). Springer. https://doi.org/10.1007/BFb0028799
Madsen, O. L., Møller-Pedersen, B. & Nygaard, K. (1985). Multi-sequential execution in the BETA programming language. ACM SIGPLAN Notices, 20(4), 57-69. https://doi.org/10.1145/988316.988322
Østerby, O. (1985). Step Change Strategies for Multistep Methods. Department of Computer Science, Aarhus University. Daimi Report Series (DAIMI PB) No. 196
Jensen, K. (1985). The Design of a Program Package for an Introductory Petri Net Course. In G. Rozenberg, H. Genrich & G. Roucairol (Eds.), Advances in Petri Nets 1984 (Vol. 188, pp. 259-266). Springer. https://doi.org/10.1007/3-540-15204-0_15
Huber, P., Jensen, A. M., Jepsen, L. O. & Jensen, K. (1985). Towards Reachability Trees for High-level Petri Nets. In G. Rozenberg, H. J. Genrich & G. Roucairol (Eds.), Advances in Petri Nets 1984, Proceedings (pp. 215-233). Springer. https://doi.org/10.1007/3-540-15204-0_13
Bødker, S. (1985). UTOPIA and the Design of User Interfaces. In Precedings of the Working Conference on Development and Use of Computer-based Systems and Tools (pp. 109-124). Department of Computer Science, Aarhus University.
Ehn, P. & Kyng, M. (1984). A tool perspective on design of interactive computer support for skilled workers. In M. Sääksjärvi (Ed.), Proceedings from the seventh Scandinavian Research Seminar on Systemeering (pp. 211-242). Helsinki School of Economics.
Nielsen, M. & Thiagarajan, P. S. (1984). Degrees of non-determinism and concurrency: A Petri net view. In M. Joseph & R. Shyamasundar (Eds.), Foundations of Software Technology and Theoretical Computer Science: Fourth Conference, Bangalore, India December 13-15, 1984 Proceedings (pp. 89-117). Springer. https://doi.org/10.1007/3-540-13883-8_66
Bødker, S. & Hammerskov, J. (1984). ISAC - A Case Study of Systems Description Tools. In M. Sääksjärvi (Ed.), Proceedings from the Seventh Scandinavian Research Seminar on Systemeering (pp. 201-210)
Bødker, S. & Hammerskov, J. (1984). ISAC - A Case Study of Systems Despription Tools. Department of Computer Science, Aarhus University.
Gear, C. W. & Østerby, O. (1984). Solving Ordinary Differential Equations with Discontinuities. A C M Transactions on Mathematical Software, 10(1), 23-44. https://doi.org/10.1145/356068.356071
Kristensen, B. B., Madsen, O. L., Møller-Pedersen, B. & Nygaard, K. (1983). Abstraction Mechanisms in the BETA Programming Language. In Tenth ACM Symposium on Principles of Programming Languages (pp. 285-298). Association for Computing Machinery. https://doi.org/10.1145/567067.567094
Østerby, O. & Zlatev, Z. (1983). Direct Methods for Sparces Matrices. Springer. Lecture Notes in Computer Science No. 157
Valiant, L. G., Skyum, S., Berkowitz, S. & Rackoff, C. (1983). Fast Parallel Computation of Polynomials Using Few Processors. S I A M Journal on Computing, 12(4), 641-644. https://doi.org/10.1137/0212043
Madsen, O. L., Kristensen, B. B. & Nygaard, K. (1983). From SIMULA 67 to BETA. Paper presented at SIMULA 67 User's Conference, Paris, France.
Jensen, K. (1983). High-level Petri Nets. In A. Pagnoni & G. Rozenberg (Eds.), Applications and Theory of Petri Nets: Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets, Varenna, Italy, September 27-30, 1982 (Vol. 66, pp. 166-180). Springer.
Kyng, M. (1983). Specification and Verification of Networks in a Petri Net Based Language. In A. Pagnoni & G. Rozenberg (Eds.), Applications and Theory of Petri Nets: Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets (pp. 181-198). Springer.
Ehn, P., Kyng, M. & Sundblad, Y. (1983). The UTOPIA Project. In Systems design for with and by the Users: Proceedings of the IFIP WG 9.1 Working Conference North-Holland.
Mehlhorn, K. & Schmidt, E. M. (1982). Las Vegas is better than determinism in VLSI and distributed computing. In STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing (pp. 330-337). Association for Computing Machinery. https://doi.org/10.1145/800070.802208
Jensen, K. & Kyng, M. (1982). Petri Nets and Semantics of System Descriptions. In C. Girault & W. Reisig (Eds.), Application and Theory of Petri Nets: Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets (pp. 64 - 71). Springer.
Kristensen, B. B., Madsen, O. L., Møller-Pedersen, B. & Nygaard, K. (1982). Syntax Directed Program Modularization. In P. Degano & E. Sandewall (Eds.), Integrated interactive computing systems: European Conference on Integrated Computing Systems, ECICS 82, Stresa, Italy, 1-3 September, 1982 North-Holland.
Kyng, M. & Mathiassen, L. (1982). Systems development and trade union activities. Department of Computer Science, Aarhus University.
Kyng, M. & Mathiassen, L. (1982). Systesm development and trade union activities. In N. Björn-Andersen (Ed.), Information Society, for richer, for poorer - Selected conference papers (pp. 247-260). Elsevier.
Engelfriet, J. & Skyum, S. (1982). The copying power of one-state tree transducers. Journal of Computer and System Sciences, 25(3), 418-435. https://doi.org/10.1016/0022-0000(82)90019-8
Skyum, S. & Valiant, L. (1981). A complexity theory based on Boolean algebra. In 22nd Annual Symposium on Foundations of Computer Science, 1981. SFCS '81. (pp. 244-253). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1981.3
Jacobsen, H., Kyng, M. & Mathiassen, L. (1981). EDB til styring, planlægning og kontrol. AOF' Forlag.
Riis, H. & Skyum, S. (1981). k-visit attribute grammars. Theory of Computing Systems, 15(1), 17-28. https://doi.org/10.1007/BF01786970
Valiant, L. & Skyum, S. (1981). Fast parallel computation of polynomials using few processors. In J. Gruska & M. Chytil (Eds.), Mathematical Foundations of Computer Science 1981: Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981 (pp. 132-139). Springer. https://doi.org/10.1007/3-540-10856-4_79
Jensen, K. (1981). How to Find Invariants for Coloured Petri Nets. In J. Gruska & M. Chytil (Eds.), Mathematical Foundations of Computer Science 1981 (Vol. 118, pp. 327-338). Springer. https://doi.org/10.1007/3-540-10856-4_100