Aarhus University Seal

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

Sort by: Date | Author | Title

Christensen, B. G. & Hansen, F. A. (2002). XLink - Linking the Web and Open Hypermedia. Paper presented at The International Workshop on Open Hypermedia Systems Core Concepts and Research Directions (OHS 2002), College Park, Maryland, United States.
Danvy, O. & Nielsen, L. R. (2001). A First-Order One-Pass CPS Transformation. BRICS Report Series, RS-01-49.
Agarwal, P. K., Arge, L. A., Procopiuc, O. & Vitter, J. S. (2001). A Framework for Index Bulk Loading and Dynamization. In F. Orejas, P. G. Spirakis & J. van Leeuwen (Eds.), Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8-12, 2001 Proceedings (pp. 115-127). Springer. https://doi.org/10.1007/3-540-48224-5_10
Damgård, I. B. & Jurik, M. J. (2001). A Generalisation, a Simplification and some Applications of Paillier's Probabilistic Public-Key System. In K. Kim (Ed.), Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 Cheju Island, Korea, February 13-15, 2001 Proceedings (pp. 119-136). Springer. https://doi.org/10.1007/3-540-44586-2_9
Cáccamo, M. J., Winskel, G., Boulton, R. J. (Ed.) & Jackson, P. B. (Ed.) (2001). A Higher-Order Calculus for Categories. In Lecture Notes in Computer Science: Theorem Proving in Higher Order Logics (Lecture Notes in Computer Science ed., Vol. 2152, pp. 136-153). Springer.
Danvy, O. & Nielsen, L. R. (2001). A Higher-Order Colon Translation. In H. Kuchen & K. Ueda (Eds.), Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings (pp. 78-91). Springer. https://doi.org/10.1007/3-540-44716-4_5
Kirchner, H. & Mosses, P. D. (2001). Algebraic Specifications, Higher-order Types and Set-theoretic Models. Journal of Logic and Computation, 11(3), 453-481.
Brodal, G. S., Frigioni, D. & Marchetti-Spaccamela, A. (Eds.) (2001). Algorithm Engineering: Proceedings of 5th International Workshop on Algorithm Engineering (WAE 2001). (2141 i Lecture Notes in Computer Science ed.) Springer.
Sandvad, E. S., Grønbæk, K., Sloth, L. & Knudsen, J. L. (2001). A Metro Map Metaphor for Guided Tours on the Web: The Webwise Guided Tour System. In Proceedings of the 10th international conference on World wide web (pp. 326-333). Association for Computing Machinery. https://doi.org/10.1145/371920.372079
Damian, D. & Danvy, O. (2001). A Simple CPS Transformation of Control-Flow Information. BRICS Report Series, (RS-01-55).
Danvy, O. & Rhiger, M. (2001). A Simple Take on Typed Abstract Syntax in Haskell-like Languages. In H. Kuchen & K. Ueda (Eds.), Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings (pp. 343-358). Springer. https://doi.org/10.1007/3-540-44716-4_22
Christensen, S., Kristensen, L. M. & Mailund (2001). A Sweep-Line Method for State Space Exploration. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001) (pp. 450-464)
Christensen, S., Kristensen, L. M., Mailund, T., Margaria, T. (Ed.) & Yi, W. (Ed.) (2001). A Sweep-Line Method for State Space Exploration. In Lecture Notes in Computer Science (Lecture Notes in Computer Science 2031 ed., Vol. 2031, pp. 450-464). Springer.
Danvy, O., Grobauer, B. & Rhiger, M. (2001). A Unifying Approach to Goal-Directed Evaluation. New Generation Computing, 20(1), 53-74. https://doi.org/10.1007/BF03037259
Danvy, O., Rhiger, M. & Grobauer, B. (2001). A Unifying Approach to Goal-Directed Evaluation. In W. Taha (Ed.), Semantics, Applications, and Implementation of Program Generation: Second International Workshop, SAIG 2001 Florence, Italy, September 6, 2001 Proceedings (pp. 108-125). Springer. https://doi.org/10.1007/3-540-44806-3_7
Danvy, O., Grobauer, B. & Rhiger, M. (2001). A Unifying Approach to Goal-Directed Evaluation. BRICS Report Series, (RS-01-29).
Brodal, G. S., Fagerberg, R. & Jacob, R. (2001). Cache Oblivious Search Trees via Binary Trees of Small Height. BRICS Report Series, (RS-01-36), 1-20.
Brodal, G. S. & Pinotti, M. C. (2001). Comparator Networks for Binary Heap Construction. Theoretical Computer Science, 250(1-2), 235-245. https://doi.org/10.1016/S0304-3975(99)00137-1
Jagota, A., Lyngsø, R. B., Pedersen, C. N. S., Gascuel, O. (Ed.) & Moret, B. M. E. (Ed.) (2001). Comparing Hidden Markov Model and a Stochastic Context-Free Grammer. In Proceedings of the First International Workshop on Algorithms in Bioinformatics (2149 of Lecture Notes in Computer Science ed., Vol. Volume 2149/2001, pp. 69-94). Springer.
Lyngsø, R. B., Pedersen, C. N. S., Eades, P. (Ed.) & Takaoka, T. (Ed.) (2001). Complexity of Comparing Hidden Markov Models. In Ikke angivet (2223 of Lecture Notes in Computer Science ed., pp. 416-428). Springer.
Doh, K., Mosses, P. D., van den Brand, M. (Ed.) & Parigot, D. (Ed.) (2001). Composing Programming Languages by Combining Action-Semantics Modules. In Ikke angivet (44(2) of Elec. Notes in Theoretical Comp. Sci ed., Vol. 44, pp. 87-109). Pergamon Press.
Brodal, G. S., Fagerberg, R., Pedersen, C. N. S., Eades, P. (Ed.) & Takaoka, T. (Ed.) (2001). Computing the Quartet Distance Between Evolutionary Trees in Time O(n log² n). In Proceedings of Algorithms and Computation : 12th International Symposium, ISAAC 2001 (2223 of Lecture Notes in Computer Science ed., Vol. 2223/2001, pp. 731-742). Springer.
Christensen, S., Kristensen, L. M. & Mailund (2001). Condensed State Spaces for Timed Petri Nets. In Proceedings of International Conference on Application and Theory of Petri Nets (ICATPN 2001) (pp. 101-120)
Bertelsen, O. W. & Bødker, S. (2001). Cooperation in massively distributed information spaces. In Proceedings of the seventh conference on European Conference on Computer Supported Cooperative Work (pp. 1-17). Kluwer Academic Publishers. http://www.ecscw.org/2001.htm
Andersen, P., Beaudouin-Lafon, M., Mackay, W. E., Janecek, P., Lassen, M., Jensen, M., Mortensen, K., Munck, S., Ratzer, A., Ravn, K., Christensen, S., Jensen, K., Colom, J. M. (Ed.) & Koutny, M. (Ed.) (2001). CPN/Tools: A Post-WIMP Interface for Editing and Simulating Coloured Petri Nets. In G. Goos, J. Hartmanis & J. van Leeuwen (Eds.), Applications and Theory of Petri Nets 2001 (Vol. 2075, pp. 71-80). Springer. https://doi.org/10.1007/3-540-45740-2_6
Jensen, K., Christensen, S., Ravn, K., Ratzer, A., Munck, S., Mortensen, K., Lund, K., Lassen, H. M., Jacecek, P., Andersen, P., Jensen, M., Mackay, W. E. & Beaudouin-Lafon, M. (2001). CPN/Tools: A Tool for Editing and Simulating Coloured Petri Nets: ETAPS Tool Demonstration Related to TACAS. In T. Margaria & W. Yi (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (pp. 574-577). Springer. https://doi.org/10.1007/3-540-45319-9_39
Danvy, O. & Nielsen, L. R. (2001). CPS Transformation of Beta-Redexes. In Proceedings of the Third ACM SIGPLAN Workshop on Continuations
Bouvin, N. O. & Bertelsen, O. W. (Ed.) (2001). Creating and Styling Fluid Annotations on Third-Party Web Pages. In Proceedings of First Danish Human-Computer Interaction Reseach Symposium (DAIMI PB-555 ed., pp. 12-13). Department of Computer Science.
Nielsen, M., Paun, G., Rozenberg, G. & Salomaa, A. (Eds.) (2001). Current Trends in Theoretical Computer Science Entering the 21st Century: Concurrency. World Scientific.
Danvy, O. & Nielsen, L. R. (2001). Defunctionalization at Work. In roceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (pp. 162-174). Association for Computing Machinery. https://doi.org/10.1145/773184.773202
Danvy, O. & Nielsen, L. R. (2001). Defunctionalization at Work. BRICS Report Series, (RS-01-23).
Kuijpers, G., Nielsen, T. T. & Prasad, R. (2001). Delivering Quality of Service in Mobile Ad Hoc IP Networks. Paper presented at 4th International Symposium on Wireless Personal Multimedia Communications (WPMC), Aalborg, Denmark.
Miltersen, P. B., Rajasekaran, S. (Ed.), Pardalos, P. M. (Ed.), Reif, J. H. (Ed.) & Rolim, J. D. P. (Ed.) (2001). Derandomizing complexity classes. In Handbook on Randomized Computing: Combinatorial Optimization, Vol. 9 (chapter 19 ed., Vol. II, chapter 19, pp. 843-935). Kluwer Academic Publishers (Springer).
Hagerup, T., Miltersen, P. B. & Pagh, R. (2001). Deterministic Dictionaries. Journal of Algorithms, 41, 69-85.
Hagerup, T., Miltersen, P. B. & Pagh, R. (2001). Deterministic Dictionaries. J. Algorithms, 41(1), 69-85.
Mortensen, K. H. (2001). Efficient Data-Structures and Algorithms for a Coloured Petri Nets Simulator. In K. Jensen (Ed.), Third Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (pp. 57-75). Department of Computer Science, Aarhus University.
Baillie, L. & Petersen, M. G. (2001). Emerging Themes in Designing Household Environments. In Proceedings of the OIKOS Workshop (pp. 44-46). Aarhus Universitetsforlag.
Lindstrøm, B. & Haider, S. (2001). Equivalent Coloured Petri Net Models of a Class of Timed Influence Nets with Logic. In K. Jensen (Ed.), Third Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (pp. 35-55). Department of Computer Science, Aarhus University.
Crazzolara, F. & Winskel, G. (2001). Events in Security Protocols. In Proceedings of the 8th ACM conference on Computer and Communications Security (pp. 96-105). Association for Computing Machinery.
Krink, T., Ursem, R. K., Filipic, B., Spector, L. (Ed.), Goodman, E. D. (Ed.), Wu, A. (Ed.), Langdon, W. B. (Ed.), Voigt, H. (Ed.), Gen, M. (Ed.), Sen, S. (Ed.), Dorio, M. (Ed.), Pezeshk, S. (Ed.), Garzon, M. H. (Ed.) & Burke, E. (Ed.) (2001). Evolutionary Algorithms in Control Optimization: The Greenhouse Problem. In GECCO 2001: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 440-447). Morgan Kaufmann.
Lorentsen, L. & Kristensen, L. M. (2001). Exploiting Stabilizers and Parallelism in State Space Generation with the Symmetry Method. In A. Valmari & A. Yakoviev (Eds.), Proceedings of Second International Conference on Application of Concurrency to System Design (ACSD'01) (Vol. ACSD, pp. 211-220). IEEE Computer Society Press.
Arge, L. A. (2001). External Memory Data Structures. In F. M. A. D. Heide (Ed.), Algorithms - ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28-31, 2001 Proceedings (pp. 1-29). Springer. https://doi.org/10.1007/3-540-44676-1_1
Ernst, E. (2001). Family Polymorphism. In J. L. Knudsen (Ed.), ECOOP 2001 — Object-Oriented Programming: 15th European Conference Budapest, Hungary, June 18–22, 2001 Proceedings (pp. 303-326). Springer. https://doi.org/10.1007/3-540-45337-7_17