Aarhus Universitets segl

Publikationer

Søg publikationer fra Institut for Datalogi

Liste over publikationer af videnskabelige medarbejdere fra Institut for Datalogi, Aarhus Universitet.

Sortér efter: Dato | Forfatter | Titel

Grønbæk, K. & Trigg, R. H. (1996). Toward a Dexter-based model for open hypermedia: Unifying embedded references and link objects. I Proceedings of the the seventh ACM conference on Hypertext (s. 149-160). Association for Computing Machinery. https://doi.org/10.1145/234828.234843
Danvy, O. (1996). Type-Directed Partial Evaluation. I Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium (s. 242-257). Association for Computing Machinery.
Bødker, S. (1996). Understanding computer applications in use - a human activity analysis. I P. Bøgh Andersen, B. Holmquist, H. Klein & R. Possner (red.), Signs at work (s. 325-348). De Gruyter.
Brodal, G. S. (1996). Worst-case efficient priority queues. I Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms (s. 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. I COOP'95: Proceedings of the First International Workshop on the Design of Cooperative Systems (s. 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. I I. Lee & S. A. Smolka (red.), CONCUR '95: Concurrency Theory: 6th International Conference Philadelphia, PA, USA, August 21-24, 1995 Proceedings (s. 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. I R. Baecker, J. Grudin, W. Buxton & S. Greenberg (red.), Readings in Human-Computer Interaction: Toward the Year 2000 (s. 215). Morgan-Kaufmann.
Grønbæk, K., Kyng, M. & Mogensen, P. H. (1995). Cooperative Experimental System Development - cooperative techniques beyound initial design and analysis. I Proceedings from Computers in Context: Joining Forces in Design: (s. 20-29). MIT Press.
Kyng, M. (1995). Creating Contexts for Design. I J. M. Carroll (red.), Scenario based design: Envisioning work and technology in system development (s. 85-107). Wiley.
Greenbaum, J. & Kyng, M. (1995). Design challenge - creating a mosaic out of chaos. 195-196. Afhandling præsenteret på Proceedings of the Conference on Human Factors in Computing Systems. Part 2 (of 2), Denver, CO, USA. https://doi.org/10.1145/223355.223510
Frandsen, G. S., Husfeldt, T., Miltersen, P. B., Rauhe, T. & Skyum, S. (1995). Dynamic algorithms for the Dyck languages. I S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (red.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (s. 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. I E. Brinksma, R. Cleaveland, K. G. Larsen, T. Margaria & B. Steffen (red.), TACAS '95: Tools and Algorithms for Construction and Analysis of Systems, First International Workshop (s. 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. I P. Spirakis (red.), Algorithms - ESA '95: Third Annual European Symposium Corfu, Greece, September 25-27, 1995 Proceedings (s. 295-310). Springer. https://doi.org/10.1007/3-540-60313-1_151
Brodal, G. S. (1995). Fast meldable priority queues. I S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (red.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16–18, 1995 Proceedings (s. 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. I D. Coppersmith (red.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (s. 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. I S. Abramsky, D. M. Gabbay & T. S. E. Maibaum (red.), Handbook of Logic in Computer Science: vol. 4: Semantic Modelling (s. 1-148). Oxford University Press.
Nielsen, M. & Cheng, A. (1995). Observing behaviour categorically. I P. S. Thiagarajan (red.), Foundations of Software Technology and Theoretical Computer Science: 15th Conference Bangalore, India, December 18-20, 1995 Proceedings (s. 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. I Proceedings of the twenty-seventh annual ACM symposium on Theory of computing (s. 103-111). Association for Computing Machinery. https://doi.org/10.1145/225058.225093
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). I A. De Santis (red.), Advances in Cryptology - EUROCRYPT'94: Workshop on the Theory and Application of Cryptographic Techniques Perugia, Italy, May 9-12, 1994 Proceedings (s. 140-155). Springer. https://doi.org/10.1007/BFb0053431
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. I D. Coppersmith (red.), Advances in Cryptology - CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27-31, 1995 Proceedings (s. 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. I B. Blumenthal, J. Gornostaev & C. Unger (red.), Human-Computer Interaction: 5th International Conference, EWHCI '95 Moscow, Russia, July 3–7 1995 Selected Papers (s. 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). I S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (red.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (s. 482-493). Springer. https://doi.org/10.1007/3-540-60220-8_87
Arge, L. A. (1995). The buffer tree: A new technique for optimal I/O-algorithms. I S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (red.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (s. 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. I J. Staples, P. Eades, N. Katoh & A. Moffat (red.), Algorithms and Computations: 6th International Symposium, ISAAC '95 Cairns, Australia, December 4-6, 1995 Proceedings (s. 82-91). Springer. https://doi.org/10.1007/BFb0015411
Nielsen, M. & Winskel, G. (1995). Trace Structures and Other Models for Concurrency. I V. Diekert & G. Rozenberg (red.), The Book of Traces (s. 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. I Y. Engeström & D. Middleton (red.), Cognition and communication at work (s. 130-158). Cambridge University Press.