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

Danvy, O., Malmkjær, K. & Palsberg, J. (1995). Eta-Expansion Does The Trick. B R I C S Report Series, (RS-95-41).

Arge, L. A., Vengroff, D. E. & Vitter, J. S. (1995). External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. In P. Spirakis (Ed.), Algorithms - ESA '95: Third Annual European Symposium Corfu, Greece, September 25-27, 1995 Proceedings (pp. 295-310). Springer. https://doi.org/10.1007/3-540-60313-1_151

Brodal, G. S. (1995). Fast meldable priority queues. In S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (Eds.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16–18, 1995 Proceedings (pp. 282-290). Springer. https://doi.org/10.1007/3-540-60220-8_70

Nielsen, M. & Clausen, C. (1995). Games and logics for a noninterleaving bisimulation. Nordic Journal of Computing, 2(2), 221-249.

Damgård, I. B., Goldreich, O., Okamoto, T. & Wigderson, A. (1995). Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. In D. Coppersmith (Ed.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (pp. 325-338). Springer. https://doi.org/10.1007/3-540-44750-4_26

Kyng, M. (1995). Making Representations Work. Association for Computing Machinery. Communications, 38(9), 46-55. https://doi.org/10.1145/223248.223261

Nielsen, M. & Winskel, G. (1995). Models for Concurrency. In S. Abramsky, D. M. Gabbay & T. S. E. Maibaum (Eds.), Handbook of Logic in Computer Science: vol. 4: Semantic Modelling (pp. 1-148). Oxford University Press.

Bieniasz, L. K., Østerby, O. & Britz, D. (1995). Numerical stability of finite difference algorithms for electrochemical kinetic simulations: Matrix stability analysis of the classic explicit, fully implicit and Crank-Nicolson methods and typical problems involving mixed boundary conditions. Computers and Chemistry, 19(2), 121-136. https://doi.org/10.1016/0097-8485(94)00054-I

Bieniasz, L. K., Østerby, O. & Britz, D. (1995). Numerical stability of finite difference algorithms for electrochemical kinetic simulations. Matrix stability analysis of the classic explicit, fully implicit and Crank-Nicolson methods, extended to the 3- and 4-point gradient approximation at the electrodes. Computers and Chemistry, 19(4), 351-355. https://doi.org/10.1016/0097-8485(95)00056-X

Bieniasz, L. K., Østerby, O. & Britz, D. (1995). Numerical stability of the Saul'yev finite difference algorithms for electrochemical kinetic simulations: Matrix stability analysis for an example problem involving mixed boundary conditions. Computers and Chemistry, 19(4), 357-370. https://doi.org/10.1016/0097-8485(95)00047-V

Nielsen, M. & Cheng, A. (1995). Observing behaviour categorically. In P. S. Thiagarajan (Ed.), Foundations of Software Technology and Theoretical Computer Science: 15th Conference Bangalore, India, December 18-20, 1995 Proceedings (pp. 263-278). Springer. https://doi.org/10.1007/3-540-60692-0_54

Miltersen, P. B., Nisan, N., Safra, S. & Wigderson, A. (1995). On data structures and asymmetric communication complexity. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing (pp. 103-111). Association for Computing Machinery. https://doi.org/10.1145/225058.225093

Miltersen, P. B. (1995). On the cell probe complexity of polynomial evaluation. Theoretical Computer Science, 143(1), 167-174. https://doi.org/10.1016/0304-3975(95)80032-5

Madsen, O. L. (1995). Open Issues in Object-Oriented Programming. Software: Practice & Experience, 25(S4), 3-43. https://doi.org/10.1002/spe.4380251303

Cheng, A. & Nielsen, M. (1995). Open Maps (at) Work. B R I C S Report Series, (RS-95-23).

Chen, L., Damgård, I. B. & Pedersen, T. P. (1995). Parallel divertibility of proofs of knowledge (Extended abstract). In A. De Santis (Ed.), Advances in Cryptology - EUROCRYPT'94: Workshop on the Theory and Application of Cryptographic Techniques Perugia, Italy, May 9-12, 1994 Proceedings (pp. 140-155). Springer. https://doi.org/10.1007/BFb0053431

Damgård, I. B. (1995). Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology, 8(4), 201-222. https://doi.org/10.1007/BF00191356

Schwartzbach, M. I. & Palsberg, J. (1995). Safety Analysis versus Type Inference. Information and Computation, 118(1), 128-141.

Cramer, R. & Damgård, I. B. (1995). Secure Signature Schemes based on Interactive Protocols. In D. Coppersmith (Ed.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (pp. 297-310). Springer. https://doi.org/10.1007/3-540-44750-4_24

Bardram, J. E. & Bertelsen, O. W. (1995). Supporting the development of transparent interaction. In B. Blumenthal, J. Gornostaev & C. Unger (Eds.), Human-Computer Interaction: 5th International Conference, EWHCI '95 Moscow, Russia, July 3–7 1995 Selected Papers (pp. 79-90). Springer. https://doi.org/10.1007/3-540-60614-9_6

Fich, F. & Miltersen, P. B. (1995). Tables should be sorted (on random access machines). In S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (Eds.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (pp. 482-493). Springer. https://doi.org/10.1007/3-540-60220-8_87

Schwartzbach, M. I., Mosses, P. D. & Nielsen, M. (Eds.) (1995). TAPSOFT'95: Theory and Practice of Software Development: 6th International Joint Conference CAAP/FASE Aarhus, Denmark, May 22-26, 1995 Proceedings. Springer. Lecture Notes in Computer Science Vol. 915 https://doi.org/10.1007/3-540-59293-8

Arge, L. A. (1995). The buffer tree: A new technique for optimal I/O-algorithms. In S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (Eds.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (pp. 334-345). Springer. https://doi.org/10.1007/3-540-60220-8_74

Danvy, O., Malmkjær, K. & Palsberg, J. (1995). The essence of eta-expansion in partial evaluation. Higher-Order and Symbolic Computation, 8(3), 209-227. https://doi.org/10.1007/BF01019004

Arge, L. A. (1995). The I/O-complexity of Ordered Binary-Decision Diagram manipulation: Extended Abstract. In J. Staples, P. Eades, N. Katoh & A. Moffat (Eds.), Algorithms and Computations: 6th International Symposium, ISAAC '95 Cairns, Australia, December 4-6, 1995 Proceedings (pp. 82-91). Springer. https://doi.org/10.1007/BFb0015411

Nielsen, M. & Winskel, G. (1995). Trace Structures and Other Models for Concurrency. In V. Diekert & G. Rozenberg (Eds.), The Book of Traces (pp. 271-306). World Scientific.

Nielsen, M., Rozenberg, G. & Thiagarajan, P. S. (1995). Transition-Systems, Event Structures, and Unfoldings. Information and Computation, 118(2), 191-207. https://doi.org/10.1006/inco.1995.1062

Mogensen, P. H. & Robinson, M. (1995). Triggering Artefacts. AI & Society, 9(4), 373-388. https://doi.org/10.1007/BF01210588

Schwartzbach, M. I., Agesen, O. & Palsberg, J. (1995). Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. Software: Practice & Experience, 25(9), 975-995.

Schwartzbach, M. I., Askari, H. & Hougaard, O. I. (1995). Type Inference of Turbo Pascal. International Journal on Software Tools for Technology Transfer, 16(4), 160-169.

Bødker, S. & Grønbæk, K. (1995). Users and Designers in Mutual Activity - an analysis of cooperative activities in systems design. In Y. Engeström & D. Middleton (Eds.), Cognition and communication at work (pp. 130-158). Cambridge University Press.

Schmidt, E. M. & Skyum, S. (Eds.) (1994). Algorithm Theory — SWAT '94: 4th Scandinavian Workshop on Algorithm Theory Aarhus, Denmark, July 6–8, 1994 Proceedings. Springer. Lecture Notes in Computer Science Vol. 824 https://doi.org/10.1007/3-540-58218-5

Jensen, K. (1994). An Introduction to the Theoretical Aspects of Coloured Petri nets. In J. W. D. Bakker, W.-P. D. Roever & G. Rozenberg (Eds.), A Decade of Concurrency Reflections and Perspectives (Vol. 803, pp. 230-272). Springer. https://doi.org/10.1007/3-540-58043-3

Bertelsen, O. W. (1994). An investigation into the design artefact concept as a vehicle for systems development research. In P. Kerola, A. Juustila & J. Järvinen (Eds.), Proceedings of the 17th Information Systems Research Seminar in Scandinavia (pp. 115-125)

Schwartzbach, M. I. & Palsberg, J. (1994). Binding Time Analysis: Abstract Interpretation versus Type Inference. In Proceedings on IEEE 1994 International Conference on Computer Language (pp. 289-298). IEEE Computer Society Press. https://doi.org/10.1109/ICCL.1994.288372

Nielsen, M. & Clausen, C. (1994). Bisimulation for models in concurrency. In B. Jonsson & J. Parrow (Eds.), CONCUR '94: Concurrency Theory: 5th International Conference Uppsala, Sweden, August 22-25, 1994 Proceedings (pp. 385-400). Springer. https://doi.org/10.1007/BFb0015021

Nielsen, M. & Clausen, C. (1994). Bisimulations, games, and logic. In J. Karhumäki, H. Maurer & G. Rozenberg (Eds.), Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa Graz, Austria, June 10-11, 1994 Proceedings (pp. 289-306). Springer. https://doi.org/10.1007/3-540-58131-6_54

Grønbæk, K. & Malhotra, J. (1994). Building Tailorable Hypermedia Systems: The embedded-interpreter approach. In R. L. Wexelblat (Ed.), Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications (Vol. 29. Issue 10, pp. 85-101). Association for Computing Machinery. https://doi.org/10.1145/191080.191098

Mogensen, P. H. (1994). Challenging Practice: an Approach to Cooperative Analysis. Department of Computer Science, Aarhus University.

Kyng, M. (1994). Collective resources meets puritanism. Scandinavian Journal of Information Systems, 6(1), 85-96.

Miltersen, P. B., Subramanian, S., Vitter, J. S. & Tamassia, R. (1994). Complexity models for incremental computation. Theoretical Computer Science, 130(1), 203-236. https://doi.org/10.1016/0304-3975(94)90159-7

Grønbæk, K. (1994). Composites in a Dexter-Based Hypermedia Framwork. In I. Ritchie & N. Guimaráes (Eds.), Proceedings of the 1994 ACM European Conference on Hypermedia Technology (pp. 59-69). Association for Computing Machinery. https://doi.org/10.1145/192757.192771

Grønbæk, K., Madsen, O. L., Sloth, L. & Hem, J. A. (1994). Cooperative Hypermedia Systems: A Dexter-based architecture. Association for Computing Machinery. Communications, 37(2), 64 - 74. https://doi.org/10.1145/175235.175240

Bødker, S. (1994). Creating conditions for participation: Conflicts and resources in systems design. In Proceedings of PDC '94 (pp. 13-20). Association for Computing Machinery.

Bødker, S. & Knudsen, J. L. (1994). Datalogi i Gymnasiet: en diskussion af bekendtgørelse. EDB og Undervisning, (50). http://www.emu.dk/gym/fag/dl/forening/bladet/pdffiler/nr50.pdf

Ezparza, J. & Nielsen, M. (1994). Decidability in Petri Nets - a Survey. Bulletin of the European Association for Theoretical Computer Science, 52, 244-262.

Ezparza, J. & Nielsen, M. (1994). Decidability issues for Petri Nets. Information Processing and Cybernetics, 30(3), 143-160.

Grønbæk, K. & Trigg, R. H. (1994). Design issues for a Dexter-based hypermedia system. Association for Computing Machinery. Communications, 37(2), 40-49. https://doi.org/10.1145/175235.175238

Schwartzbach, M. I., Kozen, D. & Palsberg, J. (1994). Efficient Inference of Partial Types. Journal of Computer and System Sciences, 49(2), 306-324.

Kyng, M. (1994). Experience with Participative Application Development. In K. Bruunstein & E. Raubold (Eds.), IFIP Transaction. Information Processing: Applications and Impacts (Vol. II, pp. 107-114). North-Holland.

Displaying results 5351 to 5400 out of 5740

108