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

Christensen, B. G. (2006). Developing Mobile P2P Applications with LightPeers. Paper presented at The Sixth IEEE International Conference on Peer-to-Peer Computing, Cambridge, United Kingdom.

Bertelsen, O. W., Petersen, M. G., Brynskov, M., Iversen, O. S., Johansson, M. W. & Dalsgård, P. (Eds.) (2006). DHRS 2006: Proceedings of the Sixth Danish Human-Computer Interaction Research Symposium. Aarhus, Denmark, November 15, 2006. Aarhus Universitet, Datalogisk Institut.

Krink, T. & Paterlini, S. (2006). Differential Evolution and Particle Swarm Optimization for Partitional Clustering. Computational Statistics & Data Analysis, 50/5(446), 27.

Hansen, K. M. & Wells, L. M. (2006). Dynamic Design and Evaluation of Software Architecture in Critical Systems Development. In T. Cant (Ed.), Safety Critical Systems and Software 2006 (pp. 35-44). Australian Computer Society. http://crpit.com/confpapers/CRPITV69Hansen.pdf

Frandsen, G. S. & Frandsen, P. F. (2006). Dynamic Matrix Rank. In M. Bugliesi, B. Preneel, V. Sassone & I. Wegener (Eds.), ICALP 2006: Automata, Languages and Programming: Proceedings (part I) of 33rd International Colloquium (Venice, Italy, July 10-14, 2006) (pp. 395-406) https://doi.org/10.1007/11786986_35

Nielsen, M. B. & Museth, K. (2006). Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets. Journal of Scientific Computing, 26(3), 261-299.

Danvy, O., Filinski, A., Giavitto, J.-L., Moreau, P.-E. & Talcott, C. (2006). Editorial. Higher-Order and Symbolic Computation, 19(1), 343-344.

Danvy, O., de Moor, O., Padget, J. & Thiemann, P. (2006). Editorial. Higher-Order and Symbolic Computation, 19(1), 5-5.

Nielsen, M. B. (2006). Efficient and High Resolution Level Set Simulations: Algorithms, Data Structures and Applications.

Avgustinov, P., Christensen, A. S., Hendren, L. J., Kuzins, S., Lhoták, J., Lhoták, O., de Moor, O., Sereni, D., Sittampalam, G. & Tibble, J. (2006). abc: An Extensible AspectJ Compiler. In A. Rashid & M. Aksit (Eds.), Transactions on Aspect-Oriented Software Development I (pp. 87-98). Springer LNCS. https://doi.org/10.1007/11687061_9

Lassen, K. B. & Westergaard, M. (2006). Embedding Java Types in CPN Tools: Technical Report. http://www.daimi.au.dk/~krell/download.php?file=Embedding Java Types in CPN Tools.pdf.

Thomsen, J. & Husemann, D. (2006). Evaluating the Use of Motes and TinyOS for a Mobile Sensor Platform. In T. Fahringer (Ed.), Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks (pp. 95-100). ACTA Press.

Katriel, I. (2006). Expected-Case Analysis for Delayed Filtering. In Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (LNCS 3990 ed., pp. 119-125). Springer.

Christensen, B. G. (2006). Experiences Developing Mobile P2P Applications with LightPeers. Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing, 229-231.

Bardram, J. E., Hansen, T. R., Mogensen, M. & Søgaard, M. (2006). Experiences from Real-World Deployment of Context-Aware Technologies in a Hospital Environment. In UbiComp 2006: Ubiquitous Computing (Volume 4206 ed., pp. 369-386). Springer LNCS. https://doi.org/10.1007/11853565

Mendling, J., Lassen, K. B. & Zdun, U. (2006). Experiences in enhancing existing BPM Tools with BPEL Import and Export. In Proceedings of the 4th International Conference Business Process Management: LNCS (Vol. 4102, pp. 348-357). Springer.

Støvring, K. (2006). Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative. Logical Methods in Computer Science, 2(2(1)), 1-14.

Møller-Nielsen, P. & Gejl, J. (2006). Eyes On <-> Hands On.

Ernst, E. (2006). Family Genericity. Daimi Reports, (PB-578). http://www.daimi.au.dk/publications/PB/578/PB-578.pdf

Christiansen, C., Mailund, T., Pedersen, C. N. S., Randers, M. & Stissing, M. (2006). Fast Calculation of the Quartet Distance Between Trees of Arbitrary Degrees. Algorithms for Molecular Biology, 1(16).

Brodal, G. S., Kaligosi, K., Katriel, I. & Kutz, M. (2006). Faster Algorithms for Computing Longest Common Increasing Subsequences. In M. Lewenstein & G. Valiente (Eds.), Combinatorial Pattern Matching (pp. 330-341). Springer. https://doi.org/10.1007/11780441_30

Ager, M. S., Danvy, O. & Rohde, H. K. (2006). Fast Partial Evaluation of Pattern Matching in Strings. A C M Transactions on Programming Languages and Systems, 28(4), 696-714. https://doi.org/10.1145/1146809.1146812

Kristensen, J. T. & Miltersen, P. B. (2006). Finding small OBDDs for incompletely specified truth tables is hard. Electronic Colloquium on Computational Complexity, (TR06-004), 1-6. http://eccc.hpi-web.de/eccc-reports/2006/TR06-004/index.html

Miltersen, P. B. & Kristensen, J. T. (2006). Finding small OBDDs for incompletely specified truth tables is hard. In D. Z. Chen & D. T. Lee (Eds.), Computing and Combinatorics: 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006. Proceedings (pp. 489-496). Springer. https://doi.org/10.1007/11809678_51

Arge, L., Agarwal, P. K. & Danner, A. (2006). From Point Cloud to GRID DEM: A Scalable Approach. In Proceedings of International Symposium on Spatial Data Handling

Jørgensen, J. B., Lassen, K. B. & van der Aalst, W. (2006). From Task Descriptions via Coloured Petri Nets Towards an Implementation of a New Electronic Patient Record. International Workshop on Coloured Petri Nets.

Gerhardy, P. (2006). Functional interpretation and modified realizability interpretation of the double-negation shift. In A. Beckmann, U. Berger, B. Löwe & J. V. Tucker (Eds.), Logical Approaches to Computational Barriers: CiE 2006 (Vol. CSR 7-2006 in Computer Science Report Series). University of Wales Swansea.

Westergaard, M. (2006). Game Coloured Petri Nets. In K. Jensen (Ed.), Seventh Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (Vol. PB-579, pp. 281-301). Aarhus Universitetsforlag.

Mailund, T., Schierup, M. H., Pedersen, C. N. S., Madsen, J. N., Hein, J. & Schauser, L. (2006). GeneRecon—A coalescent based tool for fine-scale association mapping. Bioinformatics, 22(18), 2317–2318.

Mailund, T. (2006). Getting Started with Blossoc. http://www.daimi.au.dk/~mailund/Blossoc/download/getting-started-1.1.pdf

Mailund, T. (2006). Getting Started with HapCluster: An introduction to the HapCluster association mapping tool.

Ballegaard, S. A. & Fangel, A. B. (2006). Getting the Job Done: The impact of conception of work on work-life balance. Paper presented at 24th Annual International Labour Process Conference, United Kingdom.

van Hoeve, W.-J. & Katriel, I. (2006). Global Constraints. In F. Rossi, P. van Beek & T. Walsh (Eds.), Handbook of Constraint Programming: Part I , Foundations Pergamon Press.

Møller-Nielsen, P. & Gejl, J. (2006). Halvanden Meter Max.

Bertelsen, O. W., Bødker, S., McEwan, T., Procter, R. & Svanæs, D. (2006). HCI Knowledge - Fit for Transfer, Share or Co-Construction. In The 19th British HCI Group Annual Conference, Napier University. (pp. 341-343)

Hansen, K. M. & Wells, L. M. (2006). Heimdall. Computer programme

Vesterstrøm, J. S. (2006). Heuristic Algorithms in Bioinformatics.

Houston, B., Nielsen, M. B., Batty, C., Nilsson, O. & Museth, K. (2006). Hierarchical RLE Level Set: A Compact and Versatile Deformable Surface Representation. A C M Transactions on Graphics, 25(1), 151-175.

Støvring, K. (2006). Higher-Order Beta Matching with Solutions in Long Beta-Eta Normal Form. Nordic Journal of Computing, 13(1-2), 117-126.

Thomsen, J. (2006). Home Appliance Integration by Pervasive Computing.

Brodal, G. S., Arge, L. & Georgiadis, L. (2006). Improved Dynamic Planar Point Location. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science (pp. 305-314). IEEE. https://doi.org/10.1109/FOCS.2006.40

Grønbæk, K., Rohde, A., Sundararajah, B. & Bech-Pedersen, S. (2006). InfoGallery: Informative Arts Services for Physical Library Spaces. In G. Marchionini, M. L. Nelson & C. C. Marshall (Eds.), 6th ACM/IEEE-CS Joint Conference on Digital Libraries 2006: Opening Information Horizons (pp. 21-31). Association for Computing Machinery. https://doi.org/10.1145/1141753.1141757

Schaffner, C., Crépeau, C., Savvides, G. & Wullschleger, J. (2006). Information-Theoretic Conditions for Two-Party Secure Function Evaluation. In S. Vaudenay (Ed.), Advances in Cryptology - EUROCRYPT 2006: 5th Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 538-554) https://doi.org/10.1007/11761679_32

Blunck, H. & Vahrenhold, J. (2006). In-Place Algorithms for Computing (Layers of) Maxima. In L. Arge & R. Freidvalds (Eds.), Algorithm Theory – SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006. Proceedings (pp. 363-374). Springer. https://doi.org/10.1007/11785293_34

Blunck, H. & Vahrenhold, J. (2006). In-Place Algorithms for Computing (Layers of) Maxima. In Abstracts. Twenty-second European Workshop on Computational Geometry (pp. 181-184)

Blunck, H. & Vahrenhold, J. (2006). In-Place Randomized Slope Selection. In T. Calamoneri, I. Finocchi & G. F. Italiano (Eds.), Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings (pp. 30-41). Springer. https://doi.org/10.1007/11758471_6

Blunck, H. & Vahrenhold, J. (2006). In-Place Randomized Slope Selection. In Abstracts. Twenty-second European Workshop on Computational Geometry (pp. 177-180)

Eichberg, M., Mezini, M., Kloppenburg, S., Ostermann, K. & Rank, B. (2006). Integrating and scheduling an open set of static analyses. In S. Honiden, S. Uchitel & S. Easterbrook (Eds.), Automated Software Engineering, 2006. ASE'06. 21st IEEE/AMC International Conference on: Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering (ASE) (Vol. DOI:10.1109/ASE.2006.43, pp. 113-122). IEEE.

Agarwal, P. K., Arge, L. A. & Yi, K. (2006). I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis. In Proceedings of the twenty-second annual symposium on Computational geometry (pp. 167-176). Association for Computing Machinery. https://doi.org/10.1145/1137856.1137884

Arge, L., Danner, A., Haverkort, H. & Zeh, N. (2006). I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrain Models. In Proceedings of International Symposium on Spatial Data Handling

Displaying results 3901 to 3950 out of 5740

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University