Publikationer

Søg publikationer fra Institut for Datalogi

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

Wickremesinghe, R., Arge, L. A., Chase, J. S. & Vitter, J. S. (2002). Efficient sorting using registers and caches. Journal of Experimental Algorithmics, 7, 9. https://doi.org/10.1145/944618.944627

Mayoh, B. H., Shafazand, H. (red.) & Tjoa, A. M. (red.) (2002). Evolution of Cooperation in Multiagent Systems. I Proceeding of EurAsia-ICT 2002: Information and Communication Technology (2510 of Lecture Notes in Computer Science udg., s. 701-710). Springer.

Thomsen, R., Guervós, J. J. M. (red.), Adamidis, P. (red.), Beyer, H.-G. (red.), Fernández-Villacañas, J. L. (red.) & Schwefel, H.-P. (red.) (2002). Evolving the Topology of Hidden Markov Models using Evolutionary Algorithms. I Proceedings of the 7th International Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature --- PPSN VII (Lecture Notes in Computer Science udg., Bind 2439/2002, s. 861-870). Springer.

Jørgensen, J. B., Christensen, S., Jezequel, J.-M. (red.), Hussmann, H. (red.) & Cook, S. (red.) (2002). Executable Design Models for a Pervasive Healthcare Middleware System. I Lecture Notes In Computer Science: 5th International Conference on The Unified Modeling Language (Bind 2460, s. 140-149). Springer.

Jørgensen, J. B. & Bossen, C. (2002). Executable Use Cases for Pervasive Healthcare. I MOCA 2002: Second Workshop on Modeling of Objects, Components and Agents (s. 89-103). Datalogi, Aarhus Universitet.

Damgård, I. B. & Nielsen, J. B. (2002). Expanding Pseudorandom Functions: or: From Known-Plaintext Security to Chosen-Plaintext Security. I M. Yung (red.), Advances in Cryptology - CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002 Proceedings (s. 449-464). Springer. https://doi.org/10.1007/3-540-45708-9_29

Fleischer, R., Moret, B. & Schmidt, E. M. (red.) (2002). Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000]. Springer. Lecture Notes in Computer Science Bind 2547 https://doi.org/10.1007/3-540-36383-1

Hansen, K. M. (2002). Experimental Object-Oriented Modelling. Department of Computer Science, Aarhus University.

Ursem, R. K., Filipic, B. & Krink, T. (2002). Exploring the Performance of an Evolutionary Algorithm for Greenhouse Control. Journal of Computing and Information Technology, 10(3), 195-201.

Løvbjerg, M., Krink, T., Fogel, D. B. (red.), Yao, X. (red.), Greenwood, G. (red.), Iba, H. (red.), Marrow, P. (red.) & Shackleton, M. (red.) (2002). Extending Particle Swarm Optimisers with Self-Organized Criticality. I Proceedings of the 2002 Congress on Evolutionary Computation : CEC'02 (Bind 2, s. 1588-1593). IEEE Press.

Arge, L. A. (2002). External-Memory Data Structures. I J. Abello, P. M. Pardalos & M. G. C. Resende (red.), Handbook of Massive Data Sets (s. 313-357). Kluwer Academic Publishers.

Bouvin, N. O., Zellweger, P. T., Grønbæk, K. & Mackinlay, J. D. (2002). Fluid annotations through open hypermedia: Using and extending emerging Web standards. I D. Lassner, D. De Roure & A. Iyengar (red.), Proceedings of the 11th international conference on World Wide Web (s. 160-171). Association for Computing Machinery. https://doi.org/10.1145/511446.511468

Nielsen, M. & Engberg, U. H. (red.) (2002). Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002. Springer. Lecture Notes in Computer Science Bind 2303 https://doi.org/10.1007/3-540-45931-6

Jensen, K. (red.) (2002). Fourth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools: Aarhus, Denmark, August 28-30, 2002. Department of Computer Science, Aarhus University.

Christensen, H. B. & Caspersen, M. E. (2002). Frameworks in CS1: a different way of introducing event-driven programming. I Proceedings of the 7th annual conference on Innovation and technology in computer science education. (s. 75-79). Association for Computing Machinery. https://doi.org/10.1145/544414.544438

Brodal, G. S., Fagerberg, R., Bose, P. (red.) & Morin, P. (red.) (2002). Funnel Heap - A Cache Oblivious Priority Queue. I P. Bose & P. Morin (red.), Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21–23, 2002 Proceedings (s. 219-228). Springer. https://doi.org/10.1007/3-540-36136-7_20

Damgård, I. B. & Koprowski, M. (2002). Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. I L. R. Knudsen (red.), Advances in Cryptology - EUROCRYPT 2002: International Conference on the Theory and Applications of Cryptographic Techniques Amsterdam, The Netherlands, April 28 - May 2, 2002 Proceedings (s. 256-271). Springer. https://doi.org/10.1007/3-540-46035-7_17

Ursem, R. K., Krink, T., Fogel, D. B. (red.), Yao, X. (red.), Greenwood, G. (red.), Iba, H. (red.), Marrow, P. (red.) & Shackleton, M. (red.) (2002). Genetic Programming with Smooth Operators for Arithmetic Expressions: Diviplication and Subdition. I Proceedings of the Evolutionary on Computation 2002.: CEC'02 (Bind 2, s. 1372-1377). IEEE Computer Society Press.

Brabrand, C. & Schwartzbach, M. I. (2002). Growing Languages with Metamorphic Syntax Macros. I P. Thiemann (red.), Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation (s. 31-40). Association for Computing Machinery. https://doi.org/10.1145/503032.503035

Nygaard, M., Winskel, G., Brim, L. (red.), Jancar, P. (red.), Kretínsky, M. (red.) & Kucera, A. (red.) (2002). HOPLA: A Higher-Order Process Language. I Lecture Notes in Computer Science: Proceedings of the 13th International Conference on Concurrency Theory (Bind 2421, s. 434-448). Springer.

Goldberg, M. & Torgersen, M. (2002). How to Circumvent Church Numerals. Nordic Journal of Computing, 9(1), 1-12.

Ratzer, A. V. & Hansen, K. M. (2002). Ideogramic: Flexibility and Formality in Collaborative Diagramming. I Proceedings of the second Nordic conference on Human-computer interaction (s. 291-292). Association for Computing Machinery. https://doi.org/10.1145/572020.572069

Sørensen, T. S., Therkildsen, S. V., Hansen, O. K., Sørensen, K. & Pedersen, E. M. (2002). Images in cardiovascular medicine. Total cavo-pulmonary connection: a virtual 3-dimensional fly-through. Circulation, 105(20), E176-6.

Arge, L. A., Procopiuc, O. & Vitter, J. S. (2002). Implementing I/O-efficient Data Structures Using TPIE. I R. Möhring & R. Raman (red.), Algorithms - ESA 2002: 10th Annual European Symposium Rome, Italy, September 17-21, 2002 Proceedings (s. 161-172). Springer. https://doi.org/10.1007/3-540-45749-6_12

Torgersen, M. (2002). Inheritance is Specialisation. I A. P. Black, E. Ernst, P. Grogono & M. Sakkinen (red.), Object-oriented Technology ECOOP 2002 Workshop Reader (Bind 12, s. 95-101). Springer LNCS.

Hansen, K. M. & Damm, C. H. (2002). Instant collaboration: Using context-aware instant messaging for session management in distributed collaboration tools. I O. W. Bertlesen (red.), Proceedings of the second Nordic conference on Human-computer interaction (s. 279-282). Association for Computing Machinery. https://doi.org/10.1145/572020.572065

Bertelsen, O. W. & Bødker, S. (2002). Interaction through multi-artifacts. I S. Bagnara, S. Pozzi, A. Rizzo & P. K. Wright (red.), Proceedings of the 11th European Conference on Cognitive Ergonomics European Association of Cognitive Ergonomcs.

Møller, A. & Schwartzbach, M. I. (2002). Interactive Web Services with Java. (s. 1-100). Department of Computer Science, Aarhus University. http://www.brics.dk/NS/02/1/BRICS-NS-02-1.pdf

Kyng, M. (2002). IT, samfund og dannelse. I C. Bach-Nielsen (red.), Dannelse, Uddannelse, Universiteter: Festskrift til Henning Lehmann den 31. januar 2002 (s. 77-94). Aarhus Universitetsforlag.

Christensen, A. S. & Møller, A. (2002). JWIG User Manual. BRICS Notes Series, (NS-02-6).

Danvy, O. & Schultz, U. P. (2002). Lambda-Lifting in Quadratic Time. I Z. Hu & M. Rodríguez-Artalejo (red.), Functional and Logic Programming: 6th International Symposium, FLOPS 2002 Aizu, Japan, September 15–17, 2002 Proceedings (s. 134-151). Springer. https://doi.org/10.1007/3-540-45788-7_8

Danvy, O. & Schultz, U. P. (2002). Lambda-Lifting in Quadratic Time. BRICS Report Series, (RS-02-30).

Brabrand, C., Møller, A., Olesen, S. & Schwartzbach, M. I. (2002). Language-Based Caching of Dynamically Generated HTML. World Wide Web (New York), 5(4), 305-323. https://doi.org/10.1023/A:1021020226173

Nygaard, M., Winskel, G. & Plotkin, G. (red.) (2002). Linearity in Process Languages. I Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02) (s. 433-446). IEEE Press.

Awodey, S., Birkedal, L. & Scott, D. S. (2002). Local realizability toposes and a modal logic for computability. Mathematical Structures in Computer Science, 12(3), 319-334. https://doi.org/10.1017/S0960129502003675

Bødker, S. & Christiansen, E. (2002). Lost and Found in Flexibility. I K. Bødker, M. K. Pedersen, J. Simonsen & M. T. Vendelø (red.), Proceedings of the 25th Information Systems Research Seminar in Scandinavia Human-Computer Interaction Resource Network.

Balat, V. & Danvy, O. (2002). Memoization in Type-Directed Partial Evaluation. BRICS Report Series, (RS-02-33).

Balat, V. & Danvy, O. (2002). Memorization in Type-Directed Partial Evaluation. I D. Batory, C. Consel & W. Taha (red.), Generative Programming and Component Engineering: ACM SIGPLAN/SIGSOFT Conference, GPCE 2002 Pittsburgh, PA, USA, October 6–8, 2002 Proceedings (s. 78-92). Springer. https://doi.org/10.1007/3-540-45821-2_5

Ernst, E. (2002). Method Mixins. Daimi Report Series (DAIMI PB), (557).

Lorentsen, L., Tuovinen, A.-P. & Xu, J. (2002). Modelling Feature Interaction Patterns in Nokia Mobile Phones using Coloured Petri Nets and Design/CPN. I Application and Theory of Petri Nets 2002: 23rd International Conference, ICATPN 2002 Adelaide, Australia, June 24-30, 2002 Proceedings (s. 15 - 45). Springer. https://doi.org/10.1007/3-540-48068-4_18

Klarlund, N., Møller, A. & Schwartzbach, M. I. (2002). MONA Implementation Secrets. International Journal of Foundations of Computer Science, 13(4), 571-586. https://doi.org/10.1142/S012905410200128X

Ager, M. S., Danvy, O. & Rohde, H. K. (2002). On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation. I K. Asai (red.), ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation (s. 32-46). Association for Computing Machinery. https://doi.org/10.1145/568173.568177

Ager, M. S., Danvy, O. & Rohde, H. K. (2002). On Obtaining Knuth, Morris, and Pratt's String Matcher by Partial Evaluation. BRICS Report Series, (RS-02-32).

Danvy, O. & Nielsen, L. R. (2002). On One-Pass CPS Transformations. BRICS Report Series, (RS-02-3).

Carbone, M., Maffeis, S., Nestmann, U. (red.) & Panangaden, P. (red.) (2002). On the Expressive Power of Polyadic Synchronisation in π- calculus. I Electronic Notes in Theoretical Computer Science: CONCUR 2002 Satellite Workshops (68(2) of Electronic Notes in TCS udg., Bind Expressiveness in Concurrency, s. 3. artikel). Elsevier Science Publishers.

Nielsen, M., Palamidessi, C. & Valencia, F. D. (2002). On the Expressive Power of Temporal Concurrent Constraint Programming Languages. I Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming (s. 156-167). Association for Computing Machinery. https://doi.org/10.1145/571157.571173

Madsen, B. A., Nielsen, J. M. & Skjernaa, B. (2002). On the Number of Maximal Bipartite Subgraphs of a Graph. BRICS Report Series, (RS-02-17).

Bouvin, N. O. (2002). Open Hypermedia in a Peer-to-Peer Context. I J. Blustein (red.), Proceedings of the thirteenth ACM conference on Hypertext and hypermedia (Bind SESSION: Next-Gen Open Hypermedia, Part Two, s. 138-139). Association for Computing Machinery. https://doi.org/10.1145/513338.513373

Brodal, G. S., Makris, C., Sioutas, S., Tsakalidis, A. K. & Tsichlas, K. (2002). Optimal Solutions for the Temporal Precedence Problem. Algorithmica, 33(4), 494-510. https://doi.org/10.1007/s00453-002-0935-z

Pagh, R., Pagter, J. I. & Eppstein, D. (red.) (2002). Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. I Symposium on Discrete Algorithm: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (s. 9-18). Association for Computing Machinery.

Viser resultater 5051 til 5100 ud af 6088

102

Revideret 26.11.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series