Publikationer

Søg publikationer fra Institut for Datalogi

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

Grønbæk, K., Gundersen, K. K., Mogensen, P. H. & Ørbæk, P. (2001). Interactive Room Support for Complex and Distributed Design Projects. I M. Hirose (red.), Human-Computer Interaction: INTERACT'01 (s. 407-414). Ohmsha.

Mogensen, P. H. (2001). Interactive Workspaces: Demo. Afhandling præsenteret på Nordic Interactive Conference, Cobenhagen, Danmark.

Arge, L. A., Toma, L. & Vitter, J. S. (2001). I/O-Efficient Algorithms for Problems on Grid-Based Terrains. Journal of Experimental Algorithmics, 6. https://doi.org/10.1145/945394.945395

Nielsen, T. T. (2001). IPv6 for Future Wireless Networks. Wireless Personal Communications, 17(2-3), 237-247. https://doi.org/10.1023/A:1011261320056

Hansen, K. M. (2001). Kimura. Softwareprogram

Büscher, M., Gill, S., Mogensen, P. H. & Shapiro, D. (2001). Landscapes of Practice: Bricolage as a Method for Situated Design. Computer Supported Cooperative Work (CSCW): The Journal of Collaborative Computing and Work Practices, 10(1), 1-28. https://doi.org/10.1023/A:1011293210539

Ernst, E. (2001). Loosely coupled class families. I L. Bergmans, J. Brichau, S. Clarke & M. Glandrup (red.), Proceedings of workshop on Advanced Separation of Concerns University of Twente. http://trese.cs.utwente.nl/workshops/ecoop01asoc/papers/Ernst.pdf

Frandsen, G. S., Hansen, J. P. & Miltersen, P. B. (2001). Lower Bounds for Dynamic Algebraic Problems. Information and Computation, 171(2), 333-349. https://doi.org/10.1006/inco.2001.3046

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

Bardram, J. E. & Christensen, H. B. (2001). Middleware for Pervasive Healthcare - A White Paper. I B. Guruduth (red.), 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. I K. Jensen (red.), Third Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (s. 1-14). Department of Computer Science, Aarhus University.

Nielsen, M. (2001). Modelling with Partial Orders - Why and Why Not? I F. Orejas, P. G. Spirakis & J. van Leeuwen (red.), Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8-12, 2001 Proceedings (s. 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. I S. Yu & A. Paun (red.), Implementation and Application of Automata: 5th International Conference, CIAA 2000 London, Ontario, Canada, July 24-25, 2000 Revised Papers (s. 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. I B. Pfitzmann (red.), Advances in Cryptology - EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (s. 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? I 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 (s. 4). Springer.

Canetti, R., Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2001). On Adaptive vs. Non-adaptive Security of Multiparty Protocols. I B. Pfitzmann (red.), Advances in Cryptology --- EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (s. 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. I F. Dehne, J.-R. Sack & R. Tamassia (red.), Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings (s. 471-482). Springer. https://doi.org/10.1007/3-540-44634-6_43

Cryan, M. & Miltersen, P. B. (2001). On pseudorandom generators in NC⁰. I J. Sgall, A. Pultr & P. Kolman (red.), Mathematical Foundations of Computer Science 2001: Lecture Notes in Computer Science (Lecture Notes in Computer Science 2136 udg., Bind 2136/2001, s. 272-284). Springer.

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

Srba, J., Guldstrand Larsen, K. (red.) & Nielsen, M. (red.) (2001). On the Power of Labels in Transition Systems. I Lecture Notes in Computer Science: Proceedings of the 12th International Conference on Concurrency Theory (2154 of Lecture Notes in Computer Science udg., Bind 2154/2001, s. 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. I K. Grønbæk (red.), Conference on Hypertext and Hypermedia: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (Bind Session: Presentations, s. Demo). Society for Industrial and Applied Mathematics.

Alstrup, S., Brodal, G. S. & Rauhe, T. (2001). Optimal Static Range Reporting in One Dimension. I Proceedings of the thirty-third annual ACM symposium on Theory of computing (s. 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. (red.) & Filinski, A. (red.) (2001). Partial Evaluation for Class-Based Object-Oriented Languages. I Lecture Notes In Computer Science: Proceedings of the Second Symposium on Programs as Data Objects (Lecture Notes in Computer Science 2053 udg., Bind 2053, s. 173-197). Springer.

Corry, A. V. (2001). Patterns in Software Development. (DAIMI PhD Dissertation PD-01-1 udg.) 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. (red.) & Sanders, B. (red.) (2001). Petri Nets in Cryptographic Protocols. I Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01) (Bind 15th International Parallel and Distributed Processing Symposium (IPDPS'01) Workshops, s. 149). IEEE Press.

Damgård, I. B. & Koprowski, M. (2001). Practical Threshold RSA Signatures Without a Trusted Dealer. I B. Pfitzmann (red.), Advances in Cryptology - EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (s. 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. I DAIMI PB-555 (s. A-59). Department of Computer Science.

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

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

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

Høyer, P., Neerbek, J. & Shi, Y. (2001). Quantum complexities of ordered searching, sorting, and element distinctness. I International Colloquium on Automata, Languages, and Programming: 28th International Colloquium, ICALP 2001 (Bind 2076, s. 346-357) https://doi.org/10.1007/3-540-48224-5_29

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! I P. Bille (red.), Architectural Research and Information Technology (s. 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. I J. Killian (red.), Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (s. 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. I Proceedings of the Third Congress on Evolutionary Computation (CEC 2001).: Vol. 2 (Bind 2, s. 1155-1161). IEEE.

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

Wells, L., Christensen, S., Kristensen, L. M., Mortensen, K. H., German, R. (red.) & Haverkort, B. (red.) (2001). Simulation Based Performance Analysis of Web Servers. I Proceedings of 9th International Workshop on Petri Nets and Performance Models (s. 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. (red.) (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. I Proceedings of the 2nd international colloquium on Petri net technologies for modelling communication based systems (s. 14-15)

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

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

Viser resultater 5201 til 5250 ud af 6063

105