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., Hentze, N. & Malmkjær, K. (1996). Resource-bounded partial evaluation. A C M Computing Surveys, 28(2), 329-332. https://doi.org/10.1145/234528.234741

Danvy, O. & Vestergaard, R. (1996). Semantics-based compiling: A case study in type-directed partial evaluation. In H. Kuchen & S. D. Swierstra (Eds.), Programming Languages: Implementations, Logics, and Programs: 8th International Symposium, PLILP '96 Aachen, Germany, September 24–27, 1996 Proceedings (pp. 182-197). Springer. https://doi.org/10.1007/3-540-61756-6_85

Danvy, O. & Vestergaard, R. (1996). Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation. BRICS Report Series, (RS-96-13).

Schwartzbach, M. I. (1996). Static Correctness of Hierarchical Procedures. Theoretical Computer Science, 156(1-2), 177-201. https://doi.org/10.1016/0304-3975(95)00086-0

Andersson, A., Miltersen, P. B., Riis, S. & Thorup, M. (1996). Static dictionaries on AC⁰ RAMs: query time (√log n/log log n) is necessary and sufficient. In 37th Annual Symposium on Foundations of Computer Science, 1996. Proceedings. (pp. 441-450). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1996.548503

Miltersen, P. B., Paterson, M. & Tarui, J. (1996). The asymptotic complexity of merging networks. Journal of the ACM, 43(1), 147-165. https://doi.org/10.1145/227595.227693

Brodal, G. S. & Skyum, S. (1996). The Complexity of Computing the -ary Composition of a Binary Associative Operator. Department of Computer Science, Aarhus University. BRICS Report Series No. 96-42 http://www.brics.dk/RS/96/42/BRICS-RS-96-42.pdf

Bertelsen, O. W. (1996). The Festival Checklist: design as the transformation of artefacts. In PDC '96, Proceedings of the Participatory Design Conference (pp. 93-101). Computer Professionals for Social Responsibility.

Brodal, G. S., Chaudhuri, S. & Radhakrishnan, J. (1996). The randomized complexity of maintaining the minimum. Nordic Journal of Computing, 3(4), 337-351.

Hatcliff, J. & Danvy, O. (1996). Thunks and the λ-calculus. BRICS Report Series, (RS-96-19).

Grønbæk, K. & Trigg, R. H. (1996). Toward a Dexter-based model for open hypermedia: Unifying embedded references and link objects. In Proceedings of the the seventh ACM conference on Hypertext (pp. 149-160). Association for Computing Machinery. https://doi.org/10.1145/234828.234843

Danvy, O. (1996). Type-Directed Partial Evaluation. In Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium (pp. 242-257). Association for Computing Machinery.

Bødker, S. (1996). Understanding computer applications in use - a human activity analysis. In P. Bøgh Andersen, B. Holmquist, H. Klein & R. Possner (Eds.), Signs at work (pp. 325-348). De Gruyter.

Madsen, O. L. & Knudsen, J. L. (1996). Using Object-Orientation as a Common Basis for System Development Education. ACM SIGPLAN Notices, 31(12), 52-62. https://doi.org/10.1145/242604.242618

Brodal, G. S. (1996). Worst-case efficient priority queues. In Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms (pp. 52-58). Society for Industrial and Applied Mathematics.

Klarlund, N., Nielsen, M. & Sunesen, K. (1995). A case study in automated verification based on trace abstractions. BRICS Report Series, (RS-95-54).

Bødker, S. & Christiansen, E. (1995). A conceptual toolbox for designing CSCW applications. In COOP'95: Proceedings of the First International Workshop on the Design of Cooperative Systems (pp. 266-284). INRIA Press.

Bødker, S., Christiansen, E. & Thüring, M. (1995). A conceptual toolbox for designing CSCW applications. Department of Computer Science, Aarhus University.

Nielsen, M., Priese, L. & Sassone, V. (1995). Characterizing behavioural congruences for Petri nets. In I. Lee & S. A. Smolka (Eds.), CONCUR '95: Concurrency Theory: 6th International Conference Philadelphia, PA, USA, August 21-24, 1995 Proceedings (pp. 175-189). Springer. https://doi.org/10.1007/3-540-60218-6_13

Jensen, K. (1995). Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods. Springer. Monographs in theoretical computer science: an EATCS series

Bødker, S., Grønbæk, K. & Kyng, M. (1995). Cooperative Design: Techniques and Experiences from the Scandinavian Scene. In R. Baecker, J. Grudin, W. Buxton & S. Greenberg (Eds.), Readings in Human-Computer Interaction: Toward the Year 2000 (pp. 215). Morgan-Kaufmann.

Grønbæk, K., Kyng, M. & Mogensen, P. H. (1995). Cooperative Experimental System Development - cooperative techniques beyound initial design and analysis. In Proceedings from Computers in Context: Joining Forces in Design: (pp. 20-29). MIT Press.

Kyng, M. (1995). Creating Contexts for Design. In J. M. Carroll (Ed.), Scenario based design: Envisioning work and technology in system development (pp. 85-107). Wiley.

Bødker, S. & Bouvin, N. O. (1995). Deliverable 1.4.2: The EuroCODE conceptual framework: Preliminary. Department of Computer Science, Aarhus University.

Frandsen, G. S., Husfeldt, T., Miltersen, P. B., Rauhe, T. & Skyum, S. (1995). Dynamic algorithms for the Dyck languages. 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. 98-108). Springer. https://doi.org/10.1007/3-540-60220-8_54

Schwartzbach, M. I., Kozen, D. & Palsberg, J. (1995). Efficient Recursive Subtyping. Mathematical Structures in Computer Science, 5(1), 113-125.

Engberg, U. H. & Larsen, K. S. (1995). Efficient Simplification of Bisimulation Formulas. In E. Brinksma, R. Cleaveland, K. G. Larsen, T. Margaria & B. Steffen (Eds.), TACAS '95: Tools and Algorithms for Construction and Analysis of Systems, First International Workshop (pp. 111-132). Springer LNCS.

Danvy, O., Malmkjær, K. & Palsberg, J. (1995). Eta-Expansion Does The Trick. BRICS 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 & 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 & 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 & 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. BRICS 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

Displaying results 5501 to 5550 out of 5916

111