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

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).
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
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.
Kuijpers, G., Nielsen, T. T. & Prasad, R. (2002). Optimizing Neighbor Discovery for Ad hoc Networks based on the Bluetooth PAN Profile. I The 5th International Symposium on Wireless Personal Multimedia Communications, 2002. (s. 203-207). IEEE Computer Society Press. https://doi.org/10.1109/WPMC.2002.1088161
Krink, T., Vesterstrøm, J. S., Riget, J., Fogel, D. B. (red.), Yao, X. (red.), Greenwood, G. (red.), Iba, H. (red.), Marrow, P. (red.) & Shackleton, M. (red.) (2002). Particle Swarm Optimisation with Spatial Particle Extension. I Proceedings of the Evolutionary Computation on 2002. CEC '02.: Proceedings of the 2002 Congress (Bind 02, s. 1474-1479). IEEE.
Wiil, U. K., Bouvin, N. O., Larsen, D., De Roure, D. C. & Thompson, M. K. (2002). Peer-to-peer hypertext. 69-71. Afhandling præsenteret på Hypertext 2002: Proceedings of the Thirteenth ACM Conference on Hypertext and Hypermedia, College Park, MD, USA. https://doi.org/10.1145/513338.513339
Bouvin, N. O., Kock Will, U., Larsen, D., De Roure, D. C. & Thomsen, M. K. (2002). Peer-to-Peer Hypertext Panel. I HYPERTEXT 2002: Proceedings of the 13th ACM Conference on Hypertext and Hypermedia (Bind SESSION: Narratives and Literary Hypertext, s. 69-71). Society for Industrial and Applied Mathematics.
Damgård, I. B. & Nielsen, J. B. (2002). Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. I M. Yung (red.), Advances in Cryptology - CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002 Proceedings (s. 581-596). Springer. https://doi.org/10.1007/3-540-45708-9_37
Wells, L. M. (2002). Performance Analysis using Coloured Petri Nets (DAIMI PB-563 udg.). Datalogisk Institut, Aarhus Universitet.
Wells, L. M., Boukerche, A. (red.), Das, S. K. (red.) & Majumdar, S. (red.) (2002). Performance Analysis Using Coloured Petri Nets. I Proceedings, 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 2002 (s. 217-221). IEEE Computer Society Press.
Bendtsen, C. N., Krink, T., Fogel, D. B. (red.), Yao, X. (red.), Greenwood, G. (red.), Iba, H. (red.), Marrow, P. (red.) & Shackleton, M. (red.) (2002). Phone Routing using the Dynamic Memory Model. I Proceedings of the 2002 Congress on Evolutionary Computation: CEC '02 (Bind 1, s. 992-997). IEEE Press.
Ludvigsen, M. (2002). Playful Interaction. Afhandling præsenteret på IRIS 2002 Jamboree/review at the International Conference on Ubiquitous Computing, Göteborg, Sverige.
Mosses, P. D., Kirchner, H. (red.) & Ringeissen, C. (red.) (2002). Pragmatics of Modular SOS. I Ikke angivet (2422 of Lecture Notes in Computer Science udg., s. 49-72). Springer.
Black, A. P., Ernst, E., Grogono, P., Sakkinen, M., Arévalo, G., Crespo, Y., Huchard, M. & Dao, M. (red.) (2002). Proceedings of the Inheritance Workshop at ECOOP 2002. I J. Hernández & A. Moreira (red.), Object-Oriented Technology ECOOP 2002 Workshop Reader: ECOOP 2002 Workshops and Posters Málaga, Spain, June 10–14, 2002 Proceedings (s. 117-134). Springer. https://doi.org/10.1007/3-540-36208-8_10
Büscher, M., Hartswood, M., Mogensen, P. H., Procter, R., Shapiro, D., Slack, R. & Voss, A. (2002). Promises, Premises and Risks: Sharing Responsibilities, Working Up Trust and Sustaining Commitment in Participatory Design Projects. I Proceedings of PDC 2002
Hein, J., Jensen, J. L. & Pedersen, C. N. S. (2002). Recursions for Statistical Multiple Alignment. Department of Mathematical Sciences , University of Aarhus.
Hein, J., Pedersen, C. N. S. & Jensen, J. L. (2002). Recursions for Statistical Multiple Alignment. Proceedings of the National Academy of Sciences (PNAS), 100(25), 14960-14965.
Nielsen, M. & Thiagarajan, P. S. (2002). Regular Event Structures and Finite Petri Nets: The Conflict-Free Case. I J. Esparza & C. Lakos (red.), Application and Theory of Petri Nets 2002: 23rd International Conference, ICATPN 2002 Adelaide, Australia, June 24-30, 2002 Proceedings (s. 467-488). Springer. https://doi.org/10.1007/3-540-48068-4_20
Ernst, E. (2002). Safe Dynamic Multiple Inheritance. Nordic Journal of Computing, 9(3), 191-208.
Ernst, E. (2002). Safe Dynamic Multiple Inheritance. I K. Østerbye (red.), Proceedings of the 10th Nordic workshop on Software Development Tools and Techniques http://www.it-c.dk/people/kasper/NWPER2002/papers/ernst.pdf
Thomsen, R., Krink, T., 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). Self-Adaptive Operator Scheduling using the Religion-Based EA. I Lecture Notes in Computer Science: Parallel Problem Solving from Nature - PPSN VII (2439 of Lecture Notes in Computer Science udg., Bind 2439/-1 / 2002, s. 214-223). Springer.
Nielsen, J. B. (2002). Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-Committing Encryption Case. I M. Yung (red.), Advances in Cryptology — CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18–22, 2002 Proceedings (s. 191-214). Springer. https://doi.org/10.1007/3-540-45708-9_8
Grønbæk, K., Whitehead, J., De Bra, P., Larsen, D., Leggett, J. & Schraefel, M. (2002). Seven Issues Revisited. I Conference on Hypertext and Hypermedia: Proceedings of the thirteenth ACM conference on Hypertext and hypermedia (s. 171). Association for Computing Machinery.
Brodal, G. S., Lyngsø, R. B., Östlin, A. & Pedersen, C. N. S. (2002). Solving the String Statistics Problem in Time O(n log n). I P. Widmayer, S. Eidenbenz, F. Triguero, R. Morales, R. Conejo & M. Hennessy (red.), Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings (s. 728-739). Springer. https://doi.org/10.1007/3-540-45465-9_62
Büscher, M., Mogensen, P. H. & Shapiro, D. (2002). Spaces of Practice. I W. Prinz, M. Jarke, Y. Rogers, K. Schmidt & V. Wulf (red.), Proceedings of the seventh conference on European Conference on Computer Supported Cooperative Work (s. 139-158). Springer. https://doi.org/10.1007/0-306-48019-0_8