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

Petersen, M. G. & Baillie, L. (2001). Methodologies for Designing Future Household Technologies. In Proceedings of the OIKOS Workshop (pp. 47-49). Aarhus Universitetsforlag.

Bardram, J. E. & Christensen, H. B. (2001). Middleware for Pervasive Healthcare - A White Paper. In B. Guruduth (Ed.), Proceedings of Advanced Topic Workshop -- Middleware for Mobile Computing University of Arizona Press. http://www.cs.arizona.edu/mmc/Program.html

Lorentsen, L., Tuovinen, A.-P. & Xu, J. (2001). Modelling of Features and Feature Interactions in Nokia Mobile Phones Using Coloured Petri Nets. In K. Jensen (Ed.), Third Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (pp. 1-14). Department of Computer Science, Aarhus University.

Nielsen, M. (2001). Modelling with Partial Orders - Why and Why Not? 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. 61-63). Springer. https://doi.org/10.1007/3-540-48224-5_5

Westergaard, M., Henningsen, J., Svendsen, M. L., Johansen, C., Jensen, U. B., Schrøder, H. D., Kratchmarova - Blagoeva, I. H., Berge, R. K., Iversen, L., Bolund, L., Kragballe, K. & Kristiansen, K. (2001). Modulation of keratinocyte gene expression and differentiation by PPAR-selective ligands and tetradecylthioacetic acid. Journal of Investigative Dermatology, 116(5), 702-12. https://doi.org/10.1046/j.0022-202x.2001.doc.x

Klarlund, N., Møller, A. & Schwartzbach, M. I. (2001). MONA Implementation Secrets. In S. Yu & A. Paun (Eds.), Implementation and Application of Automata: 5th International Conference, CIAA 2000 London, Ontario, Canada, July 24-25, 2000 Revised Papers (pp. 182-194). Springer. https://doi.org/10.1007/3-540-44674-5_4

Klarlund, N. & Møller, A. (2001). MONA Version 1.4 User Manual. BRICS Notes Series, (NS-01-1).

Cramer, R., Damgård, I. B. & Nielsen, J. B. (2001). Multiparty Computation from Threshold Homomorphic Encryption. In B. Pfitzmann (Ed.), Advances in Cryptology - EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (pp. 280-300). Springer. https://doi.org/10.1007/3-540-44987-6_18

Nielsen, J. B. (2001). Non-Committing Encryption is Too Easy in the Random Oracle Model. BRICS Report Series, (RS-01-47).

Danvy, O., Rhiger, M. & Rose, K. H. (2001). Normalization by evaluation with typed abstract syntax. Journal of Functional Programming, 673-680. https://doi.org/10.1017/S0956796801004166

Danvy, O., Rhiger, M. & Rose, K. H. (2001). Normalization by Evaluation with Typed Abstract Syntax. BRICS Report Series, (RS-01-16).

Schultz, U. P. (2001). Object-oriented program specialization: Aspects into Aspects - or maybe not? In European Conference on Object Oriented Programming: Object-Oriented Technology. ECOOP 2001 Workshop Reader ECOOP 2001 Workshops, Panel, and Posters. Workshop on Generative Programming. WGP'01 (pp. 4). Springer.

Canetti, R., Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2001). On Adaptive vs. Non-adaptive Security of Multiparty Protocols. In B. Pfitzmann (Ed.), Advances in Cryptology --- EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (pp. 262-279). Springer. https://doi.org/10.1007/3-540-44987-6_17

Arge, L. A., Meyer, U., Toma, L. & Zeh, N. (2001). On External-Memory Planar Depth First Search. In F. Dehne, J.-R. Sack & R. Tamassia (Eds.), Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings (pp. 471-482). Springer. https://doi.org/10.1007/3-540-44634-6_43

Cryan, M. & Miltersen, P. B. (2001). On pseudorandom generators in NC⁰. In J. Sgall, A. Pultr & P. Kolman (Eds.), Mathematical Foundations of Computer Science 2001: Lecture Notes in Computer Science (Lecture Notes in Computer Science 2136 ed., Vol. 2136/2001, pp. 272-284). Springer.

Cramer, R., Damgård, I. B. & Fehr, S. (2001). On the Cost of Reconstructing a Secret or VSS with Optimal Reconstruction. In J. Killian (Ed.), Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 503-524). Springer. https://doi.org/10.1007/3-540-44647-8_30

Srba, J., Guldstrand Larsen, K. (Ed.) & Nielsen, M. (Ed.) (2001). On the Power of Labels in Transition Systems. In Lecture Notes in Computer Science: Proceedings of the 12th International Conference on Concurrency Theory (2154 of Lecture Notes in Computer Science ed., Vol. 2154/2001, pp. 277-291). Springer.

Mogensen, P. H., Grønbæk, K., Christensen, M. & Ørbæk, P. (2001). Open 3D spatial Hypermedia as Roomware Components for Interactive Workspaces. In K. Grønbæk (Ed.), Conference on Hypertext and Hypermedia: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (Vol. Session: Presentations, pp. Demo). Society for Industrial and Applied Mathematics.

Alstrup, S., Brodal, G. S. & Rauhe, T. (2001). Optimal Static Range Reporting in One Dimension. In Proceedings of the thirty-third annual ACM symposium on Theory of computing (pp. 476-482). Association for Computing Machinery. https://doi.org/10.1145/380752.380842

Pagh, R. & Pagter, J. (2001). Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. BRICS Report Series, (RS-01-2), 20-20.

Schultz, U. P., Danvy, O. (Ed.) & Filinski, A. (Ed.) (2001). Partial Evaluation for Class-Based Object-Oriented Languages. In Lecture Notes In Computer Science: Proceedings of the Second Symposium on Programs as Data Objects (Lecture Notes in Computer Science 2053 ed., Vol. 2053, pp. 173-197). Springer.

Corry, A. V. (2001). Patterns in Software Development. (DAIMI PhD Dissertation PD-01-1 ed.) Department of Computer Science.

Damgård, I. B. & Nielsen, J. B. (2001). Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. BRICS Report Series, (RS-01-41).

Crazzolara, F., Winskel, G., Charpentier, M. (Ed.) & Sanders, B. (Ed.) (2001). Petri Nets in Cryptographic Protocols. In Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01) (Vol. 15th International Parallel and Distributed Processing Symposium (IPDPS'01) Workshops, pp. 149). IEEE Press.

Damgård, I. B. & Koprowski, M. (2001). Practical Threshold RSA Signatures Without a Trusted Dealer. In B. Pfitzmann (Ed.), Advances in Cryptology - EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (pp. 152-165). Springer. https://doi.org/10.1007/3-540-44987-6_10

Bertelsen, O. W. (2001). Proceedings of the First Danish Human-Computer Interaction Research Symposium. In DAIMI PB-555 (pp. A-59). Department of Computer Science.

Bertelsen, O. W. (Ed.) (2001). Proceedings of the First Danish Human-Computer Interaction Research Symposium. Department of Computer Science, Aarhus University.

Danvy, O. & Filinski, A. (Eds.) (2001). Programs as Data Objects: Second Symposium, PADO2001 Aarhus, Denmark, May 21–23, 2001 Proceedings. Springer. Lecture Notes in Computer Science Vol. 2053 https://doi.org/10.1007/3-540-44978-7

Nielsen, M., Sassone, V. & Srba, J. (2001). Properties of Distributed Timed-Arc Petri Nets. In R. Hariharan, V. Vinay & M. Mukund (Eds.), FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science: 21st Conference Bangalore, India, December 13-15, 2001 Proceedings (pp. 280-291). Springer. https://doi.org/10.1007/3-540-45294-X_24

Zhang, W. (2001). Reusability of Information System with UML. Northwestern Polytechnical University.

Krogh, P. G. & Grønbæk, K. (2001). Roomware and intelligent Buildings - buildings and objects become computer interfaces! In P. Bille (Ed.), Architectural Research and Information Technology (pp. 63-68). Aarhus School of Architecture. http://www.pervasive.dk/publications/files/Roomware.pdf

Cramer, R. & Damgård, I. B. (2001). Secure Distributed Linear Algebra in a Constant Number of Rounds. In J. Killian (Ed.), Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 119-137). Springer. https://doi.org/10.1007/3-540-44647-8_7

Krink, T. & Thomsen, R. (2001). Self-Organized Criticality and Mass Extinction in Evolutionary Algorithms. In Proceedings of the Third Congress on Evolutionary Computation (CEC 2001).: Vol. 2 (Vol. 2, pp. 1155-1161). IEEE.

Lund, H. H., Mayoh, B. H. & Perram, J. (2001). Seventh Scandinavian Conference on Artificial Intelligence. In Frontiers in Artificial Intelligence and Applications (66 ed.). IOS Press.

Wells, L., Christensen, S., Kristensen, L. M., Mortensen, K. H., German, R. (Ed.) & Haverkort, B. (Ed.) (2001). Simulation Based Performance Analysis of Web Servers. In Proceedings of 9th International Workshop on Petri Nets and Performance Models (pp. 59-68). IEEE Computer Society Press.

Lange, M., Thulesen, J., Feldt-Rasmussen, U., Skakkebaek, N. E., Vahl, N., Jørgensen, J. O. L., Christiansen, J. S., Poulsen, S. S., Sneppen, S. E. B. & Juul, A. (2001). Skin morphological changes in growth hormone deficiency and acromegaly. European Journal of Endocrinology, 145(2), 147-53.

Arge, L. A. (2001). Some Algorithmic Research Challenges and Opportunitiesin Geospatial Applications.

Jensen, K. (Ed.) (2001). Special Section on Practical Use of High-level Petri Nets. International Journal on Software Tools for Technology Transfer, 3(4), 369-430. https://doi.org/10.1007/s100090100066

Christensen, S., Jensen, K., Mailund & Kristensen, L. M. (2001). State space methods for coloured Petri nets. In Proceedings of the 2nd international colloquium on Petri net technologies for modelling communication based systems (pp. 14-15)

Christensen, S., Jensen, K., Mailund, T., Weber, H. (Ed.), Ehrig, H. (Ed.) & Reisig, W. (Ed.) (2001). State Space Methods for Timed Petri Nets. In Proc. of 2nd Int. Coll. on Petri Net Technologies for Modelling Communication Based Systems: DFG Research Group "Petri Net Technology" (pp. 33-42). DFG-Forschergruppe Petri Net Technologie.

Danvy, O., Damian, D. & Taha, W. (Ed.) (2001). Static Transition Compression. In Semantics, Applications, and Implementation of Program Generation (Vol. 2196 of Lecture Notes in Computer Science, pp. 92-107). Springer.

Damian, D. & Danvy, O. (2001). Static Transition Compression. In W. Taha (Ed.), Semantics, Applications, and Implementation of Program Generation: Second International Workshop, SAIG 2001 Florence, Italy, September 6, 2001 Proceedings (pp. 92-107). Springer. https://doi.org/10.1007/3-540-44806-3_6

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2001). Static Validation of Dynamically Generated HTML. In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (pp. 38-45). Association for Computing Machinery. https://doi.org/10.1145/379605.379657

MacIntyre, B., Mynatt, E. D., Voida, S., Hansen, K. M., Tullio, J. & Corso, G. M. (2001). Support for Multitasking and background Awareness Using Interactive Peripheral Displays. In J. Marks & E. D. Mynatt (Eds.), Proceedings of the 14th annual ACM symposium on User interface software and technology (pp. 41-50). Association for Computing Machinery. https://doi.org/10.1145/502348.502355

Damian, D. & Danvy, O. (2001). Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation. BRICS Report Series, (RS-01-54).

Danvy, O. & Nielsen, L. R. (2001). Syntactic Theories in Practice. BRICS Report Series, (RS-01-31).

Nielsen, M. & Valencia, F. D. (2001). Temporal Concurrent Constraint Programming: Applications and Behavior. BRICS Report Series, (RS-01-48).

Caspersen, M. E., Madsen, O. L. & Skov, S. H. (2001). Testing Object-Oriented Software. Department of Computer Science, Aarhus University.

Amtoft, T., Consel, C., Danvy, O. & Malmkjær, K. (2001). The Abstraction and Instantiation of String-Matching Programs. BRICS Report Series, (RS-01-12).

Brodal, G. S., Fagerberg, R., Pedersen, C. N. S. & Östlin, A. (2001). The Complexity of Constructing Evolutionary Trees Using Experiments. 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. 140-151). Springer. https://doi.org/10.1007/3-540-48224-5_12

Displaying results 5101 to 5150 out of 5933

103