• Year 2003
• Year 2002
• Year 2001
• Year 2000
• Year 1999
• Year 1998

Monografier

Bach, L.A.: Models of spatial and temporal dynamics of structures - from cells to individuals and populations. Ph.d.-afhandling. Aarhus Universitet, 2003.

Brabrand, C.: Domain Specific Languages for Interactive Web Services. Ph.d.-afhandling. BRICS Dissertation Series DS-03-1. Aarhus Universitet: xiv+214 pages, 2003.

Crazzolara, F.: Language, Semantics, and Methods for Security Protocols. Ph.d.-afhandling. BRICS Dissertation Series DS-03-4. Aarhus Universitet: xii+159 pages, 2003.

Cáccamo, M.J.: A Formal Calculus for Categories. Ph.d.-afhandling. BRICS Dissertation Series DS-03-7. Aarhus Universitet: xiv+151 pages, 2003.

Fehr, S.: Secure Multi-Player Protocols. Fundamentals, Generality, and Efficiency. Ph.d.-afhandling. BRICS Dissertation Series DS-03-10. Aarhus Universitet: xii+125 pages, 2003.

Jurik, M.J.: Extensions to the Paillier Cryptosystem with Applications to Cryptological Protocols. Ph.d.-afhandling. BRICS Dissertation Series DS-03-9. Aarhus Universitet: xii+117 pages, 2003.

Koprowski, M.: Cryptographic Protocols Based on Root Extracting. Ph.d.-afhandling. BRICS Dissertation Series DS-03-11. Aarhus Universitet: xii+138 pages, 2003.

Milicia, G.: Applying Formal Methods to Programming Language Design and Implementation. Ph.d.-afhandling. BRICS Dissertation Series DS-03-5. Aarhus Universitet: xvi+211 pages, 2003.

Nielsen, J.B.: On Protocol Security in the Cryptographic Model. Ph.d.-afhandling. BRICS Dissertation Series DS-03-8. Aarhus Universitet: xii+247 pages, 2003.

Nygaard, M.: Domain Theory for Concurrency. Ph.d.-afhandling. BRICS Dissertation Series DS-03-13. Aarhus Universitet: xiii+161 pages, 2003.

Oliva, P.B.: Proof Mining in Subsystems of Analysis. Ph.d.-afhandling. BRICS Dissertation Series DS-03-12. Aarhus Universitet: xii+198 pages, 2003.

Srba, J.: Decidability and Complexity Issues for Infinite-State Processes. Ph.d.-afhandling. BRICS Dissertation Series DS-03-3. Aarhus Universitet: xii+172 pages, 2003.

Ursem, R.K.: Models for Evolutionary Algorithms and Their Applications in System Identification and Control Optimization. Ph.d.-afhandling. BRICS Dissertation Series DS-03-6. Aarhus Universitet: xiv+183 pages, 2003.

Valencia, F.D.: Temporal Concurrent Constraint Programming. Ph.d.-afhandling. BRICS Dissertation Series DS-03-2. Aarhus Universitet: xvii+174 pages, 2003.

Varacca, D.: Probability, Nondeterminism and Concurrence. Two Denotational Models for Probabilistic Computation. Ph.d.-afhandling. BRICS Dissertation Series DS-03-14. Aarhus Universitet: xii+178 pages, 2003.

 

Bidrag i antologier

Ager, M.S.; Biernacki, D.; Danvy, O.; Midtgaard, J.: A Functional Correspondence Between Evaluators and Abstract Machines. In: 5th International Conference on Principles and Practice of Declarative Programming, PPDP '03. Leuschel, M. (Ed.). Uppsala, Sweden, August 27-29, 2003. ACM Press: pp. 8-19, 2003.

Ager, M.S.; Danvy, O.; Rohde, H.K.: Fast Partial Evaluation of Pattern Matching in Strings. In: 5th International Conference on Principles and Practice of Declarative Programming, PPDP '03. Leuschel, M. (Ed.). Uppsala, Sweden, August 27-29, 2003. ACM Press: pp. 3-9, 2003.

Bardram, J.E.; Bossen, C.: Moving to get aHead: Local Mobility and Collaborative Work. In: Proceedings of the Fifth European Conference on Computer Supported Cooperative Work. Dourish, P.; Fitzpatrick, G.; Schmidt, K. (Eds.). ECSCW2003, Helsinki, Finland. Kluwer Academic Publishers: pp. 355-374, 2003.

Bardram, J.E.; Kjær, R.E.; Pedersen, M.Ø.: Context-Aware User Authentication - Supporting Proximity-Based Login in Pervasive Computing. In: Proceedings of Fifth International Conference on Ubiquitous Computing. Dey, A.; McCarthy, J.; Schmidt, A. (Eds.). Ubicomp 2003, 12-15. oktober, Seattle, WA, USA. 2864 of Lecture Notes in Computer Science. Springer-Verlag: pp. 107-123, 2003.

Bardram, J.E.; Kjær, T.A.K.; Nielsen, C.: Supporting Local Mobility in Healthcare by Application Roaming among Heterogeneous Devices. In: Proceedings of the Fifth International Conference on Human Computer Interaction with Mobile Devices and Services. 2795 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 161-176, 2003.

Bender, M.A.; Brodal, G.S.; Fagerberg, R.; Ge, D.; He, S.; Hu, H.; Iacono, J.; López-Ortiz, A.: The Cost of Cache-Oblivious Searching. In: Proc. 44th Annual Symposium on Foundations of Computer Science: pp. 271-282, 2003.

Bennedsen, J.: Teaching Java programming to media students with a liberal arts background. In: Proc. of 7th Conference on Java in the Computing Curriculum Conference. 27. januar, London, England, 2003.

Bennedsen, J.; Brandorff, S.; Caspersen, M.E.; Mosegaard, J.: Teaching Programming to Liberal Arts Students - a Narrative Media Approach. In: Proceedings of the 8th Annual Conference on Innovation and Technology in Computer Science Education. Finkel, D. (Ed.). ITiCSE 2003, Thessaloniki, Grækenland: pp. 109-113, 2003.

Bennedsen, J.; Caspersen, M.: Rationale for the Design of a Web-based Programming Course for Adults. In: Proceedings of International Conference on Open and Online Learning. 7.-13. december, Mauritius, 2003.

Bennedsen, J.; Eriksen, O.: Applying and Developing Patterns in Teaching. In: Proceedings of Frontiers of Education. 5.-8. november, Boulder, Colorado, USA, 2003.

Berg, A.R.; Jordán, T.: Algorithms for Graph Rigidity and Scene Analysis. In: 11th Annual European Symposium on Algorithms, ESA '03. Battista, G.D.; Zwick, U. (Eds.). Budapest, Hungary, September 16-19, 2003. 2832 of Lecture Notes in Computer Science. Springer-Verlag: pp. 78-89, 2003.

Bertelsen, O.W.: Activity Walkthrough - a cognitive walkthrough in activity theory terms. In: Proceedings of Third Danish HCI Research Symposium. 27. november, Roskilde Universitet, 2003.

Bertelsen, O.W.; Bødker, S.: Activity Theory. In: HCI Models, Theories and Frameworks: Toward an Interdisciplinary Science. Caroll, J. (Ed.). Morgan Kaufman Publishers: pp. 291-324, 2003.

Bertelsen, O.W.; Eskildsen, T.; Sperschneider, W.: Programming in the Kitchen. In: Proceedings of the Ninth IFIP TC13 International Conference on Human-Computer Interaction. INTERACT 2003, 1.-5. september, Zürich, Schweiz, 2003.

Biernacki, D.; Danvy, O.: From Interpreter to logic Engine by Defunctionalization. In: LOPSTR 2003 PreInternational Symposium on Logic Based Program Synthesis and Transforamtion. Bruynooghe, M. (Ed.), 2003.

Billington, J.; Christensen, S.; Hee, K.van; Kindler, E.; Kummer, O.; Petrucci, L.; Post, R.; Stehno, C.; Weber, M.: The Petri Net Markup Language: Concepts, Technology, and Tools. In: Proceedings of the 24th International Conference on Application and Theory of Petri Nets. Aalst, W.M.P.van der; Best, E. (Eds.). ICATPN 2003, 23.-27. juni, Eindhoven, Holland. 2679 of Lecture Notes in Computer Science. Springer-Verlag: pp. 483-505, 2003.

Bjerrum, E.; Bødker, S.: Knowledge sharing in the 'new office' - possibility or problem? In: Proceedings of the Eighth European Conference on Computer Supported Cooperative Work. Dourish, P.; Schmidt, K. (Eds.). CSCW 2003, 14.-18. september, Helsinki, Finland: pp. 199-218, 2003.

Brabrand, C.; Schwartzbach, M.I.; Vangaard, M.: The METAFRONT System. Extensible Parsing and Transformation. In: Third ACM SIGPLAN Workshop on Language Descriptions, Tools and Applications. Satellite event of ETAPS 2003, LDTA '03. Bryant, B.R.; Saraiva, J. (Eds.). Warsaw, Poland, April 6, 2003. Elsevier Science, 2003.

Braga, C.d.O.; Haeusler, E.H.; Meseguer, J.; Mosses, P.D.: Mapping Modular SOS to Rewriting Logic. In: International Workshop on Logic Based Program Development and Transformation, LOPSTR '02. Leuschel, M. (Ed.). Madrid, Spain, September 17-20, 2002. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.

Brodal, G.S.; Fagerberg, R.: Lower Bounds for External Memory Dictionaries. In: The 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '03. Farach-Colton, M. (Ed.). Hyatt Regency Baltimore, on the Inner Harbour Baltimore, MD, USA, January 12-14, 2003. ACM Press: pp. 546-554, 2003.

Brodal, G.S.; Fagerberg, R.: On the Limits of Cache-Obliviousness. In: The Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC '03. Goemans, M. (Ed.). San Diego, California, USA, June 9-11, 2003. ACM Press, New York: pp. 307-315, 2003.

Brodal, G.S.; Fagerberg, R.; Östlin, A.; Pedersen, C.N.S.; Rao, S.S.: Computing Refined Buneman Trees in Cubic Time. In: Algorithms in Bioinformatics. 2nd International Workshop, WABI '03 Proceedings (udapest, Hungary, September 15-20, 2003). Benson, G.; Page, R.D.M. (Eds.). 2812 of Lecture Notes in Computer Science. Springer-Verlag: pp. 259-270, 2003.

Brodal, G.S.; Jacob, R.: Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries. In: Algorithmic MeThods and Models for Optimization of RailwayS, ATMOS '03. Gerards, B.; Marchetti-Spaccamela, A. (Eds.). Budapest, Hungary, September 15-20, 2003. Elsevier Science: pp. 12, 2003.

Byskov, J.M.: Algorithms for k-Colouring and Finding Maximal Independent Sets. In: The 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '03. Farach-Colton, M. (Ed.). Hyatt Regency Baltimore, on the Inner Harbour Baltimore, MD, USA, January 12-14, 2003. ACM Press: pp. 456-457, 2003.

Bødker, S.; Friis-Kristensen, J.; Nielsen, C.; Sperschneider, W.: Technology for Boundaries. In: Proceedings of the 2003 International Conference on Supporting Group Work. GROUP'03, 9.-12. november, Sanibel Island, Florida, USA. ACM Press: pp. 311-320, 2003.

Camenisch, J.; Koprowski, M.: Fine-Grained Forward-Secure Signature Schemes without Random Oracles. In: International Workshop on Coding and Cryptography, 2003.

Carbone, M.; Nielsen, M.; Sassone, V.: A Formal Model for Trust in Dynamic Networks. In: 1st International Conference on Software Engineering and Formal Methods, SEFM '03. Cerone, A.; Lindsay, P. (Eds.). Brisbane, Australia, September 22-27, 2003. IEEE Press: pp. 54-61, 2003.

Caspersen, M.E.: An Inverted Curriculum for CS1. In: Proceedings of Frontiers in Education. FiE 2003, 5.-8. november, Boulder, Colorado, USA, 2003.

Caspersen, M.E.; Christensen, H.B.: The Need for Killer Examples for Object-Oriented Frameworks. In: Proceedings of the 18th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA 2003, 26.-30. oktober, Anaheim, CA, USA. ACM Press, 2003.

Christensen, A.S.; Møller, A.; Schwartzbach, M.I.: Precise Analysis of String Expressions. In: Symposium, SAS '03. Maler, O.; Pnueli, A. (Eds.). 2623 of Lecture Notes in Computer Science. Springer-Verlag: pp. 1-18, 2003.

Christensen, B.G.; Hansen, F.A.; Bouvin, N.O.: Xspect: bridging open hypermedia and XLink. In: Proceedings of the 12th International World Wide Web Conference. WWW 2003, 20.-24. maj, Budapest, Ungarn: pp. 490-499, 2003.

Christensen, H.B.: Systematic Testing should not be a Topic in the Computer Science Curriculum! In: Proceedings of 8th Annual Conference on Innovation and Technology in Computer Science Education. Finkel, D. (Ed.). ITiCSE 2003, 30. juni-2. juli, Thessaloniki, Grækenland, 2003.

Cramer, R.; Fehr, S.; Ishai, Y.; Kushilevitz, E.: Efficient Multi-Party Computation over Rings. In: Advances in Cryptology. International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT '03. Biham, E. (Ed.). Warsaw, Poland, May 4-8, 2003. 2656 of Lecture Notes in Computer Science. Springer-Verlag: pp. 596-613, 2003.

Crazzolara, F.; Milicia, G.: A Framework for the Development of Protocols. In: 3rd International Conference on Application of Concurrency to System Design, ACSD '03. Lilius, J.; Balarin, F. (Eds.). Guimarães, Portugal, June 18-20, 2003. IEEE Press: pp. 239-240, 2003.

Crazzolara, F.; Milicia, G.: Wireless Authentication in chi-Spaces. In: Globecom 2003 - Communication Security Track. IEEE Computer Society Press: pp. 1399-1404, 2003.

Damgård, I.B.; Frandsen, G.S.: An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. In: Fundamentals of Computation Theory. 14th International Conference, FCT '03. Lingas, A.; Nilsson, B.J. (Eds.). Malmö, Sweden, August 12-15, 2003. 2751 of Lecture Notes in Computer Science. Springer-Verlag: pp. 118-131, 2003.

Damgård, I.B.; Frandsen, G.S.: Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers. In: Fundamentals of Computation Theory. 14th International Conference, FCT '03. Lingas, A.; Nilsson, B.J. (Eds.). Malmö, Sweden, August 12-15, 2003. 2751 of Lecture Notes in Computer Science. Springer-Verlag: pp. 109-117, 2003.

Damgård, I.B.; Groth, J.: Non-interactive and Reusable Non-maleable Commitment Schemes. In: The Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC '03. Goemans, M. (Ed.). San Diego, California, USA, June 9-11, 2003. ACM Press, New York: pp. 426-437, 2003.

Damgård, I.B.; Jurik, M.J.: A Length-Flexible Threshold Cryptosystem with Applications. In: Information Security and Privacy, 8th Australasian Conference, ACISP '03. Safavi-Naini, R.; Seberry, J. (Eds.). Wollongong, Australia, July 9-11, 2003. 2727 of Lecture Notes in Computer Science. Springer-Verlag: pp. 350-364, 2003.

Damgård, I.B.; Nielsen, J.B.: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In: Advances in Cryptology. 23rd Annual International Cryptology Conference, CRYPTO '03. Boneh, D. (Ed.). Santa Barbara, California, USA, August 17-21, 2003. 2729 of Lecture Notes in Computer Science. Springer-Verlag: pp. 247-264, 2003.

Danvy, O.: A Journey from Interpreters to Compilers and Virtual Machines. In: Second Conference on Generative Programming and Component Engineering, GPCE '03. Pfenning, F.; Smaragdakis, Y. (Eds.). Erfurt, Germany, September 22-25, 2003. 2830 of Lecture Notes in Computer Science. Springer-Verlag: pp. 117, 2003.

Danvy, O.: A New One-Pass Transformation into Monadic Normal Form. In: Compiler Construction, 12th International Conference. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS '03, CC '03. Hedin, G. (Ed.). Warsaw, Poland, April 7-11, 2003. 2622 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 77-89, 2003.

Danvy, O.; López, P.E.M.: Tagging, Encoding, and Jones Optimality. In: Programming Languages and Systems. Twelfth European Symposium on Programming; Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS '03, ESOP '03. Degano, P. (Ed.). Warsaw, Poland, April 9-11, 2003. 2618 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 335-347, 2003.

Ernst, E.: Higher-Order Hierarchies. In: Proceedings of 17th Conference for Object-Oriented Programming. Cardelli, L. (Ed.). ECOOP'03, 21.-25. juli, Darmstadt, Tyskland. 2743 of Lecture Notes in Computer Science. Springer-Verlag: pp. 303-329, 2003.

Fredslund, J.; Hein, J.; Scharling, T.: A Large Version of the Small Parsimony Problem. In: Algorithms in Bioinformatics. 2nd International Workshop, WABI '03. Benson, G.; Page, R.D.M. (Eds.). udapest, Hungary, September 15-20, 2003. 2812 of Lecture Notes in Computer Science. Springer-Verlag: pp. 417-432, 2003.

Gal, A.; Miltersen, P.B.: The Cell Probe Complexity of Succinct Data Structures. In: Fundamentals of Computation Theory. 14th International Conference, FCT '03. Lingas, A.; Nilsson, B.J. (Eds.). Malmö, Sweden, August 12-15, 2003. 2751 of Lecture Notes in Computer Science. Springer-Verlag: pp. 442-453, 2003.

Gerhardy, P.: Refined Complexity Analysis of Cut Elimination. In: 2003. Baaz, M.; Makowsky, J.A. (Eds.). 2803 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 212-225, 2003.

Groth, J.: A Verifiable Secret Shuffle of Homomorphic Encryptions. In: 6th International Workshop on Practice and Theory in Public Key Cryptography, PKC '03. Desmedt, Y. (Ed.). Miami, Florida, USA, January 6-8, 2003. 2567 of Lecture Notes in Computer Science. Springer-Verlag: pp. 145-160, 2003.

Grønbæk, K.; Kristensen, J.F.; Ørbæk, P.; Eriksen, M.A.: Physical Hypermedia: Organising Collections of Mixed Physical and Digital Material. In: Proceedings of the Fourteenth ACM Conference on Hypertext and Hypermedia. Hypertext 03, 26.-30. august, Nottingham, England. ACM Press: pp. 10-19, 2003.

Hansen, K.A.; Miltersen, P.B.; Vinay, V.: Circuits on Cylinders. In: International Symposium. Lingas, A.; Nilsson, B.J. (Eds.). FCT'03. 2751 of Lecture Notes in Computer Science. Springer-Verlag: pp. 171-182, 2003.

Hansen, K.M.: Activity-Centred Tool Integration. In: Proceedings of the Tool Integration in System Development Workshop. Schürr, A.; Dörr, H. (Eds.). European Software Engineering Conference, 1.-2. september, Helsinki, Finland: pp. 11-16, 2003.

Jensen, O.H.; Milner, R.: Bigraphs and Transitions. In: 30th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '03. Morrisett, G. (Ed.). New Orleans, LA, USA, January 15-17, 2003. ACM Press: pp. 38-49, 2003.

Jørgensen, J.B.: Coloured Petri Nets in Development of a Pervasive Health Care System. In: Proceedings of the 24th International Conference on the Application and Theory of Petri Nets. Aalst, W.M.P.van der; Best, E. (Eds.). ICATPN 2003, Eindhoven, Holland. 2679 of Lecture Notes in Computer Science. Springer-Verlag: pp. 256-275, 2003.

Jørgensen, J.B.; Bossen, C.: Requirements Engineering for a Pervasive Health Care System. In: Proceedings of the 11th International Requirements Engineering Conference. Wieringa, R. (Ed.). RE'03, 8-12 september 2003, Monterey Bay, CA, USA. IEEE: pp. 55-64, 2003.

Kejser, T.; Grønbæk, K.: The Gaia Framework: Version Support In Web Based Open Hypermedia. In: Proceedings of the IADIS International Conference on WWW/Internet 2003. WWW/Internet 2003, 5-8 november 2003, Algarve, Portugal: pp. 314-325, 2003.

Kiltz, E.; Malone-Lee, J.: A General Construction of IND-CCA2 Secure Public Key Encryption. In: Cryptography and Coding, 9th IMA International Conference, IMA- CC '03. Paterson, K.G. (Ed.). Cirencester, United Kingdom, December 16-18, 2003. 2898 of Lecture Notes in Computer Science. Springer-Verlag: pp. 152-166, 2003.

Klin, B.; Sobocinski, P.: Syntactic Formats for Free. An Abstract Approach to Process Equivalence. In: Concurrency Theory. 14th International Conference, CONCUR '03. Amadio, R.; Lugiez, D. (Eds.). Marseille, France, September 3-5, 2003. 2761 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 72-86, 2003.

Korovina, M.: Computational Aspects of Sigma-Definability over the Real Numbers without the Equality Test. In: European Association for Computer Science Logic. 17th International Workshop, CSL '03. Baaz, M.; Makowsky, J.A. (Eds.). Vienna, Austria, August 25-30, 2003. 2803 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 330-340, 2003.

Korovina, M.: Fixed Points on Abstract Structures without the Equality Test. In: Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR '03. Vardi, M.Y.; Voronko, A. (Eds.). Almaty, Kazakhstan, September 22-26, 2003. 2860 of Lecture Notes in Computer Science. Springer-Verlag: pp. 290-301, 2003.

Kristensen, L.M.; Mailund, T.: Efficient Path Finding with the Sweep-Line Method using External Storage. In: Proceedings of International Conference on Formal Engineering Methods. ICFEM'03, 5.-7. november, Singapore. 2885 of Lecture Notes in Computer Science. Springer-Verlag: pp. 319-337, 2003.

Lambov, B.: A Two Layer Approach to the Computability and Complexity of Real Functions. In: Computability and complexity in Analysis 2003. 302 of Informatic Berichte. Fernuniversität Hagen: pp. 279-302, 2003.

Lorenz, D.H.; Ernst, E.: Aspects and Polymorphism in AspectJ. In: Proc. of AOSD'03. Aksit, M. (Ed.). ACM Press: pp. 150-157, 2003.

Miltersen, P.B.; Radhakrishnan, J.; Wegener, I.: On converting CNF to DNF. In: Mathematical Foundations of Computer Science. 28th International Symposium, MFCS '03. Rovan, B.; Vojtás, P. (Eds.). Bratislava, Slovakia, August 25-29, 2003. 2747 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 612-621, 2003.

Mosegaard, J.; Bennedsen, J.: A Framework for Narration and Learning in Educational Multimedia. In: Proceedings of World Conference on Educational Multimedia, Hypermedia and Telecommunications. ED-MEDIA 2003, 23.-28. juni, Honolulu, Hawaii, USA: pp. 99-106, 2003.

Mosses, P.D.: Some Novel Techniques in Operational Semantics. In: Concurrency, Specification, and Programming, CS and P 2003, Czarna, Poland. Czaja, L. (Ed.). Warsaw University: pp. 21-34, 2003.

Nielsen, M.; Krukow, K.: Towards a Notion of Trust Domains. In: Principles and Practice of Declarative Programming, PPDP'03. ACM Press: pp. 4-7, 2003.

Nygaard, M.; Winskel, G.: Full Abstraction for HOPLA. In: Concurrency Theory. 14th International Conference, CONCUR '03. Amadio, R.; Lugiez, D. (Eds.). Marseille, France, September 3-5, 2003. 2761 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 383-398, 2003.

Nørregaard, P.; Andersen, J.; Dindler, C.; Fritsch, J.; Iversen, O.S.; Nielsen, C.: NetWorking News - A Method for Engaging Children Actively In Design. In: Electronic Proceedings of the the 26th Information Systems Research Seminar in Scandinavia. IRIS 26, 9.-12. august, Haikko Manor, Finland, 2003.

Oliva, P.B.: Polynomial-Time Algorithms from Ineffective Proofs. In: Eighteenth Annual IEEE Symposium on Logic in Computer Science, Lics '03. Kolaitis, P.G. (Ed.). Ottawa, Canada, June 22-25, 2003. IEEE Press: pp. 128-137, 2003.

Petrucci, L.; Billington, B; Kristensen, L.M.; Qureshi, A.H.: Developing a Formal Specification for the Mission Systems of a Maritime Surveillance Aircraft. In: Proceedings of Third International Conference on Application of Concurrency to System Design. ACSD'03, 18.-20. juni 2003, Guimaraes, Portugal. IEEE Computer Society: pp. 92-101, 2003.

Ratzer, A.; Wells, L.; Lassen, H.M.; Laursen, M.; Qvortrup, J.F.; Stissing, M.S.; Westergaard, M.; Christensen, S.; Jensen, K.: CPN Tools for Editing, Simulating, and Analysing Coloured Petri Nets. In: Proceedings of the 24th International Conference on the Application and Theory of Petri Nets. Aalst, W.M.P.van der; Best, E. (Eds.). ICATPN 2003, 23.-27. juni, Eindhoven, Holland. 2679 of Lecture Notes in Computer Science. Springer-Verlag: pp. 450-462, 2003.

Sassone, V.; Sobocinski, P.: Deriving Bisimulation Congruences. 2-Categories vs. Precategories. In: Foundations of Software Science and Computation Structures. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS '03, FoSSaCS '03. Gordon, A.D. (Ed.). Warsaw, Poland, April 7-11, 2003. 2620 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 409-424, 2003.

Schultz, U.P.; Burgaard, K.; Christensen, F.G.; Knudsen, J.L.: Compiling Java for low-end embedded systems. In: Proceedings of the 2003 ACM SIGPLAN conference on Languages, compilers, and tools for embedded systems. ACM Press, San Diego, CA, USA: pp. 42-50, 2003.

Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: 6th International Conference, Developments in Language Theory, DLT '02 Revised Papers. Ito, M.; Toyama, M. (Eds.). Kyoto, Japan, September 18-21, 2002. 2450 of Lecture Notes in Computer Science. Springer-Verlag: pp. 197-208, 2003.

Thomsen, R.: Flexible Ligand Docking Using Differential Evolution. In: 2003 Congress on Evolutionary Computation: pp. 2354-2361, 2003.

Thomsen, R.; Fogel, G.B.; Krink, T.: Improvement of Clustal-Derived Sequence Alignments with Evolutionary Algorithms. In: 2003 Congress on Evolutionary Computation. IEEE Press: pp. 1499-1507, 2003.

Vesterstrøm, J.S.: Physical Mapping Using Simulated Annealing and Evolutionary Algorithms. In: 2003 Congress on Evolutionary Computation. IEEE Press, 2003.

 

Artikler i internationale tidsskrifter

Arnold, A.; Vincent, A.; Walukiewicz, I.: Games for Synthesis of Controllers with Partial Observation,. Theoretical Computer Science; 1(303): 7-34, 2003.

Bach, L.A.; Sumpter, D.J.T.; Alsner, J.; Loeschcke, V.: Spatial Evolutionary Games of Interaction among Generic Cancer Cells. Journal of Theoretical Medicine:; 5(1): 47-58, 2003.

Berg, A.R.; Jackson, B.; Jordán, T.: Highly Edge-Connected Detachments of Graphs and Digraphs. Journal of Graph Theory; 43(1): 67-77, 2003.

Berg, A.R.; Jordán, T.: A Proof of Connelly's Conjecture on 3-Connected Generic Cycles. Journal of Combinatorial Theory, Series B; 88(1): 17-37, 2003.

Bernet, J.; Janin, D.; Walukiewicz, I.: Permissive strategies. From parity games to safety games. Informatique Théorique et Applications; 36(3): 261-275, 2003.

Billington, J.; Gallasch, G.E.; Kristensen, L.M.; Mailund, T.: Exploiting Equivalence Reduction and the Sweep-Line Method for Detecting Terminal States. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans; 34(1): 23-37, 2003.

Bouvin, N.O.: Augmenting the Web through Open Hypermedia. The New Review of Hypermedia and Multimedia; 8: 3-26, 2003.

Bouvin, N.O.; Christensen, B.G.; Grønbæk, K.; Hansen, F.A.: HyCon: A Framework for Context-aware Mobile Hypermedia. The New Review of Hypermedia and Multimedia; 9, 2003.

Britz, D.; Østerby, O.; Strutwolf, J.: Damping of Crank-Nicolson Error Oscillations. Comp. Biology and Chem.; 27: 253-263, 2003.

Brodal, G.S.; Fagerberg, R.; Pedersen, C.N.S.: Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n). Algorithmica, Special issue on ISAAC 2001; 38(2): 377-395, 2003.

Brodal, G.S.; Lagogiannis, G.; Makris, C.; Tsakalidis, A.; Tsichlas, K.: Optimal Finger Search Trees in the Pointer Machine. Journal of Computer and System Sciences; 67(2): 381-418, 2003.

Cahill, V.; Gray, E.; Seigneur, J.; Jensen, C.; Chen, Y.; Shand, B.; Dimmock, N.; Twigg, A.; Bacon, J.; English, C.; Wagealla, W.; Terzis, S.; Nixon, P.; Serugendo, G.d.M.; Bryce, C.; Carbone, M.; Krukow, K.; Nielsen, M.: Using trust for Secure Collaboration in Uncertain Environments. IEEE Pervasive Computing; 2(3): 52-61, 2003.

Carbone, M.; Maffeis, S.: On the Expressive Power of Polyadic Synchronisation in Pi-Calculus. Nordic Journal of Computing; 10(2): 29, 2003.

Cattani, G.L.; Winskel, G.: Presheaf Models for CCS-like Languages. Theoretical Computer Science; 300(1-3): 47-89, 2003.

Christensen, A.S.; Møller, A.; Schwartzbach, M.I.: Extending Java for High-Level Web Service Construction. ACM Transactions on Programming Languages and Systems; 25(6): 814-875, 2003.

Christensen, S.; Kristensen, L.M.: State Space Analysis of Hierarchical Coloured Petri Nets. LINCOM Studies in Computer Science, München; (1): 1-16, 2003.

Danvy, O.; Nielsen, L.R.: A First-Order One-Pass CPS Transformation. Theoretical Computer Science; 308(1-3): 239-257, 2003.

Doh, K.; Mosses, P.D.: Composing Programming Languages by Combining Action-Semantics Modules. Science of Computer Programming; 47(1): 3-36, 2003.

Drummond, A.J.; Pybus, O.G.; Rambaut, A.; Forsberg, R.; Rodrigo, A.G.: Measurably evolving populations. Trends in Ecology and Evolution; 18(9): 481-488, 2003.

Forsberg, R.; Christiansen, F.B.: A Codon-Based Model of Host-Specific Selection in Parasites, with an Application to the Influenza A Virus. Molecular Biology and Evolution; 20(8): 1252-1259, 2003.

Fridlender, D.: A Proof-Irrelevant Model of Martin-Löf's Logical Framework. Mathematical Structures in Computer Science; 12(6): 771-795, 2003.

Grønbæk, K.; Kristensen, J.F.; Ørbæk, P.; Eriksen, M.A.: Augmenting Physical Material with Hypermedia Structures. New Review of Hypermedia and Multimedia 2003. Special issue on Hypermedia beyond the Desktop, 2003.

Hein, J.; Jensen, J.L.; Pedersen, C.N.S.: Recursions for Statistical Multiple Alignment. Proceedings of the National Academy of Science, U.S.A.; 100: 14960-14965, 2003.

Hill, M.C.; Østerby, O.: Determining extreme parameter correlation in ground water models. Ground Water; 41: 420-430, 2003.

Hobolth, A.: A Continuous Parametric Shape Model. Annals of the Institute of Statistical Mathematics; 55: 227-242, 2003.

Hobolth, A.: The Spherical Deformation Model. Biostatistics; 4: 583-595, 2003.

Jeannet, B.: Dynamic Partitioning in Linear Relation Analysis. Formal Methods in System Design; 23(1): 5-37, 2003.

Jurdzinski, M.; Nielsen, M.; Srba, J.: Undecidability of Domino Games and Hhp-Bisimilarity. Information and Computation; 184(2): 343-368, 2003.

Jørgensen, J.B.; Kristensen, L.M.: Verification of Coloured Petri Nets Using State Spaces with Equivalence Classes. LINCOM Studies in Computer Science, München; (1): 17-34, 2003.

Kohlenbach, U.: Uniform Asymptotic Regularity for Mann Iterates. Journal of Mathematical Analysis and Applications; 279(2): 531-544, 2003.

Kohlenbach, U.; Leustean, L.: Mann Iterates of Directionally Nonexpansive Mappings in Hyperbolic Spaces. Abstract and Applied Analysis; 2003(8): 449-477, 2003.

Kohlenbach, U.; Oliva, P.B.: Proof Mining. A Systematic Way of Analysing Proofs in Mathematics. From Trudy Matematicheskogo Instituta imeni V.A. Steklova, vol. 242, 2003, pp. 147-175. Proceedings of the Steklov Institute of Mathematics; 242: 136-164, 2003.

Kohlenbach, U.; Oliva, P.B.: Proof Mining in L1-Approximation. Annals of Pure and Applied Logic; 121: 1-38, 2003.

Nagamochi, H.; Jordán, T.; Nakao, Y.; Ibaraki, T.: Convex Embeddings and Bisections of 3-Connected Graphs. Combinatorica; 22(4): 537-554, 2003.

Niwinski, D.; Walukiewicz, I.: A Gap Property of Deterministic Tree Languages. Theoretical Computer Science; 1(303): 215-231, 2003.

Pertoldi, C.; Bach, L.A.; Madsen, A.B.; Randi, E.; Loeschcke, V.: Morphological variability and developmental instability in subpopulations of the Eurasian badger (Meles meles) in Denmark. Journal of Biogeography; 30: 949-958, 2003.

Rasmussen, T.K.; Krink, T.: Improving Hidden Markov Model Training for Multiple Sequence Alignment by a Particle Swarm Optimization - Evolutionary Algorithm Hybrid. BioSystems; 72: 5-17, 2003.

Rhiger, M.: A Foundation for Embedded Languages. ACM Transactions on Programming Languages and Systems; 25(3): 291-315, 2003.

Riecke, J.G.; Sandholm, A.B.: A Relational Account of Call-by-Value Sequentiality. LICS '97 Special Issue. Information and Computation; 179(2): 296-331, 2003.

Rodrigo, A.G.; Goode, M.; Forsberg, R.; Ross, H.A.; Drummond, A.: Inferring Evolutionary Rates Using Serially Sampled Sequences from Several Populations. Molecular Biology and Evolution; 20: 2010-2018, 2003.

Santocanale, L.: On the Equational Definition of the Least Prefixed Point. Theoretical Computer Science; 295(1-3): 341-371, 2003.

Sassone, V.; Sobocinski, P.: Deriving Bisimulation Congruences using 2-categories. Nordic Journal of Computing; 10(2): 163-183, 2003.

Schultz, U.P.; Lawall, J.L.; Consel, C.: Automatic program specialization for Java. ACM Transactions on Programming Langauges and Systems (TOPLAS); 25(4): 452-499, 2003.

Srba, J.: Complexity of Weak Bisimilarity and Regularity for BPA and BPP. Mathematical Structures in Computer Science; 13: 567-587, 2003.

Srba, J.: Strong Bisimilarity of Simple Process Algebras. Complexity Lower Bounds. Acta Informatica; 39: 469-499, 2003.

Thomsen, R.: Flexible Ligand Docking Using Evolutionary Algorithms. Investigating the Effects of Variation Operators and Local-Search Hybrids. BioSystems; 72(1-2): 57-73, 2003.

Toman, D.; Bowman, I.T.: Optimizing Temporal Queries. Efficient Handling of Duplicates. Data and Knowledge Engineering; 44(2): 143-164, 2003.

Topping, C.J.; Østergaard, S.; Pertoldi, C.; Bach, L.A.: Modelling the loss of genetic diversity in vole populations in a spatially and temporally varying environment. Annales Zoologici Fennici; 40: 255-267, 2003.

Walukiewicz, I.: Local Logics for Traces. Journal of Automata, Languages and Combinatorics; 7(2): 259-290, 2003.

Winskel, G.: Presheaf models for CCS-like languages. Theoretical Computer Science; 300(1-3): 47-89, 2003.

Østerby, O.: Five ways of reducing the Crank-Nicolson Oscillations. BIT Numerical Mathematics; 43: 811-822, 2003.

 

Artikler i danske tidsskrifter

Abendroth, J.: Applying pi-Calculus to Practice. An Example of a Unified Security Mechanism. BRICS Research Series, Aarhus; (RS-03-39): 35, 2003.

Ager, M.S.; Biernacki, D.; Danvy, O.; Midtgaard, J.: A Functional Correspondence between Evaluators and Abstract Machines. BRICS Research Series, Aarhus; (RS-03-13): 28, 2003.

Ager, M.S.; Biernacki, D.; Danvy, O.; Midtgaard, J.: From Interpreter to Compiler and Virtual Machine. A Functional Derivation. BRICS Research Series, Aarhus; (RS-03-14): 36, 2003.

Ager, M.S.; Danvy, O.; Midtgaard, J.: A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects. BRICS Research Series, Aarhus; (RS-03-35): 31, 2003.

Ager, M.S.; Danvy, O.; Midtgaard, J.: A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines. BRICS Research Series, Aarhus; (RS-03-24): 13, 2003.

Biernacka, M.; Biernacki, D.; Danvy, O.: An Operational Foundation for Delimited Continuations. BRICS Research Series, Aarhus; (RS-03-41): 21, 2003.

Brabrand, C.; Schwartzbach, M.I.; Vanggaard, M.: The METAFRONT System. Extensible Parsing and Transformation. BRICS Research Series, Aarhus; (RS-03-7): 24, 2003.

Byskov, J.M.; Madsen, B.A.; Skjernaa, B.: New Algorithms for Exact Satisfiability. BRICS Research Series, Aarhus; (RS-03-30): 31, 2003.

Böttger, H.; Møller, A.; Schwartzbach, M.I.: Contracts for Cooperation between Web Service Programmers and HTML Designers. BRICS Research Series, Aarhus; (RS-03-38): 23, 2003.

Christensen H.B.: Using Software Architectures for Designing Distributed Embedded Systems. Center for Pervasive Computing Publications; (CfPC-2003-PB-55), 2003.

Christensen H.B.; Eriksen, O.: An Architectural Style for Closed-loop Process-Control. Center for Pervasive Computing Publications; (CfPC-2003-PB-54), 2003.

Christensen, A.S.; Kirkegaard, C.; Møller, A.: A Runtime System for XML Transformations in Java. BRICS Research Series, Aarhus; (RS-03-29): 15, 2003.

Christensen, A.S.; Møller, A.; Schwartzbach, M.I.: Precise Analysis of String Expressions. BRICS Research Series, Aarhus; (RS-03-5): 15, 2003.

Crazzolara, F.; Milicia, G.: Wireless Authentication in chi-Spaces. BRICS Research Series, Aarhus; (RS-03-10): 20, 2003.

Crépeau, C.; Dumais, P.; Mayers, D.; Salvail, L.: Computational Collapse of Quantum State with Application to Oblivious Transfer. BRICS Research Series, Aarhus; (RS-03-37): 30, 2003.

Crépeau, C.; Dumais, P.; Mayers, D.; Salvail, L.: On the Computational Collapse of Quantum Information. BRICS Research Series, Aarhus; (RS-03-3): 31, 2003.

Damgård, I.B.; Jurik, M.J.: A Length-Flexible Threshold Cryptosystem with Applications. BRICS Research Series, Aarhus; (RS-03-16): 31, 2003.

Damgård, I.B.; Jurik, M.J.: Scalable Key-Escrow. BRICS Research Series, Aarhus; (RS-03-22): 15, 2003.

Filinski, A.; Rohde, H.K.: A Denotational Account of Untyped Normalization by Evaluation. BRICS Research Series, Aarhus; (RS-03-40): 29, 2003.

Gerhardy, P.; Kohlenbach, U.: Extracting Herbrand Disjunctions by Functional Interpretation. BRICS Research Series, Aarhus; (RS-03-32): 17, 2003.

Hansen, K.A.: Constant Width Planar Computation Characterizes ACC0. Technical Report; (TR03-025): 11, 2003.

Hernest, M.; Kohlenbach, U.: A Complexity Analysis of Functional Interpretations. BRICS Research Series, Aarhus; (RS-03-12): 70, 2003.

Kirkegaard, C.; Møller, A.; Schwartzbach, M.I.: Static Analysis of XML Transformations in Java. BRICS Research Series, Aarhus; (RS-03-19): 29, 2003.

Kohlenbach, U.; Lambov, B.: Bounds on Iterations of Asymptotically Quasi-Nonexpansive Mappings. BRICS Research Series, Aarhus; (RS-03-51): 24, 2003.

Korovina, M.: Recent Advances in Sigma-definability over Continuous Data Types. BRICS Research Series, Aarhus; (RS-03-23): 24, 2003.

Krink, T.; Paterlini, S.: Differential Evolution and Particle Swarm Optimization for Partitional Clustering. Technical Report; (446), 2003.

Lack, S.; Sobocinski, P.: Adhesive Categories. BRICS Research Series, Aarhus; (RS-03-31): 25, 2003.

Lambov, B.: A Two-Layer Approach to the Computability and Complexity of Real Numbers. BRICS Research Series, Aarhus; (RS-03-50): 16, 2003.

Mortensen, K.H.; Schougaard, K.S.F.; Schultz, U.P.: A Programming Language Approach to Safety in Home Networks. Center for Pervasive Computing Publications, Aarhus; (CfPC-2003-PB-53), 2003.

Nygaard, M.; Winskel, G.: Domain Theory for Concurrency. BRICS Research Series, Aarhus; (RS-03-43): 45, 2003.

 

Letters, kommentarer, videnskabelig debat

 

Bidrag i antologier

Kaptelinin, V.; Nardi, B.; Bødker, S.; Carroll, J.; Hollan, J.; Hutchins, E.; Winograd, T.: Post-cognitivist HCI: second-wave theories. In: Proceedings of ACM CHI 2003 Conference on Human Factors in Computing Systems. CHI'03, 5.-10. april, Fort Lauderdale, FL, USA. ACM Press: pp. 692-693, 2003.

 

Konferencebidrag, arbejdspapirer

 

Bidrag i antologier

Bardram, J.: Hospitals of the Future - Ubiquitous Computing support for Medical Work in Hospitals. In: Proceedings of the 2nd International Workshop on Ubiquitous Computing for Pervasive Healthcare Applications. UbiHealth 2003, 2003.

Braga, C.de O.; Haeusler, E.H.; Meseguer, J.; Mosses, P.D.: Mapping Modular SOS to Rewriting Logic. In: Proceedings of International Workshop on Logic Based Program Development and Transformation, 2003.

Brand, M.v.d.; Mosses, P.D.; Iversen, J.: An Action Environment. Extended abstract. In: Proceedings of the Interaction Design and Children 2003 Conference. IDC'03, 1.-3. juli, Preston, England, 2003.

Christensen, H.B.: Software Testing Requires Variability. In: Proceedings of Workshop on Software Variability Management. 13.-14. februar, Groningen, Holland: pp. 116-118, 2003.

Ernst, E.: Separation of Concerns. In: Proceedings of the Workshop 'Software-engineering Properties of Languages for Aspect Technologies'. International Conference on Aspect-Oriented Software Development, 17.-21. marts, Boston, MA, USA: pp. 6, 2003.

 

Evalueringsrapporter, forskningsrapporter

 

Monografier

Brodal, G.S.; Fagerberg, R.; Mailund, T.; Pedersen, C.N.S.; Phillips, D.: Speeding Up Neighbour-Joining Tree Construction. ALCOMFT-TR-03-102: 9 pages, 2003.

Schwartzbach, M.I.: Rapport om datalogi i gymnasiet. Undervisningsministeriet, 2003.

 

Anden forskningsformidling

 

Monografier

Agger Eriksen M.; Buscher M.; Christensen M.: Grounded Imagination: Dialogue in Context. Præsentation og webcast. www.tate.org.uk/modern/eventseducation/fieldworks. Fieldworks - Dialogues between Art and Anthropology, 26.-28. september, Tate Modern Gallery, London, 2003.

Bennedsen, J.; Caspersen, M.E.: A Model-First Approach to Teaching Introductory Object-Orientation. www.intermedia.uio.no/cool/WS-03.html. Cool 2003, 20. oktober, Oslo, Norge, 2003.

Christensen, M.: WorkSPACE. e-locus.fundaciontekniker.com/venezia03/. Workspace Venezia 2003 - Shaping the future workspace; Essential Tools for the future, 3.-4. juli, Venedig, Italien, 2003.

Christensen, M.: WorkSPACE: Augmenting the work environment through spatial artifacts. Præsentation. www.milkforum.com. MILK Conference - Designing Work Spaces of the Future, 16. oktober, Bruxelles, Belgien, 2003.

 

Bidrag i antologier

Christensen, A.S.: Programanalyse - en metode til fejlfinding i software. In: Aarhus Universitets Forskningsfonds Årsberetning 2002, 2003.

Georgsen, M.; Bennedsen, J.: Technology, pedagogy and on-line materials - keywords in developing on line education. Abstract. In: CAL'03 - 21st Century Learning Abstract Book. 8.-10. april, Belfast, Nordirland, 2003.

Iversen, O.S.; Nielsen, C.: Using Digital Cultural Probes in Design with Children. Poster paper. In: Proceedings of the Interaction Design and Children 2003 conference. IDC'03, 1.-3. juli 2003, Preston, England, 2003.

Kristensen, J.F.; Eriksen, M.A.; Iversen, O.S.; Kanstrup, A.M.; Nielsen, C.; Petersen, M.G.: Young People In Old Cars - Challenges For Cooperative Design. CD-rom. Awarded Best Theme Paper at the conference. In: Electronic Proceedings of the 26th Information Systems Research Seminar in Scandinavia. IRIS 26, 9-12 August 2003, Haikko Manor, Finland, 2003.

Workspace: Documentation of Appliances and Interaction Devices. In: EU,IST, FET, DC project, Workspace. Mogensen, P.H. (Ed.). www.daimi.au.dk/workspace/Deliverables/WS-D16-v1-0.pdf. Deliverable 16. Datalogisk Institut, Aarhus Universitet, 2003.

Workspace: Documentation of Infrastructure. In: EU,IST, FET, DC project, Workspace. Mogensen, P.H. (Ed.). www.daimi.au.dk/workspace/Deliverables/WS-D17-v1-0.pdf. Deliverable 17. Datalogisk Institut, Aarhus Universitet, 2003.

Workspace: Final Demonstrator Status. In: EU,IST, FET, DC project, Workspace. Mogensen, P.H. (Ed.). www.daimi.au.dk/workspace/Deliverables/WS-D5-v1.0.pdf. Deliverable 5. Datalogisk Institut, Aarhus Universitet, 2003.

Workspace: Final Evaluations. In: EU,IST, FET, DC project, Workspace. Mogensen, P.H. (Ed.). www.daimi.au.dk/workspace/Deliverables/WS-D18-v1-0.pdf. Deliverable 18. Datalogisk Institut, Aarhus Universitet, 2003.

Workspace: Final Project Report. In: EU,IST, FET, DC project, Workspace. Mogensen, P.H. (Ed.). www.daimi.au.dk/workspace/Deliverables/WS-FinalReportV1-0.pdf. Datalogisk Institut, Aarhus Universitet, 2003.

 

Redaktionsarbejde

 

Danvy, O., co-edited med Peter Thiemann: Special Issue of Higher-Order and Symbolic Computation. Partial Evaluation and Semantics-Based Program Manipulation. PEPM'02. 16 (4), 2003.

Danvy, O., co-edited med Fritz Henglein, Harry Mairson and Alberto Pettorossi: Special issue of Higher-Order and Symbolic Computation. - in memory of Bob Paige. 16 (1/2), 2003.

Danvy, O., co-edited med Wei-Ngan Chin og Peter Thiemann: Special issue of Higher-Order and Symbolic Computation. Partial Evaluation and Semantics-Based Program Manipulation. 17 (1), 2003.

Grønbæk, K.: New Review of Hypermedia and Multimedia. Special issue on Hypermedia Beyond the Desktop. 9, 2003.

Miller, D.: A Functional Correspondence between Evaluators and Abstract Machines, 2003.

Schwartzbach, M.I.: PLAN-X 2004 Informal. Venice, Italy, 13 January, 2004. Notes Series NS-03-4. Aarhus, 2003.

 

Monografier

Dantchev, S.: On Resolution Complexity of MatchingPrinciples. Ph.d.-afhandling. BRICS Dissertation SeriesDS-02-2. University of Aarhus: xii+70 pages, 2002.

Elgaard, L.: The Symmetry Method for Coloured PetriNets. Theory, Tools and Practical Use. Ph.d.-afhandling.DAIMI PB-564. Datalogisk Institut, Aarhus Universitet: 169pages, 2002.

Hansen, K.M.: Experimental Object-OrientedModelling. Ph.d.-afhandling. DAIMI PB-559. DatalogiskInstitut, Aarhus Universitet: 138 pages, 2002.

Jacob, R.: Dynamic Planar Convex Hull.Ph.d.-afhandling. BRICS Dissertation Series DS-02-3. Universityof Aarhus: xiv+110 pages, 2002.

Lindstrøm, B.: Facilitating the Practical Use ofColoured Petri Nets. Ph.d.-afhandling. DAIMI PB-562.Datalogisk Institut, Aarhus Universitet: 180 pages, 2002.

Möller, M.O.: Structure and Hierarchy in Real-TimeSystems. Ph.d.-afhandling. BRICS Dissertation SeriesDS-02-1. University of Aarhus: xvi+228 pages, 2002.

Møller, A.: Program Verification with MonadicSecond-Order Logic & Languages for Web ServiceDevelopment. Ph.d.-afhandling. BRICS Dissertation SeriesDS-02-4. University of Aarhus: xvi+337 pages, 2002.

Nielsen, A.C.: Designing to support Mobile Work withMobile Devices. Ph.d.-afhandling. DAIMI PB-565. DatalogiskInstitut, Aarhus Universitet: 155 pages, 2002.

Pagh, R.: Hashing, Randomness and Dictionaries.Ph.d.-afhandling. BRICS Dissertation Series DS-02-5. Universityof Aarhus: x+167 pages, 2002.

Wells, L.: Performance Analysis using Coloured PetriNets. Ph.d.-afhandling. DAIMI PB-563. Datalo­giskInstitut, Aarhus Universitet: 163 pages, 2002.

Bidrag i antologier

Abe, M.; Cramer, R.; Fehr, S.: Non-InteractiveDistributed-Verifier Proofs and Proving Relations amongCommitments. In: Advances in Cryptology. 8th ASIACRYPTConference on the Theory and Applications of CryptologicTechniques, ASIACRYPT '02. Zheng, Y. (Ed.). New Zealand,December 1-5, 2002. 2501 of Lecture Notes in Computer Science.Springer-Verlag: pp. 565-580, 2002.

Ager, M.S.; Danvy, O.; Goldberg, M.: A Symmetric Approach toCompilation and Decompilation. In: The Essence ofComputation. Complexity, Analysis, Transformation.Mogensen, T.Æ.; Schmidt, D.A.; Sudborough, I.H. (Eds.).2556 of Lecture Notes in Computer Science. Springer-Verlag,Berlin: pp. 296-331, 2002.

Ager, M.S.; Danvy, O.; Rohde, H.K.: On Obtaining the KMPString Matcher by Partial Evaluation. In: Symposium onPartial Evaluation and Semantics-Based ProgramManipulation. Chin, W. (Ed.). ACM Press: pp. 32-46,2002.

Alstrup, S.; Brodal, G.S.; Gørtz, I.L.; Rauhe, T.: Timeand Space Efficient Multi-Method Dispatching. In: 8thScandinavian Workshop on Algorithm Theory, SWAT '02 Proceedings(Turku, Finland, July 3-5, 2002). Penttonen, M.; Schmidt,E.M. (Eds.). 2368 of Lecture Notes in Computer Science.Springer-Verlag: pp. 20-29, 2002.

Amtoft, T.; Consel, C.; Danvy, O.; Malmkjær, K.: TheAbstraction and Instantiation of String-Matching Programs. In:The Essence of Computation. Complexity, Analysis,Transformation. Mogensen, T.Æ.; Schmidt, D.A.;Sudborough, I.H. (Eds.). 2556 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 332-357, 2002.

Balat, V.; Danvy, O.: Memorization in Type-Directed PartialEvaluation. In: ACM SIGPLAN/SIGSOFT Conference onGenerative Programming and Component Engineering. Theconference is affiliated the colloquium on Principles, Logics,and Implementations of high-level programming language.Batory, D.; Consel, C.; Taha, W. (Eds.). PLI '02, GPCE '02Proceedings (Pittsburgh, Pennsylvania, USA, October 6-8, 2002).2487 of Lecture Notes in Computer Science. Springer-Verlag: pp.78-92, 2002.

Bang, T.; Grønbæk, K.; Hansen, P.S.: Using a MetroMap Metaphor for organizing Web-based learning resources. In:Proceedings of ED-MEDIA 2002. Barker, P.; Rebelsky, S.(Eds.). World conference on educational multimedia, hypermedia& telecommunications, Denver, Colorado, USA, June 24-29,2002: pp. 647-652, 2002.

Bendtsen, C.N.; Krink, T.: A Dynamic Memory Model forNon-Stationary Optimization. In: Fourth Congress onEvolutionary Computation. Held in connection with WCCI-2002,CEC '02. Fogel, D.B.; Yao, X.; Greenwood, G.; Iba, H.;Marrow, P.; Shackleton, M. (Eds.). Honolulu, Hawaii, USA, May12-17, 2002. IEEE Press: pp. 145-150, 2002.

Bendtsen, C.N.; Krink, T.: Phone Routing using the DynamicMemory Model. In: Fourth Congress on EvolutionaryComputation. Held in connection with WCCI-2002, CEC '02.Fogel, D.B.; Yao, X.; Greenwood, G.; Iba, H.; Marrow, P.;Shackleton, M. (Eds.). Honolulu, Hawaii, USA, May 12-17, 2002.IEEE Press: pp. 992-997, 2002.

Bertelsen, O.W.; Bødker, S.: Discontinuities. In:Social Thinking - Software Practice. Floyd, C.;Dittrich, Y.; Klischewski, R. (Eds.). MIT Press, Cambridge, MA,USA: pp. 409-424, 2002.

Bossen, C.: Ethnography in design: Tool-kit or analyticscience? In: Proceedings of the Participatory DesignConference. Binder, T.; Gregory, J.; Wagner, I. (Eds.).PDC 2002, 23-25 June 2002, Malmø, Sweden: pp. 338-343,2002.

Bossen, C.: The Parameters of Common Information Spaces: theHeterogeneity of cooperative work at a Hospital Ward. In:Proceedings of the Conference on Computer-SupportedCooperative Work. 26.-28. november 2002, New Orleans, USA:pp. 176-185, 2002.

Bouvin, N.O.: Open Hypermedia in a Peer-to-Peer Context. In:Proceedings of the 13th ACM Conference on Hypertext andHypermedia. June 2002, Maryland, USA. ACM Press: pp.138-139, 2002.

Bouvin, N.O.; Zellweger, P.T.; Grønbæk, K.G.;Mackinlay, J.D.: Fluid annotations through open hypermedia:Using and extending emerging Web standards. In: Proceedingsof the 11th International World Wide Web Conference. WWW2002, May 7-11, Honolulu, USA: pp. 160-172, 2002.

Brabrand, C.; Schwartzbach, M.I.: Growing Languages withMetamorphic Syntax Macros. In: Proceedings of the 2002 ACMSIGPLAN Workshop on Partial Evaluation and Semantics-BasedProgram Manipulation. PEPM'02, Portland, OR, USA, January14-15, 2002. ACM: pp. 31-40, 2002.

Brodal, G.S.; Fagerberg, R.: Cache Oblivious DistributionSweeping. In: 29th International Colloquium on Automata,Languages, and Programming, ICALP '02. Widmayer, P.;Triguero, F.; Morales, R.; Hennessy, M.; Eidenbenz, S.; Conejo,R. (Eds.). Málaga, Spain, July 8-13, 2002. 2380 of LectureNotes in Computer Science. Springer-Verlag: pp. 426-438,2002.

Brodal, G.S.; Fagerberg, R.: Funnel Heap - A Cache ObliviousPriority Queue. In: 12th International Symposium onAlgorithms and Computation, ISAAC '02. Bose, P.; Morin, P.(Eds.). Vancouver, BC, Canada, November 21-23, 2002. 2518 ofLecture Notes in Computer Science. Springer-Verlag, Berlin: pp.219-228, 2002.

Brodal, G.S.; Fagerberg, R.; Jacob, R.: Cache-ObliviousSearch Trees via Binary Trees of Small Height. In: TheThirteenth Annual ACM-SIAM Symposium on DiscreteAlgorithms. Eppstein, D. (Ed.). SODA'02, San Francisco,California, USA, January 6-8, 2002. ACM Press: pp. 39-48,2002.

Brodal, G.S.; Jacob, R.: Dynamic Planar Convex Hull. In:43rd Annual Symposium on Foundations of Computer Science,FOCS '02. IEEE (Ed.). Vancouver, Canada, November 16-19,2002. IEEE Press, 1109 Spring Street, Suite 300, Silver Spring,MD 20910, USA: pp. 617-626, 2002.

Brodal, G.S.; Lagogiannis, G.; Makris, C.; Tsakalidis, A.;Tsichlas, K.: Optimal Finger Search Trees in the PointerMachine. In: The Thirty-Fourth Annual ACM Symposium onTheory of Computing, STOC '02. Reif, J.H. (Ed.).Montréal, Québec, Canada, May 19-21, 2002. ACM Press,New York: pp. 583-591, 2002.

Brodal, G.S.; Lyngsø, R.B.; Östlin, A.; Pedersen,C.N.S.: Solving the String Statistics Problem in Time O(n logn). In: 29th International Colloquium on Automata,Languages, and Programming, ICALP '02. Widmayer, P.;Triguero, F.; Morales, R.; Hennessy, M.; Eidenbenz, S.; Conejo,R. (Eds.). Málaga, Spain, July 8-13, 2002. 2380 of LectureNotes in Computer Science. Springer-Verlag: pp. 728-739,2002.

Bødker, S.; Iversen, O.S.: Staging a ProfessionalParticipatory Design Practice. Moving PD be­yond theInitial Fascination of User Involvement. In: Proceedings ofthe Second Nordic Conference on Human-ComputerInteraction. NordiCHI 2002, October 19-23, Aarhus,2002.

Büscher, M.; Hartswood, M.; Mogensen, P.; Procter, R.;Shapiro, D.; Slack, R.; Voss, A.: Promises, Premises and Risks:Sharing Responsibilities, Working Up Trust and SustainingCommitment in Participatory Design Projects. In:Proceedings of the Participatory Design Conference.PDC 2002, June 23-25, Malmø, Sverige, 2002.

Carbone, M.; Maffeis, S.: On the Expressive Power ofPolyadic Synchronisation in B- calculus. In: Expressivenessin Concurrency. 9th International Workshop, EXPRESS '02.Nestmann, U.; Panangaden, P. (Eds.). Brno University, CzechRepublic, August 20-23, 2002. 68(2) of Electronic Notes in TCS.Elsevier Science Publishers: pp. 18 pp, 2002.

Christensen H.B.; Caspersen M.E.: Frameworks in CS1. ADifferent Way of Introducing Event-driven Programming. In:Proceedings of Seventh Annual Conference on Innovation andTechnology in Computer Science Education. Finkel, D.(Ed.). ITiCSE 2002, June 24-26, Aarhus. Datalogisk Institut,Aarhus Universitet, 2002.

Christensen, H.B.: Using Logic Programming to DetectActivities in Pervasive Healthcare. In: Proceedings ofInternational Conference on Logic Programming. ICLP2002,July 29 - August 1, København, 2002.

Christensen, H.B.; Bardram, J.E: Supporting HumanActivities. Exploring Activity-Centered Computing. In:Proceedings of the Fourth International Conference onUbiquitous Computing. Borriello, G.; Holmquist, L.E.(Eds.). UBICOMP 2002, September 29-October 1, Gøteborg,Sverige. 2498 of Lecture Notes in Computer Science. SpringerVerlag, Berlin: pp. 107-116, 2002.

Cramer, R.; Fehr, S.: Optimal Black-Box Secret Sharing overArbitrary Abelian Groups. In: Advances in Cryptology. 22ndAnnual International Cryptology Conference, CRYPTO '02.Yung, M. (Ed.). Santa Barbara, California, USA, August 18-22,2002. 2442 of Lecture Notes in Computer Science.Springer-Verlag, Berlin: pp. 272-287, 2002.

Cramer, R.; Shoup, V.: Universal Hash Proofs and a Paradigmfor Adaptively Chosen- Ciphertext Secure Public-Key Encryption.In: Advances in Cryptology. International Conference on theTheory and Application of Cryptographic Techniques, EUROCRYPT'02. Knudsen, L.R. (Ed.). Amsterdam, Holland, April 28 -May 2, 2002. 2332 of Lecture Notes in Computer Science.Springer Verlag: pp. 45-64, 2002.

Crazzolara, F.; Milicia, G.: Developing security protocolsin P-Spaces. In: 7th Nordic Workshop on Secure ITSystems. Karlstad, Sweden: pp. 101-116, 2002.

Crazzolara, F.; Winskel, G.: Composing Strand Spaces. In:Foundations of Software Technology and Theoretical ComputerScience. 22nd Conference, FST&TCS '02. Agrawal, M.;Seth, A. (Eds.). Kanpur, India, December 12-14, 2002. 2556 ofLecture Notes in Computer Science. Springer-Verlag: pp. 97-108,2002.

Cáccamo, M.J.; Crazzolara, F.; Milicia, G.: The ISO5-pass authentication in P-Spaces. In: Security andManagement Conference. Mun, Y.; Arabnia, H.R. (Eds.).SAM'02. CSREA Press, Las Vegas, Nevada, USA: pp. 490-495,2002.

Damgård, I.B.; Fujisaki, E.: A Statistically-HidingInteger Commitment Scheme Based on Groups with Hidden Order.In: Advances in Cryptology. 8th ASIACRYPT Conference on theTheory and Applications of Cryptologic Techniques, ASIACRYPT'02. Zheng, Y. (Ed.). New Zealand, December 1-5, 2002.2501 of Lecture Notes in Computer Science. Springer-Verlag: pp.125-142, 2002.

Damgård, I.B.; Groth, J.; Salomonsen, G.: The Theoryand Implementation of Electronic Voting Systems. In: SecureElectronic Voting. Gritzalis, D. (Ed.). Kluwer AcademicPublishers, 2002.

Damgård, I.B.; Jurik, M.J.: Client/Server Tradeoffs forOn-line Elections. In: Fifth International Workshop onPractice and Theory in Public Key Cryptography, PKC '02.Naccache, D.; Paillier, P. (Eds.). Paris, France, February12-14, 2002. 2274 of Lecture Notes in Computer Science.Sprin­ger-Verlag: pp. 125-140, 2002.

Damgård, I.B.; Koprowski, M.: Generic Lower Bounds forRoot Extraction and Signature Schemes in General Groups. In:Advances in Cryptology. International Conference on theTheory and Application of Cryptographic Techniques, EUROCRYPT'02. Knudsen, L.R. (Ed.). Amsterdam, Holland, April 28 -May 2, 2002. 2332 of Lecture Notes in Computer Science.Springer-Verlag: pp. 256-271, 2002.

Damgård, I.B.; Nielsen, J.B.: Expanding PseudorandomFunctions. Or: From Known-Plaintext Security toChosen-Plaintext Security. In: Advances in Cryptology. 22ndAnnual International Cryptology Conference, CRYPTO '02.Yung, M. (Ed.). Santa Barbara, California, USA, August 18-22,2002. 2442 of Lecture Notes in Computer Science.Springer-Verlag, Berlin: pp. 449-464, 2002.

Damgård, I.B.; Nielsen, J.B.: Perfect Hiding andPerfect Binding Universally Composable Commitment Schemes withConstant Expansion Factor. In: Advances in Cryptology. 22ndAnnual International Cryptology Conference, CRYPTO '02.Yung, M. (Ed.). Santa Barbara, California, USA, August 18-22,2002. 2442 of Lecture Notes in Computer Science.Springer-Verlag, Berlin: pp. 581-596, 2002.

Damm, C.H.; Hansen, K.M.: Distributing Knight. UsingType-Based Publish/Subscribe for Building DistributedCollaboration Tools. In: Proceedings of Nordic Workshop onProgram Environment Research. NWPER'02, Copenhagen,Denmark, August 18-20, 2002: pp. 155-158, 2002.

Danvy, O.; Goldberg, M.: There and Back Again. In: 7thACM SIGPLAN International Conference on FunctionalProgramming. Peyton Jones, S. (Ed.). Pittsburgh,Pennsylvania, USA, October 4-6, 2002. ACM Press: pp. 230-234,2002.

Danvy, O.; Nielsen, L.R.: A First-Order One-Pass CPSTransformation. In: Foundations of Software Science andComputation Structures. Held as Part of the Joint EuropeanConferences on Theory and Practice of Software, ETAPS '02,FoSSaCS '02. Nielsen, M.; Engberg, U.H. (Eds.). Grenoble,France, April 10-12, 2002. 2303 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 98-113, 2002.

Danvy, O.; Schultz, U.P.: Lambda-Lifting in Quadratic Time.In: Sixth International Symposium on Functional and LogicProgramming, FLOPS '02. Hu, Z.; Rodríguez-Artalejo,M. (Eds.). Aizu, Japan, September 15-17, 2002. 2441 of LectureNotes in Computer Science. Springer-Verlag: pp. 134-151,2002.

David, A.; Möller, M.O.; Yi, W.: Formal Verification ofUML Statecharts with Real-Time Extensions. In: FundamentalApproaches to Software Engineering. Fifth InternationalConference; Held as Part of the Joint European Conferences onTheory and Practice of Software, ETAPS '02, FASE '02.Kutsche, R.; Weber, H. (Eds.). Grenoble, France, April 8-12,2002. 2306 of Lecture Notes in Computer Science.Springer-Verlag, Berlin: pp. 218-232, 2002.

Ernst.E.: Call by Declaration. In: Proceedings of theInheritance Workshop at ECOOP'02. ECOOP'02, Malaga, Spain,June 2002. University of Jyväskylä: pp. 44-50,2002.

Fehr, S.; Maurer, U.: Linear VSS and Distributed CommitmentsBased on Secret Sharing and Pairwise Checks. In: Advancesin Cryptology. 22nd Annual International Cryptology Conference,CRYPTO '02. Yung, M. (Ed.). Santa Barbara, California,USA, August 18-22, 2002. 2442 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 565-580, 2002.

Gallasch, G.E.; Kristensen, L.M.; Mailund, T.: Sweep-LineState Space Exploration for Coloured Petri Nets. In:Proceedings of Fourth Workshop on Practical Use of ColouredPetri Nets and the CPN Tools. Jensen, K. (Ed.). CPN'2002,August 28-30, Aarhus. DAIMI PB-560. Department of ComputerScience, University of Aarhus: pp. 101-119, 2002.

Grønbæk, K.; Vestergaard, P.P.; Ørbæk,P.: Towards Geo-spatial Hypermedia. Concepts and PrototypeImplementation. In: Proceedings of ACM Hypertext 2002.Hypertext 2002, June 11-15, 2002, University of Maryland, USA.ACM Press: pp. 117-126, 2002.

Hansen, K.M.; Damm, C.H.: Instant Collaboration. UsingContext-Aware Instant Messaging for Session Management inDistributed Collaboration Tools. In: Proceedings of 2ndNordic Conference on Human-Computer Interaction. NordiCHI2002, October 19-23, 2002, Aarhus: pp. 279-282, 2002.

Hansen, K.M.; Ratzer, A.V.: Tool Support for CollaborativeTeaching and Learning of Object-Oriented Modelling. In:Proceedings of the 7th Annual Conference on InformationTechnology in Computer Science Education. ITiCSE'2002,June 24-26, Aarhus. ACM: pp. 146-150, 2002.

Iversen, J.: Type Inference for the New Action Notation. In:Fourth International Workshop on Action Semantics.Mosses, P.D. (Ed.). AS 2002, Copenhagen, Denmark, July 21,2002. NS-02-8 of BRICS Notes Series. Aarhus: pp. 78-98,2002.

Jørgensen, J.B.: Coloured Petri Nets in UML-BasedSoftware Development. Designing Middleware for PervasiveHealthcare. In: Proc. of the 4th Workshop and Tutorial onPractical Use of Coloured Petri Nets and the CPN Tools.Jensen, K. (Ed.). CPN'2002, August 28-30, Aarhus. DAIMI PB-560.Department of Computer Science, University of Aarhus: pp.61-80, 2002.

Jørgensen, J.B.; Bossen, C.: Executable Use Cases forPervasive Healthcare. In: Proc. of the 2nd Workshop onModelling of Objects, Components, and Agents. Moldt, D.(Ed.). MOCA'2002, August 26-27, 2002, Aarhus: pp. 89-104,2002.

Jørgensen, J.B.; Christensen, S.: Executable DesignModels for a Pervasive Healthcare Middleware System. In:Proc. of the 5th International Conference on the UnifiedModeling Language. Jezequel, J.-M.; Hussmann, H.; Cook, S.(Eds.). UML'2002, September 30-October 4, 2002, Dresden,Germany. 2460 of Lecture Notes in Computer Science.Springer-Verlag: pp. 140-149, 2002.

Kohlenbach, U.: Foundation and Mathematical Uses of HigherTypes. In: Reflections on the Foundations of Mathematics.Essays in honor of Solomon Feferman. Sieg, W.; Sommer, R.;Talcott, C. (Eds.). 15 of Lecture Notes in Logic. A. K. Peters,Ltd: pp. 92-120, 2002.

Korovina, M.: Fixed Points on Abstract Structures withoutthe Equality Test. In: Preliminary Workshop on Fixed Pointsin Computer Science. Ésik, Z.;Ingólfsdóttir, A. (Eds.). FICS'02, Copenhagen,Denmark, July 20 and 21, 2002. NS-02-2 of BRICS Notes Series.Aarhus: pp. 58-61, 2002.

Korovina, M.: Fixed Points on the Real numbers without theEquality Test. In: Fifth Workshop on Computability andComplexity in Analysis, CCA '02 Selected Papers. Brattka,V.; Schröder, M.; Weihrauch, K. (Eds.). Málaga,Spain, July 12-13, 2002. Elsevier Science: pp. 9, 2002.

Krink, T.; Løvbjerg, M.: The LifeCycle model. CombiningParticle Swarm Optimisation, Genetic Algorithms andHillClimbers. In: 7th International Conference on ParallelProblem Solving from Nature, PPSN '2002. Guervós,J.J.M.; Adamidis, P.; Beyer, H.;Fernández-Villacañas, J.; Schwefel, H. (Eds.).Granada, Spain, September 7-11, 2002. 2439 of Lecture Notes inComputer Science. Springer-Verlag: pp. 621-630, 2002.

Krink, T.; Vesterstrøm, J.S.; Riget, J.: Particle SwarmOptimisation with Spatial Particle Extension. In: FourthCongress on Evolutionary Computation. Held in connection withWCCI-2002, CEC '02. Fogel, D.B.; Yao, X.; Greenwood, G.;Iba, H.; Marrow, P.; Shackleton, M. (Eds.). Honolulu, Hawaii,USA, May 12-17, 2002. IEEE Press: pp. 1474-1479, 2002.

Kristensen, J.F.: Design of Intelligent Work Environmentsand Cooperative Buildings. A need for Situated Interpretation.In: Proceedings of IRIS 25. Information SystemsResearch in Scandinavia, August 10-13, 2002, Bautahøj,2002.

Kristensen, L.M.; Mailund, T.: A Compositional Sweep-LineState Space Exploration Method. In: Proceedings of IFIP TCWG6.1 Joint International Conference on Formal Techniques forNetworked and Distributed Systems. FORTE'2002, November11-14, 2002, Houston, TX, USA. 2529 of Lecture Notes inComputer Science. Springer-Verlag: pp. 327-343, 2002.

Kristensen, L.M.; Mailund, T.: A Generalised Sweep-LineMethod for Safety Properties. In: Proceedings of FormalMethods Europe. FME 2002. 2391 of Lecture Notes inComputer Science. Springer-Verlag: pp. 549-567, 2002.

Lindstrøm, B.; Wells, L.: Towards a MonitoringFramework for Discrete-Event System Simulations. In:Proceedings of the 6th International Workshop on DiscreteEvent Systems. Silva, M.; Giva, A.; Colom, J.M. (Eds.).WODES'02, October, Zaragoza, Spain. IEEE Computer Society: pp.127-134, 2002.

Lindstrøm, B.; Wells, L.: Annotating Coloured PetriNets. In: Proceedings of the Fourth Workshop and Tutorialon Practical Use of Coloured Petri Nets and the CPN Tools.Jensen, K. (Ed.). CPN'2002, August 28-30, 2002, Aarhus. DAIMIPB-560. Department of Computer Science, University of Aarhus:pp. 39-58, 2002.

Løvbjerg, M.; Krink, T.: Extending Particle SwarmOptimisers with Self-Organized Criticality. In: FourthCongress on Evolutionary Computation. Held in connection withWCCI-2002, CEC '02. Fogel, D.B.; Yao, X.; Greenwood, G.;Iba, H.; Marrow, P.; Shackleton, M. (Eds.). Honolulu, Hawaii,USA, May 12-17, 2002. IEEE Press: pp. 1588-1593, 2002.

Mailund, T.: Analysing Infinite-State Systems by CombiningEquivalence Reduction and the Sweep-Line Method. In:Proceedings of International Conference on Application andTheory of Petri Nets. ICATPN'2002, August, Aarhus. 2360 ofLecture Notes in Computer Science. Springer-Verlag: pp.314-333, 2002.

Mayoh, B.H.: Evolution of Cooperation in Multiagent Systems.In: First EurAsian Conference on Information andCommunication Technology, ICT '02. Shafazand, H.; Tjoa,A.M. (Eds.). Shiraz, Iran, October 29-31, 2002. 2510 of LectureNotes in Computer Science. Springer-Verlag: pp. 701-710,2002.

Milicia, G.: P-Spaces. Programming Security Protocols. In:14th Nordic Workshop on Programming Theory, NWPT '11Abstracts. Vain, J.; Uustalu, T. (Eds.). Tallin, Estonia,November 20-22, 2002. 14 of Technical Report. Institute ofCybernetics, Technical University of Tallinn: pp. 75-78,2002.

Milicia, G.; Sassone, V.: Jeeg. A Programming Language forConcurrent Objects Synchronization. In: Joint ACM-ISCOPEConference on Java Grande, JGI '02. Fox, G.C.; Getov, V.(Eds.). Seattle, Washington, USA, November 3-5, 2002. ACM(Association for Computing Machinery): pp. 212-221, 2002.

Mosses, P.D.: Pragmatics of Modular SOS. In: AlgebraicMethodology and Software Technology. 9th InternationalConference, AMAST '02. Kirchner, H.; Ringeissen, C.(Eds.). St. Gilles les Bains, Reunion Island, France, September9-13, 2002. 2422 of Lecture Notes in Computer Science.Springer-Verlag, Berlin: pp. 21-40, 2002.

Möller, M.O.: Parking Can Get You There Faster. ModelAugmentation to Speed up Real-Time Model Checking. In:Workshop on Theory and Practice of Timed Systems. Held asPart of the Joint European Conferences on Theory and Practiceof Software, ETAPS '02, TPTS '02. Asarin, E.; Maler, O.;Yovine, S. (Eds.). Grenoble, France, April 6-7, 2002. 65(6) ofElectronic Notes in TCS. Elsevier Science Publishers: pp. 16,2002.

Möller, M.O.; Rueß,.H.; Sorea, M.: PredicateAbstraction for Dense Real-Time Systems. In: Workshop onTheory and Practice of Timed Systems. Held as Part of the JointEuropean Conferences on Theory and Practice of Software, ETAPS'02, TPTS '02. Asarin, E.; Maler, O.; Yovine, S. (Eds.).Grenoble, France, April 6-7, 2002. 65(6) of Electronic Notes inTCS. Elsevier Science Publishers: pp. 20, 2002.

Nielsen, J.B.: A Threshold Pseudorandom FunctionConstruction and Its Applications. In: Advances inCryptology. 22nd Annual International Cryptology Conference,CRYPTO '02. Yung, M. (Ed.). Santa Barbara, California,USA, August 18-22, 2002. 2442 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 417-432, 2002.

Nielsen, J.B.: Separating Random Oracle Proofs fromComplexity Theoretic Proofs. The Non-Committing EncryptionCase. In: Advances in Cryptology. 22nd Annual InternationalCryptology Conference, CRYPTO '02. Yung, M. (Ed.). SantaBarbara, California, USA, August 18-22, 2002. 2442 of LectureNotes in Computer Science. Springer-Verlag, Berlin: pp.111-126, 2002.

Nielsen, M.; Palamidessi, C.; Valencia, F.D.: A Calculus forTemporal Concurrent Constraint Programming. In:Expressiveness in Concurrency. 8th International Workshop,EXPRESS '02. Aceto, L.; Panangaden, P. (Eds.). Aalborg,Denmark, August 20, 2001. 52(1) of Electronic Notes in TCS.Elsevier Science Publishers, 2002.

Nielsen, M.; Palamidessi, C.; Valencia, F.D.: On theExpressive Power of Temporal Concurrent Constraint ProgrammingLanguages. In: 4th International Conference on Principlesand Practice of Declarative Programming. The conference isaffiliated the colloquium on Principles, Logics, andImplementations of high-level programming language.Pfenning, F. (Ed.). PLI '02, PPDP '02 Proceedings (Pittsburgh,Pennsylvania, USA, October 6-8, 2002). ACM Press: pp. 156-157,2002.

Nielsen, M.; Thiagarajan, P.S.: Regular Event Structures andFinite Petri Nets. The Conflict-Free Case. In:International Conference on Application and Theory of PetriNets, 2002. Esparza, J.; Lakos, C. (Eds.). 2360 of LectureNotes in Computer Science. Springer-Verlag, Berlin: pp.335-393, 2002.

Nielsen, M.; Valencia, F.D.: Temporal Concurrent ConstraintProgramming. Applications and Behavior. In: Formal andNatural Computing. Brauer, W.; Ehrig, H.; Karhumäki,J.; Salomaa, A. (Eds.). 2300 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 298-324, 2002.

Nygaard, M.; Winskel, G.: HOPLA. A Higher-Order ProcessLanguage. In: Proceedings of 13th International Conferenceon Concurrency Theory. Brim, L.; Jancar, P.;Kretínsky, M.; Kucera, A. (Eds.). CONCUR'02, Brno, CzechRepublic, August 20-23, 2002. 2421 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 434-448, 2002.

Nygaard, M.; Winskel, G.: Linearity in Process Languages.In: Seventeenth Annual IEEE Symposium on Logic in ComputerScience. The conference is part of the third Federated LogicConference. Plotkin, G. (Ed.). FLoC '02, LICS '02Proceedings (Copenhagen, Denmark, July 22-25, 2002). IEEEPress: pp. 433-446, 2002.

Oliva, P.B.: On Modified Bar recursion. In: ImplicitComputational Complexity. ICC '02, Copenhagen, Denmark,July 20-21, 2002: pp. 5, 2002.

Oliva, P.B.: On the Relation between Spector's Bar Recursionand Modified Bar Recursion. In: Bounded Arithmetic andComplexity Classes. BACC '02, Lisbon, Portugal, June28-29, 2002: pp. 3, 2002.

Pagh, R.; Pagter, J.: Optimal Time-Space Trade-Offs forNon-Comparison-Based Sorting. In: The Thirteenth AnnualACM-SIAM Symposium on Discrete Algorithms. Eppstein, D.(Ed.). SODA '02, San Francisco, California, USA, January 6-8,2002. ACM Press: pp. 9-18, 2002.

Pedersen, C.N.S.; Scharling, T.: Comparative Methods forGene Structure Prediction in Homologous Sequences. In:Algorithms in Bioinformatics. 2nd International Workshop,WABI '02. Guigó, R.; Gusfield, D. (Eds.). Rome,Italy, September 16-21, 2002. 2452 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 220-234, 2002.

Reynolds, J.C.: Separation Logic. A Logic for Shared MutableData Structures. In: Seventeenth Annual IEEE Symposium onLogic in Computer Science. The conference is part of the thirdFederated Logic Conference. Plotkin, G. (Ed.). FLoC '02,LICS '02 Proceedings (Copenhagen, Denmark, July 22-25, 2002).IEEE Press: pp. 55-74, 2002.

Rhiger, M.: Compiling Embedded Programs to Byte Code. In:4th International Symposium on Practical Aspects ofDeclarative Languages, PADL '01. Krishnamurthi, S.;Ramakrishnan, C.R. (Eds.). Portland, Oregon, USA, January19-20, 2002. 2057 of Lecture Notes in Computer Science.Springer-Verlag: pp. 120-136, 2002.

Santocanale, L.: A Calculus of Circular Proofs and itsCategorical Semantics. In: Foundations of Software Scienceand Computation Structures. Held as Part of the Joint EuropeanConferences on Theory and Practice of Software, ETAPS '02,FoSSaCS '02. Nielsen, M.; Engberg, U.H. (Eds.). Grenoble,France, April 10-12, 2002. 2303 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 129-143, 2002.

Srba, J.: Note on the Tableau Technique for CommutativeTransition Systems. In: Foundations of Software Science andComputation Structures. Held as Part of the Joint EuropeanConferences on Theory and Practice of Software, ETAPS '02,FoSSaCS '02. Nielsen, M.; Engberg, U.H. (Eds.). Grenoble,France, April 10-12, 2002. 2303 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 387-401, 2002.

Srba, J.: Strong Bisimilarity and Regularity of BasicParallel Processes is PSPACE-Hard. In: 19th AnnualSymposium on Theoretical Aspects of Computer Science, STACS'02. Alt, H.; Ferreira, A. (Eds.). Antibes - Juan lesPins, France, March 14-16, 2002. 2285 of Lecture Notes inComputer Science. Springer-Verlag, Berlin: pp. 535-546,2002.

Srba, J.: Strong Bisimilarity and Regularity of BasicProcess Algebra Is PSPACE-Hard. In: 29th InternationalColloquium on Automata, Languages, and Programming, ICALP'02. Widmayer, P.; Triguero, F.; Morales, R.; Hennessy,M.; Eidenbenz, S.; Conejo, R. (Eds.). Málaga, Spain, July8-13, 2002. 2380 of Lecture Notes in Computer Science.Springer-Verlag: pp. 716-727, 2002.

Srba, J.: Undecidability of Weak Bisimilarity for PushdownProcesses. In: Proceedings of 13th International Conferenceon Concurrency Theory. Brim, L.; Jancar, P.;Kretínsky, M.; Kucera, A. (Eds.). CONCUR'02, Brno, CzechRepublic, August 20-23, 2002. 2421 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 579-594, 2002.

Thomsen, R.: Evolving the Topology of Hidden Markov Modelsusing Evolutionary Algorithms. In: 7th InternationalConference on Parallel Problem Solving from Nature, PPSN'2002. Guervós, J.J.M.; Adamidis, P.; Beyer, H.;Fernández-Villacañas, J.; Schwefel, H. (Eds.).Granada, Spain, September 7-11, 2002. 2439 of Lecture Notes inComputer Science. Springer-Verlag: pp. 861-870, 2002.

Thomsen, R.; Fogel, G.B.; Krink, T.: A Clustal AlignmentImprover Using Evolutionary Algorithms. In: Fourth Congresson Evolutionary Computation. Held in connection with WCCI-2002,CEC '02. Fogel, D.B.; Yao, X.; Greenwood, G.; Iba, H.;Marrow, P.; Shackleton, M. (Eds.). Honolulu, Hawaii, USA, May12-17, 2002. IEEE Press: pp. 121-126, 2002.

Thomsen, R.; Krink, T.: Self-Adaptive Operator Schedulingusing the Religion-Based EA. In: 7th InternationalConference on Parallel Problem Solving from Nature, PPSN'2002. Guervós, J.J.M.; Adamidis, P.; Beyer, H.;Fernández-Villacañas, J.; Schwefel, H. (Eds.).Granada, Spain, September 7-11, 2002. 2439 of Lecture Notes inComputer Science. Springer-Verlag: pp. 214-223, 2002.

Torgersen, M.: Inheritance is Specialisation. In:Proceedings of the Inheritance Workshop at ECOOP 2002.ECOOP 2002, June 9, Malaga, Spain. University ofJyväskylä, Finland, 2002.

Ursem, R.K.: Diversity-Guided Evolutionary Algorithms. In:7th International Conference on Parallel Problem Solvingfrom Nature, PPSN '2002. Guervós, J.J.M.; Adamidis,P.; Beyer, H.; Fernández-Villacañas, J.; Schwefel, H.(Eds.). Granada, Spain, September 7-11, 2002. 2439 of LectureNotes in Computer Science. Springer-Verlag: pp. 462-471,2002.

Ursem, R.K.; Krink, T.: Genetic Programming with SmoothOperators for Arithmetic Expressions. Diviplication andSubdition. In: Fourth Congress on Evolutionary Computation.Held in connection with WCCI-2002, CEC '02. Fogel, D.B.;Yao, X.; Greenwood, G.; Iba, H.; Marrow, P.; Shackleton, M.(Eds.). Honolulu, Hawaii, USA, May 12-17, 2002. IEEE Press: pp.1372-1377, 2002.

Varacca, D.: The Powerdomain of Indexed Valuations. In:Seventeenth Annual IEEE Symposium on Logic in ComputerScience. The conference is part of the third Federated LogicConference. Plotkin, G. (Ed.). FLoC '02, LICS '02Proceedings (Copenhagen, Denmark, July 22-25, 2002). IEEEPress: pp. 299-308, 2002.

Vesterstrøm, J.S.; Riget, J.; Krink, T.: Division ofLabor in Particle Swarm Optimisation. In: Fourth Congresson Evolutionary Computation. Held in connection with WCCI-2002,CEC '02. Fogel, D.B.; Yao, X.; Greenwood, G.; Iba, H.;Marrow, P.; Shackleton, M. (Eds.). Honolulu, Hawaii, USA, May12-17, 2002. IEEE Press: pp. 1570-1575, 2002.

Wells, L.: Performance Analysis Using Coloured Petri Nets.In: Proceedings of the Tenth IEEE International Symposiumon Modeling, Analysis and Simulation of Computer andTelecommunication Systems. Boukerche, A.; Das, S.K.;Majumdar, S. (Eds.). MASCOTS'02, October, Fort Worth, TX, USA.IEEE Computer Society: pp. 217-221, 2002.

Winskel, G.: Calculus for Categories. In: Fixed Pointsin Computer Science. Ésik, Z.;Ingólfsdóttir, A. (Eds.). NS-02-2 of Notes Series.Aarhus: pp. 20-21, 2002.

Östlin, A.; Pagh, R.: One-Probe Search. In: 29thInternational Colloquium on Automata, Languages, andProgramming, ICALP '02. Widmayer, P.; Triguero, F.;Morales, R.; Hennessy, M.; Eidenbenz, S.; Conejo, R. (Eds.).Málaga, Spain, July 8-13, 2002. 2380 of Lecture Notes inComputer Science. Springer-Verlag: pp. 439-450, 2002.

Artikler i internationale tidsskrifter

Astesiano, E.; Bidoit, M.; Krieg-Brückner, B.; Mosses,P.D.; Sannella, D.; Tarlecki, A.: CASL. The Common AlgebraicSpecification Language. Theoretical Computer Science;286(2): 153-196, 2002.

Berg, A.R.; Jordán, T.: Minimally k-edge-connectedDirected Graphs of Maximal Size. Technical Report,Eötvös Loránd University, Budapest,Hungary; (TR-2002-10), 2002.

Brabrand, C.; Møller, A.; Olesen, S.; Schwartzbach,M.I.: Language-Based Caching of Dynamically Generated HTML.World Wide Web Journal, Kluwer Academic Publishers;5(4): 305-323, 2002.

Brabrand, C.; Møller, A.; Schwartzbach, M.I.: Thebigwig Project. Transactions on Internet Technology (TOIT),ACM; 2(2): 79-114, 2002.

Britz, D.; Østerby, O.; Strutwolf, J.; Koch Svennesen,T.: High-order spatial dicretisations in electrochemicaldigital simulation. Part 3. Combination with the explicitRunge-Kutta algorithm. Computers and Chemistry; 26:97-103, 2002.

Brodal, G.S.; Makris, C.; Sioutas, S.; Tsakalidis, A.;Tsichlas, K.: Optimal Solutions for the Temporal PrecedenceProblem. Algorithmica; 33(4): 494-510, 2002.

Buhrman, H.; Miltersen, P.B.; Radhakrishnan, J.; Venkatesh,S.: Are Bitvectors Optimal? SIAM Journal on Computing;31(6): 1723-1744, 2002.

Cryan, M.; Goldberg, L.A.; Goldberg, P.W.: EvolutionaryTrees can be Learned in Polynomial-Time in the Two- StateGeneral Markov Model. SIAM Journal on Computing;31(2): 375-397, 2002.

Damian, D.; Danvy, O.: A Simple CPS Transformation ofControl-Flow Information. Logic Journal of the IGPL;10(5): 501-515, 2002.

Dantchev, S.: Improved Sorting-Based Procedure for IntegerProgramming. Mathematical Programming; 92A(2):297-300, 2002.

Ernst, E.: Safe Dynamic Multiple Inheritance. NordicJournal of Computing; (9): 191-208, 2002.

Goldberg, M.; Torgersen, M.: How to Circumvent ChurchNumerals. Nordic Journal of Computing; (9): 1-12,2002.

Gutin, G.; Yeo, A.: Polynomial Approximation Algorithms forthe TSP and the QAP with a Factorial Domination Number.Discrete Applied Mathematics; 119(1-2): 107-116,2002.

Hansen, K.A.; Miltersen, P.B.; Vinay, V.: Circuits onCylinders. Technical Report, Electronic Colloquium onComputational Complexity (ECCC); (TR02-066): 11, 2002.

Henriksen, J.G.: An Expressive Extension of TLC.International Journal of Foundations of ComputerScience; 13(3): 341-360, 2002.

Hobolth, A.: A Deformable Template Model, with SpecialReference to Elliptical Templates. Journal of MathematicalImaging and Vision; 17: 131-137, 2002.

Hobolth, A.; Jensen, E.B.V.: A Note on Design-based versusModel-based Variance Estimation in Stereology. Advances inApplied Probability (Stochastic Geometry and StatisticalApplications); 34(3): 484-490, 2002.

Hobolth, A.; Kent, J.T.; Dryden, I.L.: On the Relationbetween Edge and Vertex Modelling in Shape Analysis.Scandinavian Journal of Statistics; 29: 355-374,2002.

Klarlund, N.; Møller, A.; Schwartzbach, M.I.: MONAImplementation Secrets. International Journal ofFoundations of Computer Science; 13(4): 571-586, 2002.

Klarlund, N.; Møller, A.; Schwartzbach, M.I.: The DSDSchema Language. Automated Software Engineering; 9(3):285-319, 2002.

Kohlenbach, U.: Applied Foundations. Proof Mining inAnalysis. Matilde (Newsletter of the Danish MathematicalSociety); 13: 7-9, 2002.

Kohlenbach, U.: On Uniform Weak König's Lemma.Annals of Pure and Applied Logic; 114: 103-116,2002.

Kohlenbach, U.: On Weak Markov's Principle. MathematicalLogic Quarterly; 48 (S1): 59-65, 2002.

Korovina, M.; Kudinov, O.: Algorithmic Aspect ofE-Definability over the Reals. Bulletin of SymbolicLogic; 8(1): 171, 2002.

Lyngsø, R.B.; Pedersen, C.N.S.: The Consensus StringProblem and the Complexity of Comparing Hidden Markov Models.Journal of Computer and System Sciences; 65: 545-569,2002.

Neumann, J.; Szepietowski, A.; Walukiewicz, I.: On theComplexity of Weak Conditions. Information ProcessingLetters; 84: 181-187, 2002.

Nielsen, M.; Palamidessi, C.; Valencia, F.D.: TemporalConcurrent Constraint Programming. Denotation, Logic andApplications. Nordic Journal of Computing; 9(2):145-188, 2002.

Oliva, P.B.: On the Computational Complexity ofL1-Approximation. Mathematical Logic Quarterly;48(S1): 66-77, 2002.

Petersen, M.G.; Madsen, K.H.; Kjær, A.: Usability ofEveryday Technology. Emerging and Fading Opportunities. ACMTransactions on Computer-Human Interaction; 9(2): 74-105,2002.

Rizzi, R.; Caprara, A.: Improved Approximation forBreakpoint Graph Decomposition and Sorting by Reversals.Journal of Combinatorial Optimization; 6: 157-182,2002.

Santocanale, L.: :-Bicomplete Categories and Parity Games.Theoretical Informatics and Applications; 36: 195-227,2002.

Santocanale, L.: Free :-Lattices. Journal of Pure andApplied Algebra; 168(2-3): 227-264, 2002.

Santocanale, L.: The Alternation Hierarchy for the Theory of:-lattices. Theory and Applications of Categories; 9:166-197, 2002.

Schultz, T.R.; Solomon, S.A.; Mueller, U.G.; Villesen, P.;Boomsma, J.J.; Adams, R.M.M.; Norden, B.B.: Cryptic Speciationin the Fungus-Growing Ants Cyphomyrmex longi­scapus Weberand Cyphomyrmex muelleri Schultz and Solomon, New Species(Formicidae, Attini). Insectes Sociaux; 49(4):331-343, 2002.

Srba, J.: Roadmap of Infinite Results. Bulletin of theEATCS; 78: 163-175, 2002.

Tewes, M.; Volkmann, L.; Yeo, A.: Almost all Almost Regularc-partite Tournaments with c $ 5 are Vertex Pancyclic.Discrete Mathematics; 242(1-3): 201-228, 2002.

Ursem, R.; Filipic, B.; Krink, T.: Exploring the Performanceof an Evolutionary Algorithm for Greenhouse Control.Journal of Computing and Information Technology; 1:195-200, 2002.

Ursem, R.K.; Filipic, B.; Krink, T.: Exploring thePerformance of an Evolutionary Algorithm for GreenhouseControl. Journal of Computing and InformationTechnology; 10(3): 195-201, 2002.

Ursem, R.K.; Krink, T.; Jensen, M.T.; Michalewicz, Z.:Analysis and Modeling of Control Tasks in Dynamic Systems.IEEE Transactions on Evolutionary; 6(4): 378-389,2002.

Villesen, P.; Gertsch, P.J.; Boomsma, J.J.: MicrosatellitePrimers for Fungus-Growing Ants. Molecular EcologyNotes; 2(3): 320-322, 2002.

Villesen, P.; Murakami, T.; Schultz, T.R.; Boomsma, J.J.:Identifying the Transition between Single and Multiple Matingof Queens in Fungus-Growing Ants. Proceedings of the RoyalSociety London, Biological Sciences; 269(1500): 1541-1548,2002.

Walukiewicz, I.: Monadic Second Order Logic on Tree-likeStructures. Theoretical Computer Science; 275(1-2):311-346, 2002.

Artikler i danske tidsskrifter

Berger, U.; Oliva, P.B.: Modified Bar Recursion. BRICSResearch Series, Aarhus; (RS-02-14): 23, 2002.

Brodal, G.S.; Fagerberg, R.; Östlin, A.; Pedersen,C.N.S.; Rao, S.S.: Computing Refined Buneman Trees in CubicTime. BRICS Research Series, Aarhus; (RS-02-51): 14,2002.

Byskov, J.M.: Chromatic Number in Time O(2.4023n) UsingMaximal Independent Sets. BRICS Research Series,Aarhus; (RS-02-45): 6, 2002.

Christensen, A.S.; Møller, A.: JWIG User Manual.BRICS Notes Series, Aarhus; (NS-02-6): 35, 2002.

Christensen, A.S.; Møller, A.; Schwartzbach, M.I.:Extending Java for High-Level Web Service Construction.BRICS Research Series, Aarhus; (RS-02-11): 54,2002.

Christensen, A.S.; Møller, A.; Schwartzbach, M.I.:Static Analysis for Dynamic XML. BRICS Research Series,Aarhus; (RS-02-24): 13, 2002.

Damian, D.; Danvy, O.: CPS Transformation of FlowInformation, Part II. Administrative Reductions. BRICSResearch Series, Aarhus; (RS-02-36): 9, 2002.

Danvy, O.: A New One-Pass Transformation into Monadic NormalForm. BRICS Research Series, Aarhus; (RS-02-52): 16,2002.

Danvy, O.; Nielsen, L.R.: On One-Pass CPS Transformations.BRICS Research Series, Aarhus; (RS-02-3): 18,2002.

Danvy, O.; Nielsen, L.R.: Syntactic Theories in Practice.BRICS Research Series, Aarhus; (RS-02-4): 34,2002.

Ernst, E.: Method Mixins. DAIMI PB, Datalogisk Institut,Aarhus Universitet; (557): 22, 2002.

Hein, J.; Jensen, J.L.; Pedersen, C.N.S.: Recursions forStatistical Multiple Alignment. Research Reports,Department of Theoretical Statistics, University ofAarhus; (425), 2002.

Kohlenbach, U.: Uniform Asymptotic Regularity for MannIterates. BRICS Research Series, Aarhus; (RS-02-10):17, 2002.

Kohlenbach, U.; Leustean, L.: Mann Iterates of DirectionallyNonexpansive Mappings in Hyperbolic Spaces. BRICS ResearchSeries, Aarhus; (RS-02-28): 33, 2002.

Kohlenbach, U.; Oliva, P.B.: Proof Mining. A Systematic Wayof Analysing Proofs in Mathematics. BRICS Research Series,Aarhus; (RS-02-31): 47, 2002.

Madsen, B.A.; Nielsen, J.M.; Skjernaa, B.: On the Number ofMaximal Bipartite Subgraphs of a Graph. BRICS ResearchSeries, Aarhus; (RS-02-17): 7, 2002.

Møller, A.: Document Structure Description 2.0.BRICS Notes Series, Aarhus; (NS-02-7): 29, 2002.

Møller, A.; Schwartzbach, M.I.: Interactive WebServices with Java. JSP, Servlets, and JWIG. BRICS NotesSeries, Aarhus; (NS-02-1): 99, 2002.

Nielsen, J.M.: On the Number of Maximal Independent Sets ina Graph. BRICS Research Series, Aarhus; (RS-02-15):10, 2002.

Nielsen, L.R.: A Simple Correctness Proof of theDirect-Style Transformation. BRICS Research Series,Aarhus; (RS-02-2): 11, 2002.

Nola, A.D.; Leustean, L.: Compact Representations ofBL-Algebras. BRICS Research Series, Aarhus;(RS-02-23): 25, 2002.

Rhiger, M.: A Foundation for Embedded Languages. BRICSResearch Series, Aarhus; (RS-02-34): 29, 2002.

Santocanale, L.: On the Equational Definition of the LeastPrefixed Point. Preprint; (PIMS-02-1), 2002.

Schultz, U.P.: Towards unifying inheritance and automaticprogram specialization. DAIMI PB, Datalogisk Institut,Aarhus Universitet; (566): 31, 2002.

Srba, J.: Strong Bisimilarity of Simple Process Algebras.Complexity Lower Bounds. BRICS Research Series,Aarhus; (RS-02-16): 33, 2002.

Ursem, R.K.; Krink, T.; Filipic, B.: A Numerical Simulatorfor a Crop-Producing Greenhouse. EVALife Technical Report,University of Aarhus; (2002-01), 2002.

Vesterstrøm, J.S.; Riget, J.: A Diversity-GuidedParticle Swarm Optimizer - the ARPSO. EVALife TechnicalReport, University of Aarhus; (2002-02), 2002.

Östlin, A.; Pagh, R.: Simulating Uniform Hashing inConstant Time and Optimal Space. BRICS Research Series,Aarhus; (RS-02-27): 11, 2002.

Østerby, O.: Five ways of Reducing the Crank-NicolsonOscillations. DAIMI PB, Datalogisk Institut, AarhusUniversitet; (558): 15, 2002.

Letters, kommentarer, videnskabeligdebat

Bidrag i antologier

Bouvin, N.O.: Peer-to-Peer Hypertext Panel. In:Proceedings of the 13th ACM Conference on Hypertext andHypermedia. 13th ACM Conference on Hypertext andHypermedia, June 11-15, 2002, Univ. of Maryland, USA. ACM: pp.69, 2002.

Grønbæk, K.: Seven Issues Revisited. In:Proceedings of the 13th ACM Conference on Hypertext andHypermedia. Hypertext 2002, June 11-15, Univ. of Maryland,USA. ACM: pp. 171, 2002.

Artikler i internationale tidsskrifter

Kohlenbach, U.: Review of "Diller, Justus Logical Problemsof Functional Interpretations". Commemorative SymposiumDedicated to Anne S. Troelstra, Noordwijkerhout, TheNetherlands, 1999. Ann. Pure Appl. Logic; 114: 27-42,2002.

Kohlenbach, U.: Review of: Jäger, G.; Kahle, R.;Studer, T.: Universes in explicit mathematics. Ann. PureAppl. Logic; 109(3): 141-162, 2002.

Artikler i danske tidsskrifter

Pedersen, C.N.S.: Bioinformatik ved Aarhus Universitet.Biozoom; (3): 12-18, 2002.

Konferencebidrag, arbejdspapirer

Bidrag i antologier

Bardram, J.E.; Bossen, C.; Lykke-Olesen, A.; Madsen, K.H.;Nielsen, R.: Virtual Video Prototyping of Pervasive HealthcareSystems. In: Proceedings of DIS 2002. MacDonald, N.(Ed.). Designing Interactive Systems, June 25-28, London. ACMPress, London: pp. 167-177, 2002.

Bertelsen, O.W.; Bødker, S.: Interaction throughmulti-artifacts. Abstract for ECCE 11. In: Proceedings ofECCE 11. Eleventh European Conference on CognitiveErgonomics, 2002.

Kristensen, J.F.: Designing Pervasive Computing Technology -In a Nomadic Work Perspective. In: Adjunct ProceedingsUbiComp 2002. Fourth International Conference onUbiquitous Computing, September 29 - October 1, 2002,Göteborg, Sweden, 2002.

Kristensen, J.F.; Nielsen, C.: Interaction as Negotiation.In: Proceedings of the Second Danish HCI ResearchSymposium. The August Krogh Institute, University ofCopenhagen, 2002.

Mosses, P.D.: A Modular SOS for Action Notation - Revisited.In: Proceedings of the 4th International Workshop on ActionSemantics. BRICS NS-02-8. BRICS, University of Aarhus: pp.75-76, 2002.

Mosses, P.D.: Action Semantics and ASF+SDF. Systemdemonstration. In: Proc. 2nd Workshop on LanguageDescriptions, Tools and Applications. LDTA'02, part ofETAPS'02, April 13, Grenoble, France: pp. 7, 2002.

Artikler i internationale tidsskrifter

Kohlenbach, U.; Oliva, P.: Effective bounds on strongunicity in L1-approximation. Bull. Symb. Logic; (8):143, 2002.

Sassone, V.; Sobocinski, P.: Deriving BisimulationCongruences: a 2-categorical approach. Electronic Notes inComputer Science; 68(2)(2), 2002.

Anden forskningsformidling

Monografier

Bødker, S.; Christiansen, E.: Lost and Found inFlexibility. CD-ROM. IRIS 2002, 2002.

Ludvigsen, M.: Playful Interaction. Video. 2002Jamboree/review at the International Conference on UbiquitousComputing, Sept. 29-Oct. 1, Göteborg, Sweden, 2002.

Redaktionsarbejde

Black, A.; Ernst, E.; Grogono, P.; Sakkinen, M.:Proceedings of the Inheritance Workshop at ECOOP 2002.June 9, Malaga, Spain. Report no. 12 of Information TechnologyResearch Institute, University of Jyväskylä, Finland,2002.

Bødker, S.; Bertelsen, O.: Proceedings of theSecond Nordic Conference on Human-Computer Interaction.NordiCHI 2002, October 19-23, Aarhus. ACM, 2002.

Danvy, O.; Sabry, A.: Special issue of Higher-Order andSymbolic Computation. Vol. 15, nos. 2/3, 2002.

Fleischer, R.; Moret, B.; Schmidt, E.M., Selected andrefereed papers from First Schloss Dagstuhl seminar onExperimental Algorithmics, September 2000: ExperimentalAlgorithmics. From Algorithm Design to Robust and EfficientSoftware. 2547 of Lecture Notes in Computer Science.Springer, 2002.

Jensen, K.: 4th Workshop and Tutorial on Practical Useof Coloured Petri Nets and the CPN Tools. DAIMI PB-560.Department of Computer Science, University of Aarhus, 2002.

Jordán, T.; Panconesi, A.: Random Struct.Algorithms 20. Special issue: Probabilistic methods incombinatorial optimization. BRICS Workshop onProbabilistic methods in combinatorial optimization, August2000, Aarhus. 3, 2002.

Mosses, P.D.: Proceedings of the 4th InternationalWorkshop on Action Semantics. BRICS NS-02-8. BRICS,University of Aarhus, 2002.

Nielsen, M.; Engberg, U.H.: Foundations of SoftwareScience and Computation Structures. Held as Part of the JointEuropean Conferences on Theory and Practice of Software, ETAPS'02, FoSSaCS '02. Grenoble, France, April 10-12, 2002.2303 of Lecture Notes in Computer Science. Springer-Verlag,Berlin, 2002.

Penttonen, M.; Schmidt, E.M.: Algorithm Theory. 8thScandinavian Workshop, SWAT '02. Turku, Finland, 2002,July 3-5. 2368 of Lecture Notes in Computer Science.Springer-Verlag, 2002.

Ursem, R.K.: Topics of Evolutionary Computation2002. DAIMI IR-133. Datalogisk Institut, AarhusUniversitet, 2002.

• Alstrup, S.; Brodal, G.S.; Rauhe, T.: New Data Structures for Orthogonal Range Searching. Proc. 41st Annual Symposium on Foundations of Computer Science. IEEE Computer Soc: 198-207, 2000.
• Alstrup, S.; Brodal, G.S.; Rauhe, T.: Optimal Static Range Reporting in One Dimension. ITU-TR-2000-3. The IT University of Copenhagen, 2000.
• Alstrup, S.; Brodal, G.S.; Rauhe, T.: Pattern Matching in Dynamic Texts. The Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'00 (San Francisco, California, USA, January 9-11, 2000). ACM Press: 819-828, 2000.
• Alvarez, G.; Diaz, J.F.; Quesada, L.; Rueda, C.; Tamura, G.; Valencia, F.; Assayag, G.: Integrating Constraints and Concurrent Objects in Musical Applications. A Calculus and its Visual Language. Constraints; 2000.
• Amadio, R.M.; Prasad, S.: Modelling IP Mobility. Journal of Formal Methods; 2000.
• Andersen, C.J.; Hansen, K.M.; Sandvad, E.S.; Thomsen, M.; Tyrsted, M.: Tool Support for Iterative System Development Activities: Issues and Experiences. http: //www.ifi.uib.no/konf/nwper2000/proceedings2000.html. The Ninth Nordic Workshop on Programming and Software Development Environment Research, Lillehammer/Norway, May 28-30. 2000.
• Arge, L.; Brodal, G.S.; Toma, L.: On External Memory MST, SSP and Multi-Way Planar Graph Separation. 7th Scandinavian Workshop on Algorithm Theory, SWAT '98 (Bergen, Norway, July 5-7, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1851: 433-447, 2000.
• Arge, L.; Pagter, J.: I/O-Space Trade-Offs. The Seventh Scandinavian Workshop on Algorithm Theory, Bergen Norway, July 5-7 2000. Lecture Notes in Computer Science; Springer-Verlag, Bergen, 1851: 448-461, 2000.
• Bang-Jensen, J.; Guo, Y.; Yeo, A.: Complementary cycles containing prescribed vertices in tournaments. Discrete Mathematics; 214(1-3): 77-87, 2000.
• Bang-Jensen, J.; Huang, J.; Yeo, A.: Convex-round and concave-round graphs. SIAM journal of Discrete Mathematics; 13(2): 170-193, 2000.
• Beaudouin-Lafon, M.: "Ceci n'est pas un ordinateur - Perspectives sur l'Interaction Homme-Machine". Technique et Science Informatique; Hermès, France: 69-74, 2000.
• Beaudouin-Lafon, M.: Instrumental Interaction: an Interaction Model for Designing Post-WIMP Interfaces. In Proceedings of ACM Human Factors in Computing Systems (CHI'2000). Hague, The Netherlands, April 2000. CHI Letters; ACM Press, 2(1): 446-453, 2000.
• Beaudouin-Lafon, M.; Lassen, H.M.: The Architecture and Implementation of CPN2000, a Post-WIMP Graphical Application. In Proceedings of ACM Symposium on User Interface Software and Technology (UIST 2000), San Diego (USA), November 2000. CHI Letters; ACM Press, 2(2): 181-190, 2000.
• Beaudouin-Lafon, M.; Mackay, W.E.: Reification, Polymorphism and Reuse: Three Principles for Designing Visual Interfaces. In Proceedings of AVI 2000, Advanced Visual Interfaces. Palermo, Italy: 102-109, 2000.
• Beaudouin-Lafon, M.; Mackay, W.E.: Research Directions in Situated Computing. CHI'2000,The Hague (Netherlands), April 2000. ACM Conference on Human Factors in Computing Systems; 369, 2000.
• Beaudouin-Lafon, M.; Mackay, W.E.; Andersen, P.; Janecek, P.; Jensen, M.; Lassen, M.; Lund, K.; Mortensen, K.; Munck, S.; Ratzer, A.; Ravn, K.; Christensen, S.; Jensen, K.: CPN/Tools: A Post-WIMP Interface for Editing and Simulating Coloured Petri Nets. www.daimi.au.dk/CPnets/CPN2000/publ.html. 21st International Conference on Application and Theory of Petri Nets, Denmark, 2000. In K.H. Mortensen (ed.): Tool Demonstrations Collection; Aarhus: 19-28, 2000.
• Behrmann, G.; Hune, T.S.; Vaandrager, F.: Distributing Timed Model Checking. How the Search Order Matters. Computer-Aided Verification: 11th International Conference, CAV'00 (Chicago, USA, July 15-19, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1855: 216-231, 2000.
• Bert, D.; Choppy, C.; Mosses, P.D.: Recent Trends in Algebraic Development Techniques, Proceedings. 14th International Workshop, WADT '99 Proceedings, (Bonas, France, September 15-18, 1999). Springer-Verlag, 2000.
• Bertelsen, O.; Bødker, S.: Introduction to special issue on Activity Theory and Information System Design. Scandinavian Journal of Information Systems; Ålborg, 12: 3-14, 2000.
• Bertelsen, O.W.: Design artefacts: Towards a design-oriented epistemology. Scandinavian Journal of Information Systems; Ålborg, 12, 2000.
• Bertelsen, O.W.; Nielsen, C.: Augmented reality as a design tool for mobile interfaces. ACM DIS '00 Conference, Aug. 17-19, Brooklyn, New York. 2000.
• Bouvin, N.O.: Designing User Interfaces for Collaborative Web-based Open Hypermedia. 11th ACM Hypertext Conference. San Antonio, USA: 230-231, 2000.
• Bouvin, N.O.: Experiences with OHP and Issues for the future. In: Proceedings of the Open Hypermedia Systems Workshop 6.0 Hypertext 2000. Springer-Verlag: 13-22, 2000.
• Brabrand, C.: <bigwig> Version 1.3. Reference Manual. NS-00-4. BRICS, Basic Research in Computer Science, Aarhus: ii+56 pages, 2000.
• Brabrand, C.: <bigwig> Version 1.3. Tutorial. NS-00-5. BRICS, Basic Research in Computer Science, Aarhus: ii+92 pages, 2000.
• Brabrand, C.; Møller, A.; Ricky, M.; Schwartzbach, M.I.: PowerForms. Declarative Client-Side Form Field Validation. World Wide Web Journal; 3(4), 2000.
• Brabrand, C.; Møller, A.; Schwartzbach, M.I.: The <bigwig> Project. RS-00-42. BRICS, Basic Research in Computer Science, Aarhus: 25 pages, 2000.
• Brabrand, C.; Schwartzbach, M.I.: Growing Languages with Metamorphic Syntax Macros. RS-00-24. BRICS, Basic Research in Computer Science, Aarhus: 22 pages, 2000.
• Brodal, G.S.; Jacob, R.: Dynamic Planar Convex Hull with Optimal Query Time and O(log n log log n) Update Time. 7th Scandinavian Workshop on Algorithm Theory, SWAT '98 (Bergen, Norway, July 5-7, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1851: 57-70, 2000.
• Brodal, G.S.; Lyngsø, R.B.; Pedersen, C.N.S.; Stoye, J.: Finding Maximal Pairs with Bounded Gap. Journal of Discrete Algorithms, Special Issue of Matching Patterns; Hermes Science Publishing Ltd, 1(1), 2000.
• Brodal, G.S.; Pedersen, C.N.S.: Finding Maximal Quasiperiodicities in Strings. Combinatorial Pattern Matching: 11th Annual Symposium, CPM'00 (Montréal, Canada, June 21-23, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1848: 397-411, 2000.
• Brodal, G.S.; Srinivasan, V.: Improved Bounds for Dictionary Look-up with One Error. Information Processing Letters; 75(1-2): 57-59, 2000.
• Buhrman, H.; Laplante, S.; Miltersen, P.B.: Improved bounds for the language compression problem. 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000. IEEE: 126-137, 2000.
• Buhrman, H.; Miltersen, P.B.; Radhakrishnan, J.; Venkatesh, S.: Are bitvectors optimal? 32nd Annual ACM Symp. on Theory of Compuatation (STOC'00). ACM: 449-458, 2000.
• Butz, C.; Kohlenbach, U.; Riis, S.; Winskel, G.: Proof Theory and Complexity, PTAC '98. Elsevier: 343 pp pages, 2000.
• Buur, J.; Bødker, S.: From usability lab to "design collaboratorium": Reframing usability practice. DIS 2000, Conference proceedings on Designing interactive systems: processes, practices, methods, and techniques, ACM. 297-307, 2000.
• Büscher, M.; Christensen, M.; Grønbæk, K; Krogh, P.; Mogensen, P.; Shapiro, D.; Ørbæk, P.: Collaborative Augmented Reality Environments: Integrating VR, Working Materials, and Distributed Work Spaces. Collaborative Virtual Environments 2000, (CVE 2000), San Francisco, USA, September 2000. ACM, San Francisco: 47-56, 2000.
• Büscher, M.; Christensen, M.; Mogensen, P.; Shapiro, D.; Ørbæk, P.: Creativity, Complexity and Precision: Information Visualization for Landscape Architecture. International Symposium on Information Visualization 2000, (InfoVis 2000), Salt Lake City, October 2000. Information Visualization 2000; IEEE, Salt Lake City: 167-172, 2000.
• Bødker, S.: Mediating Technical platforms to support the development of shared work practices. CACM November 2000; 43: 11es, 2000.
• Bødker, S.: Scenarios - setting the stage for reflection and action in user-centered design. Interacting with computers; 13(1): 61-77, 2000.
• Bødker, S.; Ehn, P.; Sjögren, D.; Sundblad, Y.: Cooperative design perspectives on 20 years with "the Scandinavian IT Design Model". NordiCHI 2000. Design vs. design (CD-ROM). Invited keynote; 2000.
• Bødker, S.; Grønbæk, K.; Mogensen, P.: Cooperative Design. Encyclopedia of Library and Information Science; New York: 108-119, 2000.
• Bødker, S.; Petersen, M.G.: Design for learning in use. Scandinavian Journal of Information Systems; Ålborg, 12: 61-80, 2000.
• Bødker, S.; Petersen, M.G.; Nielsen, C.: Creativity, cooperation and interactive design. DIS 2000, Conference proceedings on Designing interactive systems: processes, practices, methods, and techniques. ACM: 252-261, 2000.
• Camenisch, J.; Damgård, I.B.: Verifiable Encryption, Group Encryption and Their Applications to Separable Group Signatures and Signature Sharing Schemes. Lecture Notes in Computer Science; Springer-Verlag, 1976: 331-345, 2000.
• Canamero, D.: Designing Emotions for Activity Selection. PB-545. Department of Computer Science, University of Aarhus: 20 pp pages, 2000.
• Canamero, D.; Fredslund, J.: Feelix - Emotional Interaction With A Humanoid LEGO Robot. AAAI Fall Symposium, 3 - 5. november 2000. North Falmouth, MA, USA: 6, 2000.
• Canamero, D.; Fredslund, J.: I Show You How I Like You: Human-Robot Interaction through Emotional Expression and Tactile Stimulation. PB-544. Department of Computer Science, University of Aarhus: 15 pp pages, 2000.
• Capkovic, F.S.: Modelling and Control of Discrete Event Dynamic Systems. RS-00-26. BRICS, Basic Research in Computer Science, Aarhus: 58 pages, 2000.
• Caprani, O.; Hvidegaard, L.; Mortensen, Schneider, T.: Robust and efficient ray intersection of implicit surfaces. Reliable Computing; 6: 1-13, 2000.
• Caspersen, M.E.; Christensen, H.B.: Here, There and Everywhere - On the Recurring Use of Turtle Graphics in CS1. Fourth Australasian Computing Education Conference, ACE 2000, 4-6 December 2000, Melbourne, Australia. 2000.
• Christensen, H.B.: Modularisation of Software Configuration Management. Modular Programming Languages, Joint Modular Languages Conference, JMLC 2000. Lecture Notes in Computer Science; Springer Verlag, Zürich, Switzerland, 1897: 134-146, 2000.
• Christensen, H.B.; Røn, H.: A Case Study of Framework Design for Horizontal Reuse. 37th International Conference on Technology of Object-Oriented Languages and Systems, TOOLS-Pacific 2000. IEEE Computer Society Press, Sydney: 278-289, 2000.
• Christensen, S.; Kristensen, L.M.: State Space Analysis of Hierarchical Coloured Petri Nets in Petri Net Approaches for Modelling and Validation. LINCOM Studies in Computer Science; 1, 1999, 2000.
• Christensen, S.; Kristensen, L.M.; Mortensen, K.H.: Design/CPN - A Computer Tool for Coloured Petri Nets. 21st International Conference on Application and Theory of Petri Nets, Denmark, 2000. In K.H. Mortensen (ed.): Tool Demonstrations Collection; Aarhus: 29-38, 2000.
• Cramer, R.; Damgaard, I.; Dziembowski, S.: On the Complexity of Verifiable Secret Sharing and Multi-Party Computation. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC '00), Portland, Oregon, USA, May 2000. ACM Press, 2000.
• Cramer, R.; Damgaard, I.; Maurer, U.: General Secure Multi-Party Computation from any Linear Secret Sharing Scheme. Proceedings of EUROCRYPT '00, Brugge, Belgium, May 2000. Lecture Notes in Computer Science; Springer Verlag, 1807: 316-334, 2000.
• Cramer, R.; Damgård, I.B.; Dziembowski, S.: On the Complexity of Verifiable Secret Sharing and Multi-Perty Computation. The Thirty-Second Annual ACM Symposium on Theory of Computing, STOC'00 (Portland, Oregon, USA, May 21-23, 2000). ACM Press, New York: 325-334, 2000.
• Cramer, R.; Damgård, I.B.; MacKenzie, P.: Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. Third International Workshop on Practice and Theory in Public Key Cryptography, PKC '00 (Melbourne, Victoria, Australia, January 18-20, 2000). Lecture Notes in Computer Science; Springer-Verlag, 1751: 354-372, 2000.
• Cramer, R.; Damgård, I.B.; Nielsen, J.B.: Multiparty Computation from Threshold Homomorphic Encryption. RS-00-14. BRICS, Basic Research in Computer Science, Aarhus: ii+38 pages, 2000.
• Crazzolara, F.; Winskel, G.: Language, Semantics, and Methods for Cryptographic Protocols. RS-00-18. BRICS, Basic Research in Computer Science, Aarhus: ii+42 pages, 2000.
• Crépeau, C.; Légaré, F.; Salvail, L.: How to Convert a Flavor of Quantum Bit Commitment. RS-00-52. BRICS, Basic Research in Computer Science, Aarhus: 24 pages, 2000.
• Cryan, M.: Learning and Approximation Algorithms for Problems Motivated by Evolutionary Trees. Dept of Computer Science, University of Warwick, 2000.
• Curien, P.; Plotkin, G.; Winskel, G.: Bistructures, Bidomains and Linear Logic. In: Proof, Language, and Interaction; Essays in Honour of Robin Milner. Plotkin, G.; Stirling, C.; Tofte, M. (Eds.). Foundations of Computing. MIT Press: 21-54, 2000.
• Damgård, I.B.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Advances in Cryptology: International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT '00 (Brugge, Belgium, May 14-18, 2000). Lecture Notes in Computer Science; Springer-Verlag, 1807: 418-430, 2000.
• Damgård, I.B.; Jurik, M.J.: A Generalisation, a Simplification and some Applications of Paillier's Probabilistic Public-Key System. RS-00-45. BRICS, Basic Research in Computer Science, Aarhus: 18 pages, 2000.
• Damgård, I.B.; Jurik, M.J.: Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes. RS-00-5. BRICS, Basic Research in Computer Science, Aarhus: 19 pages, 2000.
• Damgård, I.B.; Koprowski, M.: Practical Threshold RSA Signatures Without a Trusted Dealer. RS-00-30. BRICS, Basic Research in Computer Science, Aarhus: 14 pages, 2000.
• Damgård, I.B.; Nielsen, J.B.: Improved Non-Committing Encryption Schemes based on a General Complexity Assumption. RS-00-6. BRICS, Basic Research in Computer Science, Aarhus: 24 pages, 2000.
• Damian, D.; Danvy, O.: Syntactic Accidents in Program Analysis. Fifth ACM SIGPLAN International Conference on Functional Programming (Montréal,Canada, USA, September 27-28, 2000). ACM Prss: 209-220, 2000.
• Damm, C.H.; Hansen, K.M.; Thomsen, M.: Tool Support for Cooperative Object-Oriented Design: Gesture Based Modeling on an Electronic Whiteboard. CHI2000, The Hague, The Netherlands, April, 2000. ACM, 2000.
• Damm, C.H.; Hansen, K.M.; Thomsen, M.; Tyrsted, M.: CASE Tool Integration: Experiences and Issues in Using XMI and Component Technology. TOOLS Europe 2000, Mont St Michel & St. Malo, France, June 5-8. IEEE Computer Society Press, 2000.
• Damm, C.H.; Hansen, K.M.; Thomsen, M.; Tyrsted, M.: Creative Object-Oriented Modelling: Support for Creativity, Flexibility, and Collaboration in CASE Tools. ECOOP'2000, Sophia Antipolis and Cannes, France, June 12-16. Lecture Notes in Computer Science; Springer-Verlag, 1850: 27-43, 2000.
• Damm, C.H.; Hansen, K.M.; Thomsen, M.; Tyrsted, M.: Supporting Several Levels of Restriction in the UML. Proceedings of UML'2000. York, United Kingdom, October 2-6, 2000. 2000.
• Dantchev, S.; Riis, S.: A Tough Nut for Tree Resolution. RS-00-10. BRICS, Basic Research in Computer Science, Aarhus: 13 pages, 2000.
• Danvy, O.: Formalizing Implementation Strategies for First-Class Continuations. Programming Languages and Systems: Ninth European Symposium on Programming; Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS '00, ESOP '00 (Berlin, Germany, March 27-31, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1782: 88-103, 2000.
• Danvy, O.: Programming Techniques for Partial Evaluation. Foundations of Secure Computation. IOS Press Ohmsha, Marktoberdorf, NATO Science series: 287-318, 2000.
• Danvy, O.; Hatcliff, J.: Partial Evaluation. In: Encyclopedia of Computer Science (Fourth Edition). Ralston, A.; Reilly, E.; Hemmendinger, D. (Eds.). Macmillan Reference/Grove Dictionaries: 1370-1371, 2000.
• Danvy, O.; Nielsen, L.R.: A Higher-Order Colon Translation. RS-00-33. BRICS, Basic Research in Computer Science, Aarhus: 17 pages, 2000.
• Danvy, O.; Nielsen, L.R.: CPS Transformation of Beta-Redexes. RS-00-35. BRICS, Basic Research in Computer Science, Aarhus: 12 pages, 2000.
• Danvy, O.; Rhiger, M.: A Simple Take on Typed Abstract Syntax in Haskell-like Languages. RS-00-34. BRICS, Basic Research in Computer Science, Aarhus: 25 pages, 2000.
• Danvy, O.; Schultz, U.P.: Lambda-Dropping. Transforming Recursive Equations into Programs with Block Structure. Theoretical Computer Science; 248(1-2): 243-287, 2000.
• de O. Braga, C.; Haeusler, E.H.; Meseguer, J.; Mosses, P.D.: Maude Action Tool. Using Reflection to Map Action Semantics to Rewriting Logic. Algebraic Methodology and Software Technology: 8th International Conference, AMAST '00 (Iowa City, Iowa, USA, May 20-27, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1816: 407-421, 2000.
• Dumais, P.; Mayers, D.; Salvail, L.: Unconditionally Concealing Quantum Bit Commitment From any One-Way Permutation. www.cki.au.dk/publication.html. EUROCRYPT'00, Bruges, Belgium, may 14-18, 2000. Advances in Cryptology, Proceedings of Eurocrypt 2000, Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1807: 300-315, 2000.
• Engberg E.; Nielsen M.: A Calculus of Communicating Systems with Label Passing - Ten Years after. In: Proof, Language, and Interaction: Essays in Honour of Robin Milner. Plotkin G.; Stirling C.; and Tofte M. (Eds.). MIT Press: 599-622, 2000.
• Ernst, E.: gbeta - a Language with Virtual Attributes, Block Structure, and Propagating, Dynamic Inheritance. Department of Computer Science, University of Aarhus: PB-549: 300 pp, 2000.
• Engberg, U.H.; Nielsen, M.: A Calculus of Communicating Systems with Label Passing. Ten Years After. In: Proof, Language, and Interaction; Essays in Honour of Robin Milner. Plotkin, G.; Stirling, C.; Tofte, M. (Eds.). Foundations of Computing. MIT Press: 599-622, 2000.
• Ésik, Z.: Continuous Additive Algebras and Injective Simulations of Synchronization Trees. RS-00-25. BRICS, Basic Research in Computer Science, Aarhus and Department of Computer Science, University of Szeged, Hungary: 41 pages, 2000.
• Ésik, Z.; Kuich, W.: Inductive *-Semirings. RS-00-27. BRICS, Basic Research in Computer Science, Aarhus: 34 pages, 2000.
• Ettinger, M.; Høyer, P.: On Quantum Algorithms for Noncommutative Hidden Subgroups. Advances in Applied Mathematics; 25(3): 239-251, 2000.
• Frandsen, G.S.: On the Density of Normal Bases in Finite Fields. Finte Fields and Their Applications; 6(1): 23-38, 2000.
• Fredslund, J.: Teaching A New Dog Old Tricks - The Assumption Architecture. Learning'00, 25 - 27. oktober 2000. Madrid, Spain: 6, 2000.
• Fridlender, D.; Indrika, M.: Do We Need Dependent Types? Journal of Functional Programming; 10(4): 409-415, 2000.
• Gabow, H.N.; Jordan, T.: How to make a square grid framework with cables rigid. SIAM J. Computing; 30(2): 649-680, 2000.
• Gabow, H.N.; Jordan, T.: Incrementing bipartite digraph edge-connectivity. J. Combinatorial Optimization; 4(4): 449-486, 2000.
• Gabow, H.N.; Jordán, T.: Bipartition Constrained Edge-Splitting in Directed Graphs. 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications (Kyoto, Japan, March 17-19, 1999). 225-232, 2000.
• Goldberg, M.: Gödelization in the lambda calculus. Information Processing Letters; 75(1-2): 13-16, 2000.
• Graf, S.; Schwartzbach, M.I.: Tools and Algorithms for The Construction and Analysis of Systems. 6th International Conference, TACAS '00 Proceedings (Berlin, Germany, March 27-31, 2000). Springer-Verlag, 2000.
• Grobauer, B.; Lawall, J.L.: Partial Evaluation of Pattern Matching in Strings, revisited. RS-00-31. BRICS, Basic Research in Computer Science, Aarhus: 48 pages, 2000.
• Grobauer, B.; Yang, Z.: The Second Futamura Projection for Type-Directed Partial Evaluation. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, PEPM '00 (Boston, USA, January 18-20, 2000). ACM Press, New York, NY10286-1405, USA: 22-32, 2000.
• Grønbæk, K.; Sloth, L.; Bouvin, N. O.: Open Hypermedia as User Controlled Meta Data for the Web. International World Wide Web Conference, Amsterdam, NL, May 15-19, 2000. Computer Networks; Amsterdam, 33: 553-566, 2000.
• Guiard, Y.; Beaudouin-Lafon, M.; Mottet, D.: Navigation as Multiscale Pointing: Extending Fitts' Model to Very High Precision Tasks. Human Factors in Computing Systems (CHI 99). ACM, New York, 1999: 450-457, 2000.
• Guo, Y.; Tewes, M.; Volkmann, L.; Yeo, A.: Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. Discrete Mathematics; 212: 91-100, 2000.
• Gutin, G.; Tewes, M.; Yeo, A.: Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. Discrete Mathematics; 222(1-3): 269-274, 2000.
• Gutin, G.; Yeo, A.: Kings in semicomplete multipartite digraphs. Journal of Graph Theory; 33(3): 177-183, 2000.
• Gutin, G.; Yeo, A.: Note on the path covering number of a semicomplete multipartite tournament. J. Combin. Math. and Combin. Computing; 32: 231-237, 2000.
• Gutin, G.; Yeo, A.: Polynomial Approximation Algorithms for the TSP and the QAP with a Factorial Domination Number. Discrete Applied Mathematics; 2000.
• Gutin, G.; Yeo, A.: Quasi-Hamiltonicity. A series of necessary conditions for a digraph to be Hamiltonian. Journal of Combinatorial Theory; 78(2): 232-242, 2000.
• Gutin, G.; Yeo, A.: Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. Graphs and Combinatorics; 2000.
• Hansen, J.V.: Combining Predictors. Meta Machine Learning Methods and Bias/Variance & Ambiguity Decompositions. Department of Computer Science, University of Aarhus: 200 pp, 2000.
• Hedin, G.; Knudsen, J.L.: On the Role of Language Constructs for Framework Design. Symposium on Object-Oriented Application Frameworks. ACM Computing Surveys; 32(1es), 2000.
• Henriksen, J.G.; Mukund, M.; Narayan Kumar, K.; Thiagarajan, P.S.: On Message Sequence Graphs and Finitely Generated Regular MSC Languages. http: //www.brics.dk/~gulmann/Papers/icalp2000.ps.gz. Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP'2000). Lecture Notes in Computer Science; Springer-Verlag, Geneva, Switzerland, July 9-15, 2000, 1853: 675-686, 2000.
• Henriksen, J.G.; Mukund, M.; Narayan Kumar, K.; Thiagarajan, P.S.: Regular Collections of Message Sequence Charts.http://www.brics.dk/~gulmann/Papers/mfcs2000.ps.gz. Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS'2000). Lecture Notes in Computer Science; Springer-Verlag, Bratislava, Slovakia, August 28 - September 1, 2000, 1893: 405-414, 2000.
• Henriksen, Jesper G.: Logics and Automata for Verification: Expressiveness and Decidability Issues. February 29th, 2000. Faculty of Science, University of Aarhus: xiv + 220 pages, 2000.
• Hune, T.S.: Modeling a Language for Embedded Systems in Timed Automata. RS-00-17. BRICS, Basic Research in Computer Science, Aarhus: 26 pages, 2000.
• Hune, T.S.; Larsen, K.G.; Pettersson, P.: Guided Synthesis of Control Programs Using Uppaal. International Workshop in Distributed Systems Validation and Verification. Held in conjunction with 20th IEEE International Conference on Distributed Computing Systems (ICDCS '2000), DSVV'00 (Taipei, Taiwan, ROC, April 10, 2000). IEEE Press: E15-E22, 2000.
• Hune, T.S.; Sandholm, A.B.: A Case Study on using Automata in Control Synthesis. Fundamental Approaches to Software Engineering: First International Conference; Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS '00, FASE '00 (Berlin, Germany, March 27 - April 1, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1783: 349-362, 2000.
• Hune, T.S.; Sandholm, A.B.: Using Automata in Control Synthesis. A Case Study. RS-00-22. BRICS, Basic Research in Computer Science, Aarhus: 20 pages, 2000.
• Høyer, P.: Arbitrary Phases in Quantum Amplitude Amplification. Physical Review A; 62(5): 052304/1-5, 2000.
• Høyer, P.: Simplified proof of the Fourier Sampling Theorem. Information Processing Letters; 75(4): 139-143, 2000.
• Jansen, K.; Sviridenko, M.I.: Polynomial Time Approximation Schemes for Multiprocessor Open and Flow Shop Problems. 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS '00 Proceedings (Lille, France, February 17-19, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1770: 455-465, 2000.
• Jensen, K.: Practical Use of High-level Petri Nets and Design/CPN. Http://www.daimi.au.dk/pn2000/proceedings. Workshop on Practical Use of High-level Petri Nets, June 27, 2000. Department of Computer Science, University of Aarhus, Denmark, Århus, PB-547: 147 pp. 2000.
• Jensen, K.: Second Workshop on Practical Use of Coloured Petri Nets and Design/CPNP: Department of Computer Science, University of Aarhus, Denmark. PB-541, 1999 210 pp., Århus, 2000.
• Jensen, M.T.: Neighbourhood based Robustness Applied to Tardiness and Total Flowtime Job Shops. Parallel Problem Solving from Nature - PPSN VI. Lecture Notes in Computer Science; Springer-Verlag, 1917: 283-292, 2000.
• Jurdzinski, M.: Games for Verfication. Algorithmic Issues. BRICS, Department of Computer Science, University of Aarhus, Denmark, 2000.
• Jurdzinski, M.: Small Progress Measures for Solving Parity Games. 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS '00 Proceedings (Lille, France, February 17-19, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1770: 290-301, 2000.
• Jurdzinski M.; Nielsen M.: Hereditary History Preserving Bisimilarity is Undecidable. STACS 2000, Lille, June. Lecture Notes in Computer Science; Springer-Verlag, 1770: 358-369, 2000.
• Jurdzinski, M.; Nielsen, M.: Hereditary History Preserving Bisimilarity Is Undecidable. 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS '00 Proceedings (Lille, France, February 17-19, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1770: 358-369, 2000.
• Klarlund, N.; Damgaard, N.; Schwartzbach, M.I.: YakYak. Parsing with logical side constraints. Developments in language theory. Foundations, applications, and perspectives. Aachen, Germany, 6-9 July 1999. World Scientific: 286-304, 2000.
• Klarlund, N.; Møller, A.; Schwartzbach, M.I.: Document Structure Description 1.0. NS-00-7. BRICS, Basic Research in Computer Science, Aarhus: 40 pages, 2000.
• Klarlund, N.; Møller, A.; Schwartzbach, M.I.: DSD. A Schema Language for XML. 3rd ACM SIGSOFT Workshop on on Formal Methods in Software Practice, FMSP '00 (Portland, Oregon USA, August 24-25, 2000). ACM Press, 2000.
• Klarlund, N.; Møller, A.; Schwartzbach, M.I.: MONA Implementation Secrets. Fifth International Conference on Implementation and Application of Automata, CIAA '00 Pre-Proceedings (London, Ontario, Canada, July 24-25, 2000). University of Western Ontario, 2000.
• Klarlund, N.; Møller, A.; Schwartzbach, M.I.: The DSD Schema Language and its Applications. RS-00-41. BRICS, Basic Research in Computer Science, Aarhus: 32 pages, 2000.
• Klíma, O.; Srba, J.: Matching Modulo Associativity and Idempotency is NP-Complete. Mathematical Foundations of Computer Science: 25th International Symposium, MFCS '00 (Bratislava, Slovak Republic, August 28 - September 1, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1893: 456-466, 2000.
• Kohlenbach, U.: Effective Uniform Bounds on the Krasnoselski-Mann Iteration. RS-00-9. BRICS, Basic Research in Computer Science, Aarhus: 34 pages, 2000.
• Kohlenbach, U.: Foundation and Mathematical Uses of Higher Types. In: Festschrift in Honor of Solomon Feferman. Barwise, J.; Sieg, W.; Sommer, R.; Talcott, C. (Eds.): 24 pages, 2000.
• Kohlenbach, U.: Higher Order Reverse Mathematics. RS-00-49. BRICS, Basic Research in Computer Science, Aarhus: 18 pages, 2000.
• Kohlenbach, U.: Intuitionistic Choice and Restricted Classical Logic. RS-00-12. BRICS, Basic Research in Computer Science, Aarhus: 9 pages, 2000.
• Kohlenbach, U.: On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems. Informatik Berichte 272-9/2000. Fern-Universitaet Hagen: 199-225 pages, 2000.
• Kohlenbach, U.: Things That Can And Things That Can't Be Done In PRA. Annals of Pure and Applied Logic; 102(3): 223-245, 2000.
• Krink, T.: Cooperation and Selfishness in Strategies for Resource Management. Spill Science & Technology Bulletin; 6: 165-171, 2000.
• Krink, T.; Thomsen, R.; Rickers, P.: Applying Self-Organised Criticality to Evolutionary Algorithms. Parallel Problem Solving from Nature - PPSN VI. Springer-Verlag, Paris, France: 1917: 375-384, 2000.
• Krink, T.; Ursem, R.K.: Parameter Control Using the Agent Based Patchwork Model. Second Congress on Evolutionary Computation (CEC-2000). San Diego, CA, USA: 77-83, 2000.
• Krink, T.; Vollrath, F.: Optimal area use in the orb web of the spider Araneus diadematus. Naturwissenschaften; 87(2): 90-93, 2000.
• Kristensen, L.M.: State Space Methods for Coloured Petri Nets. Department of Computer Science, University of Aarhus: 191 pp, 2000.
• Kristensen, L.M.; Valmari, A.: Improved Question-Guided Stubborn Set Methods for State Properties. ICATPN'2000. Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1825, 2000.
• Lorentsen, L.; Kristensen, L.M.: Modelling and Analysis of a Danfoss Flowmeter System using Coloured Petri Nets. Application and Theory of Petri Nets 2000. Proceedings of the 21st International Petri Net Conference (ICATPN'2000). Aarhus Denmark, June 2000. Lecture Notes in Computer Science; Nielsen, M.; Simpson, D. (Eds.), Springer-Verlag, 1825: 346-366, 2000.
• Lyngsø, R.B.; Pedersen, C.N.S.: Protein Folding in the 2D HP Model. 1st Journées Ouvertes: Biologie, Informatique et Mathématiques (JOBIM 2000). 2000.
• Lyngsø, R.B.; Pedersen, C.N.S.: Pseudoknots in RNA Secondary Structures. Fourth Annual International Conference on Computational Molecular Biology, RECOMB '00 (Tokyo, Japan, April 8-11, 2000). ACM Press: 201-209, 2000.
• Lyngsø, R.B.; Pedersen, C.N.S.: RNA Pseudoknot Prediction in Energy-Based Models. Journal of Computational Biology; 7(3/4): 409-427, 2000.
• Mackay, W.E.: Augmented Reality: Dangerous Liaisons or the Best of Both Worlds? Conference on Designing Augmented Reality Environments, ACM DARE, Helsingør, Denmark, 12-14 April. ACM: 171-172, 2000.
• Makay, W.E. (ed): Proceedings of ACM DARE 2000. Conference on Designing Augmented Reality Environments, ACM DARE, Helsingør, Denmark, 12-14 April: 172 pages, 2000.
• Mackay, W.E.: Is Paper Safer? The Role of Paper Flight Strips in Air Traffic Control. ACM/Transactions on Computer-Human Interaction; ACM Press, 6(4): 311-340, 2000.
• Mackay, W.E.: Responding to cognitive overload: Co-adaptation between users and technology. Intellectica; 30(1): 177-193, 2000.
• Mackay, W.E.: Video Techniques for Participatory Design: Observation, Brainstorming & Prototyping. CHI 2000, Human Factors in Computing Systems. The Hague, the Netherlands. ACM: 148, 2000.
• Mackay, W.E.; Ratzer, A.; Janecek, P.: Video artifacts for design: Bridging the gap between abstraction and detail. ACM DIS 2000, Conference on Designing Interactive Systems. Brooklyn, New York. ACM Press: 72-82, 2000.
• Madsen, O.L.: Abstraction and Modularization in the BETA Programming Language. Joint Modular Language Conference 2000, JMLC'2000, Zürich. Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1897: 211-237, 2000.
• Madsen, O.L.: Towards a Unified Programming Language. European Conference on Object-Oriented Programming, ECOOPþ 2000, Cannes. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1850: 1-26, 2000.
• Mailund, T.; Mortensen, K.H.: Separation of Style and Content with XML in an Interchange Format for High-level Petri Nets. http: //www.daimi.au.dk/pn2000/Interchange/. 21st International Conference on Application and Theory of Petri Nets, Aarhus, 2000. Meeting on XML/SGML based Interchange Formats for Petri Nets. Bastide, R.; Billington, J.; Kindler, E.; Kordon, F.; Mortensen, K.H. (Eds.), Aarhus: 7-12, 2000.
• Miltersen, P.B.: One the Shannon function for partially defined Boolean functions. Workshop on Boolean Functions and Applications, Geneva, July 15, 2000. Carleton Scientific's Proceedings in Informatics; 8: 253-258, 2000.
• Mogensen, P.; Grønbæk, K.: Hypermedia in the Virtual Project Room - Toward Open 3D Spatial Hypermedia. Eleventh Conference on Hypertext and Hypermedia, May 30 to June 3, 2000, San Antonio, Texas, USA. New York: 113-122, 2000.
• Mortensen, K.H.: Automatic Code Generation Method Based on Coloured Petri Net Models Applied on an Access Control System. Application and Theory of Petri Nets 2000. Proceedings of the 21st International Petri Net Conference (ICATPN'2000). Aarhus Denmark, June 2000. Lecture Notes in Computer Science; Nielsen, M.; Simpson, D. (Eds.), Springer-Verlag, 1825: 367-386, 2000.
• Mosses, P.D.: A Foreword to "Fundamental Concepts in Programming Languages". Higher-Order and Symbolic Computation; 13(1-2): 7-9, 2000.
• Mosses, P.D.: CASL for CafeOBJ Users. In: CAFE. An Industrial-Strength Algebraic Formal Method. Futatsugi, K.; Nakagawa, A.T.; Tamai, T. (Eds.). Elsevier: 121-144, 2000.
• Mosses, P.D.: Modularity in Meta-Languages. 2nd Workshop on Logical Frameworks and Meta-Languages, LFM'00 (Santa Barbara, California, USA, June 25, 2000). INRIA: 1-18, 2000.
• Mosses, P.D.; de Moura, H.P.: Proceedings of the Third International Workshop on Action Semantics, AS 2000, (Recife, Brazil, May 15-16, 2000). NS-00-6, Aarhus: viii+148 pages, 2000.
• Mustafa, N.H.; Pekec, A.: Democratic Consensus and the Local Majority Rule. RS-00-8. BRICS, Basic Research in Computer Science, Aarhus: 38 pages, 2000.
• Møller, A.; Schwartzbach, M.I.: The Pointer Assertion Logic Engine. RS-00-39. BRICS, Basic Research in Computer Science, Aarhus: 23 pages, 2000.
• Møller, A.; Schwartzbach, M.I.: The XML Revolution. NS-00-8. BRICS, Basic Research in Computer Science, Aarhus: 149 pages, 2000.
• Möller, M.O.; Alur, R.: Heuristics for Hierarchical Partitioning with Application to Model Checking. RS-00-21. BRICS, Basic Research in Computer Science, Aarhus: 30 pages, 2000.
• Nielsen, L.R.: A Denotational Investigation of Defunctionalization. RS-00-47. BRICS, Basic Research in Computer Science, Aarhus, 2000.
• Nielson, F.; Nielson, H.R.; Sagiv, M.: A Kleene Analysis of Mobile Ambients. Proc. ESOP'00. Lecture Notes in Computer Science; Springer-Verlag, 1782: 304-319, 2000.
• Nielson, H.R.; Nielson, F.: Shape Analysis for Mobile Ambients. Proc. POPL'00. ACM Press: 142-154, 2000.
• Pagh, R.: A New Trade-off for Deterministic Dictionaries. The Seventh Scandinavian Workshop on Algorithm Theory, Bergen Norway, July 5-7 2000. Lecture Notes in Computer Science; Springer-Verlag, Bergen, 1851: 22-31, 2000.
• Pagh, R.: A New Trade-Off for Deterministic Dictionaries. 7th Scandinavian Workshop on Algorithm Theory, SWAT '98 (Bergen, Norway, July 5-7, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1851: 22-31, 2000.
• Pagh, R.: A Trade-Off for Worst-Case Efficient Dictionaries. Nordic Journal of Computing; 7(3): 151-163, 2000.
• Pagh, R.: Dispersing Hash Functions. In: 4th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM '00 (Geneva, Switzerland, July 14, 2000). Rolim, J.D.P. (Ed.). 8 of Proceedings in Informatics. Carleton Scientific: 53-67, 2000.
• Pagh, R.: Faster Deterministic Dictionaries. The Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'00 (San Francisco, California, USA, January 9-11, 2000). ACM Press: 487-493, 2000.
• Pagter, J.: On Ajtai's Lower Bound Technique for R-way Branching Programs and the Hamming Distance Problem. RS-00-11. BRICS, Basic Research in Computer Science, Aarhus: 18 pages, 2000.
• Power, J.; Cattani, G.L.; Winskel, G.: A Representation Result for Free Cocompletions. Journal of Pure and Applied Algebra; 151: 273-286, 2000.
• Quaglia, P.; Walker, D.: On Synchronous and Asynchronous Mobile Processes. Foundations of Software Science and Computation Structures; Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS '00, FOSSACS '00 (Berlin,Germany, March 27-31, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1784: 283-296, 2000.
• Queyranne, M.; Sviridenko, M.I.: New and Improved Algorithms for Minsum Shop Scheduling. The Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'00 (San Francisco, California, USA, January 9-11, 2000). ACM Press: 871-878, 2000.
• Reynolds, J.C.: The Meaning of Types. From Intrinsic to Extrinsic Semantics. RS-00-32. BRICS, Basic Research in Computer Science, Aarhus: 35 pages, 2000.
• Rickers, P.; Thomsen, R.; Krink, T.: Applying Self-Organized Criticality to the Diffusion Model. Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference. Las Vegas, Nevada, USA: 325-330, 2000.
• Riis, S.; Sitharam, M.: Uniformly Generated Submodules of Permutation Modules. Annals of Pure and Applied Algebra; 2000.
• Robertson, G.; Mackay, W.E.: AVI'2000: Advanced Visual Interfaces, International Working Conference. ACM/SIGCHI, 2000.
• Romanovsky, A.; Dony, C.; Knudsen, J.L.; Tripathi, A.: Exception Handling in Object Oriented Systems. Object-Oriented Technology ECOOP'2000 Workshop Reader. Lecture Notes in Computer Science; Springer Verlag, 1964: 16-31, 2000.
• Sandholm, A.B.; Schwartzbach, M.I.: A Type System for Dynamic Web Documents. 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '00 (Boston, Massachusetts, USA, January 19-21, 2000). ACM Press, 2000.
• Santocanale, L.: Free mu-lattices. RS-00-28. BRICS, Basic Research in Computer Science, Aarhus: 51 pages, 2000.
• Santocanale, L.: Sur les mu-treillis libres. Université du Québec à Montréal, Montréal: 178 pp, 2000.
• Santocanale, L.: The Alternation Hierarchy for the Theory of mu-lattices. Also as extended abstract. Volume of abstracts from the International Summer Conference in Category Theory, CT2000, Como, Italy, July 16-22, 2000; Como, Italy: 7, 2000.RS-00-29. BRICS, Basic Research in Computer Science, Aarhus: 44 pages, 2000.
• Santocanale, L.: The Theory of mu-lattices. Short abstract. Fixed Points in Computer Science, FICS'2000. Paris, France, July 22-23, 2000. Volume of abstracts from the Workshop Fixed Points in Computer Science, FICS'2000, Paris, France, July 22-23, 2000; Paris, France: 50-2, 2000.
• Schultz, U.P.: Partial Evaluation for Class-Based Object-Oriented Languages. PB-552. Department of Computer Science, University of Aarhus: 24 pages, 2000.
• Schultz, U.P.; Consel, C.: Automatic Program Specialization for Java. PB-551. Department of Computer Science, University of Aarhus: 26 pages, 2000.
• Schwartzbach, M.I.; Møller, A.; Elgaard, J.: Compile-Time Debugging of C Programs Working on Trees. Programming Languages and Systems: Ninth European Symposium on Programming; Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS '00, ESOP'00 (Berlin, Germany, March 27-31, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1782: 119-134, 2000.
• Srba, J.: Complexity of Weak Bisimilarity and Regularity for BPA and BPP. Expressiveness in Concurrency: 7th International Workshop EXPRESS'00 (Pennsylvania, USA August 21, 2000). Elsevier Science Publishers, Electronic Notes in Theoretical Computer Science, 2000.
• Sviridenko, M.; Ageev, A.A.: An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. Lecture Notes in Computer Science; Springer-Verlag, 1879: 32-41, 2000.
• Sviridenko, M.I.: Worst-Case Analysis of the Greedy Algorithm for a Generalization of the Maximum p-Facility Location Problem. Operations Research Letters; 26(3): 193-197, 2000.
• Thomsen, R.; Rickers, P.; Krink, T.: A Religion-Based Spatial Model For Evolutionary Algorithms. Parallel Problem Solving from Nature - PPSN VI. Springer-Verlag, Paris, France: 1917: 817-826, 2000.
• Thorup, K.K.: Discourse on Genericity in Object-Oriented Programming Languages, Department of Computer Science, University of Aarhus, 2000.
• Ursem, R.K.: Multinational Evolutionary Algorithms. The 1999 Congress on Evolutionary Computation, CEC '99 (Washington, DC, USA, July 6-9, 1999). IEEE Press: 1633-1640, 2000.
• Ursem, R.K.: Multinational GAs. Multimodal Optimization Techniques in Dynamic Environments. Second Genetic and Evolutionary Computation Conference (GECCO-2000). Morgan Kauffmann Publishers, Riviera Hotel, Las Vegas, USA: 19-26, 2000.
• van Leeuwen, J.; Watanabe, O.; Hagiya, M.; Mosses, P.D.; Ito, T.: TCS 2000, Proc. International Conference on Theoretical Computer Science. Exploring New Frontiers of Theoretical Informatics, Sendai, Japan, August 2000, Proceedings. Springer-Verlag, 2000.
• Variyam, V.N.: A Note on NP\cap coNP/poly. RS-00-19. BRICS, Basic Research in Computer Science, Aarhus: 7 pages, 2000.
• Vöge, J.; Jurdzinski, M.: A Discrete Strategy Improvement Algorithm for Solving Parity Games (Extended Abstract). Computer-Aided Verification: 11th International Conference, CAV'00 (Chicago, USA, July 15-19, 2000). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1855: 202-215, 2000.
• Walukiewicz, I.: Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus. Information and Computation; 157: 142-182, 2000.
• Walukiewicz, I.: Local Logics for Traces. RS-00-2. BRICS, Basic Research in Computer Science, Aarhus: 30 pages, 2000.
• Walukiewicz, I.: Model checking CTL properties of pushdown systems. Foundations of Software Technology and Theoretical Computer Science FSTCS, New Delhi, December 2000. Lecture Notes in Computer Science; Springer-Verlag, New Delhi, 1974: 127-138, 2000.
• Yang, Z.: Reasoning About Code-Generation in Two-Level Languages. RS-00-46. BRICS, Basic Research in Computer Science, Aarhus, 2000.
• Yeo, A.: How Close to Regular must a Multipartite Tournament be to Secure Hamiltonicity? Graphs and Combinatorics; 2000.
• Ørbæk, P.: A Real-Time Software Video Codec based on Wavelets. International Conference on Communication Technology 2000. Beijing, China. ICCT2000 proceedings; 2: 1149-1156, 2000.
• Ørbæk, P.: An Experimental System for Distributed Classroom Education. TERENA Networking Conference, Lisbon, Portugal. Computer Networks; Amsterdam, 34: 843-850, 2000.

Forskningspublikationer

Monografier

Corry, A.: Patterns in Software Development. PhD thesis. DAIMI PhD Dissertation PD-01-1. Department of Computer Science, University of Aarhus: xiix+143 pages, 2001.

Damgaard, N.: Using Theory to Make Better Tools. PhD thesis. BRICS Dissertation Series DS-01-8. University of Aarhus, 2001.

Damian, D.: On Static and Dynamic Control-Flow Information in Program Analysis and Transformation. PhD thesis. BRICS Dissertation Series DS01-5. University of Aarhus: xii+111 pages, 2001.

Dziembowski, S.: Multiparty Computations. Information-Theoretically Secure Against an Adaptive Adversary. PhD thesis. BRICS Dissertation Series DS-01-1. University of Aarhus: 109 pages, 2001.

Grobauer, B.: Topics in Semantics-based Program Manipulation. PhD thesis. BRICS Dissertation Series DS-01-6. University of Aarhus: ii+x+186 pages, 2001.

Hune, T.S.: Analyzing Real-Time Systems. Theory and Tools. PhD thesis. BRICS Dissertation Series DS-01-3. University of Aarhus: xii+265 pages, 2001.

Jensen, M.T.: Robust and Flexible Scheduling with Evolutionary Computation. PhD thesis. BRICS Dissertation Series DS-01-10. University of Aarhus: xii+299 pages, 2001.

Nielsen, L.R.: A Study of Defunctionalization and Continuation-Passing Style. PhD thesis. BRICS Dissertation Series DS-01-7. University of Aarhus: iv+280 pages, 2001.

Pagter, J.: Time-Space Trade-Offs. PhD thesis. BRICS Dissertation Series DS-01-2. University of Aarhus: xii+83 pages, 2001.

Rhiger, M.: Higher-Order Program Generation. PhD thesis. BRICS Dissertation Series DS-01-4. University of Aarhus: xiv+144 pages, 2001.

Rodler, F.F.: Compression with Fast Random Access. PhD thesis. BRICS Dissertation Series DS-01-9. University of Aarhus: xiv+123 pages, 2001.

Torgersen, M.: Unifying Abstractions. PhD thesis. DAIMI PhD Dissertation PD-01-2. Department of Computer Science, University of Aarhus: x+114 pages, 2001.

Bidrag i antologier

Alstrup, S.; Brodal, G.S.; Rauhe, T.: Optimal Static Range Reporting in One Dimension. In: The Thirty-Third Annual ACM Symposium on Theory of Computing, STOC '01. Yannakakis, M. (Ed.). Crete, Greece, July 6-8, 2001. ACM Press, New York: pp. 476-482, 2001.

Amnell, T.; Behrmann, G.; Bengtsson, J.; D'Argenio, P.R.; David, A.;Fehnker, A.; Hune, T.S.; Jeannet, B.; Larsen, K.G.; Möller, M.O.;Pettersson, P.: UPPAAL. Now, Next, and Future. In: Modeling andVerification of Parallel Processes. 4th Summer School, MOVEP 2000Revised Tutorial Lectures (Nantes, France, June 19-23, 2000).Cassez, F.; Jard, C.; Rozoy, B.; Ryan, M.D. (Eds.). 2067 of LectureNotes in Computer Science. Springer-Verlag, Berlin: pp. 99-124, 2001.

Bardram, J.; Christensen, H.B.: Middleware for Pervasive Healthcare. A White Paper. In: Proc. of Advanced Topic Workshop Middleware for Mobile Computing. www.cs.arizona.edu/mmc/Program.html. November 16, Heidelberg, Germany, 2001.

Beaudouin-Lafon, M.; Mackay, W.E.; Andersen, P.; Janecek, P.;Jensen, M.; Lassen, M.; Lund, K.; Mortensen, K.; Munck, S.; Ratzer, A.;Ravn, K.; Christensen, S.; Jensen, K.: CPN/Tools: A Post-WIMP Interfacefor Editing and Simulating Coloured Petri Nets. In: Applications and Theory of Petri Nets 2001.Colom, J.-M.; Koutny, M. (Eds.). ICATPN 2001, June 25-29, Newcastleupon Tyne, UK. 2075 of Lecture Notes in Computer Science.Springer-Verlag: pp. 71-81, 2001.

Behrmann, G.; David, A.; Larsen, K.G.; Möller, M.O.; Petterson, P.; Yi, W.: Uppaal - Present and Future. In: 40th IEEE Conference on Decision and Control. IEEE Service Center, Piscataway, NJ, 2001.

Behrmann, G.; Fehnker, A.; Hune, T.S.; Larsen, K.G.; Pettersson, P.;Romijn, J.: Efficient Guiding Towards Cost-Optimality in Uppaal. In: Tools and Algorithms for The Construction and Analysis of Systems. 7th International Conference, TACAS '01.Margaria, T.; Yi, W. (Eds.). Genova, Italy, April 2-6, 2000. 2031 ofLecture Notes in Computer Science. Springer-Verlag: pp. 174-188, 2001.

Behrmann, G.; Fehnker, A.; Hune, T.S.; Larsen, K.G.; Pettersson, P.;Romijn, J.; Vaandrager, F.W.: Minimum-Cost Reachability for PricedTimed Automata. In: Hybrid Systems. Computation and Control, Fourth International Workshop, HSCC '01.Di Benedetto, M.D.; Sangiovanni-Vincentelli, A. (Eds.). Roma, Italy,March 28-30, 2001. 2034 of Lecture Notes in Computer Science.Springer-Verlag: pp. 147-161, 2001.

Bertelsen, O.W.; Bødker, S.: Cooperation in massively distributed information spaces. In: Proc. of the Seventh European Conference on Computer Supported Cooperative Work. ECSCW 2001, September 16-20, Bonn, Germany. Kluwer Academic Publishers, Dordrecht: pp. 1-18, 2001.

Bouvin, N.O.: Creating and Styling Fluid Annotations on Third-Party Web Pages. In: Proc. of the First Danish Human-Computer Interaction Research Symposium.Bertelsen, O.W. (Ed.). November 16, University of Aarhus. DAIMI PB-555.Department of Computer Science, Århus: pp. 12-13, 2001.

Brabrand, C.; Møller, A.; Schwartzbach, M.I.: Static Validation of Dynamically Generated HTML. In: Program Analysis for Software Tools and Engineering. ACM (Ed.). PASTE: pp. 221-231, 2001.

Brodal, G.S.; Fagerberg, R.; Pedersen, C.N.S.: Computing the Quartet Distance Between Evolutionary Trees in Time O(n log2 n). In: 12th International Symposium on Algorithms and Computation, ISAAC '01.Eades, P.; Takaoka, T. (Eds.). Christchurch, New Zealand, December19-21, 2001. 2223 of Lecture Notes in Computer Science.Springer-Verlag, Berlin: pp. 731-742, 2001.

Brodal, G.S.; Fagerberg, R.; Pedersen, C.N.S.; Östlin, A.: TheComplexity of Constructing Evolutionary Trees Using Experiments. In: Proc. 28th International Colloquium on Automata, Languages, and Programming. 2076 of Lecture Notes in Computer Science. Springer-Verlag: pp. 140-151, 2001.

Brylow, D.; Damgaard, N.; Palsberg, J.: Static Checking of Interrupt-driven Software. In: ICSE 2001, 23rd International Conference on Software Engineering. IEEE Computer Society: pp. 47-56, 2001.

Buhrman, H.; Dürr, C.; Heiligman, M.; Høyer, P.; Magniez, F.;Santha, M.; de Wolf, R.: Quantum Algorithms for element distinctness.In: Proceedings of 16th Annual IEEE Conference on Computational Complexity. CCC'2001, June 18-21, Chicago, IL, USA. IEEE: pp. 131-137, 2001.

Büscher, M.; Mogensen, P.; Shapiro, D.: Spaces of Practice. In: Proc. of the Seventh European Conference on Computer Supported Cooperative Work. Prinz, W.et al. (Ed.). ECSCW'2001, September 16-20, Bonn, Germany. Kluwer Academic Publishers, Dordrecht: pp. 139-158, 2001.

Caccamo, M.J.; Winskel, G.: A Higher-Order Calculus for Categories. In: Theorem Proving in Higher Order Logics. 14th International Conference, TPHOLs '01.Boulton, R.J.; Jackson, P.B. (Eds.). Edinburgh, Scotland, September3-6, 2001. 2152 of Lecture Notes in Computer Science. Springer-Verlag,Berlin: pp. 136-153, 2001.

Canamero, D.; Fredslund, J.: I Show You How I Like You: EmotionalHuman-Robot Interaction through Facial Expression and TactileStimulation. In: IEEE Transactions on Systems, Man, and Cybernetics. Part A, vol. 31, no. 5. IEEE: pp. 454-459, 2001.

Canetti, R.; Damgård, I.B.; Dziembowski, S.; Ishai, Y.; Malkin, T.:On Adaptive vs. Non-adaptive Security of Multiparty Protocols. In: Advances in Cryptology. International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT '01.Pfitzmann, B. (Ed.). Innsbruck, Austria, May 6-10, 2001. 2045 ofLecture Notes in Computer Science. Springer-Verlag: pp. 262-279, 2001.

Christensen, H.B.: Tracking Change in rapid and eXtreme Development: A Challenge to SCM-tools? In: Proc. of Tenth International Workshop on Software Configuration Management. www1.ics.uci.edu/~andre/scm10/papers.html. SCM-10, May 14-15, Toronto, Canada, 2001.

Christensen, S.; Jensen, K.; Mailund, T.: State Space Methods for Timed Petri Nets. In: Proc. of 2nd International Colloquium on Petri Net Technologies for Modelling Communication Based Systems.Weber, H.; Ehrig, H.; Reisig, W. (Eds.). September 14-15, Berlin,Germany. DFG-Forschergruppe Petri Net Technologie, Berlin: pp. 33-42,2001.

Christensen, S.; Kristensen, L.M.; Mailund, T.: A Sweep-Line Method for State Space Exploration. In: Proc. of Tools and Algorithms for the Construction and Analysis of Systems.Margaria, T.; Yi, W. (Eds.). TACAS 2001, 2-6 April, Genova, Italien.2031 of Lecture Notes in Computer Science. Springer-Verlag: pp.450-464, 2001.

Cramer, R.; Damgård, I.: Secure Distributed Linear Algebra in Constant Number of Rounds. In: Advances in Cryptology.Kilian, J. (Ed.). 21st International Conference on Cryptology, August19-23, Santa Barbara, CA, USA. 2139 of Lecture Notes in ComputerScience. Springer-Verlag: pp. 119-137, 2001.

Cramer, R.; Damgård, I.; Fehr, S.: On the Cost of Reconstructing a Secret. Or: VSS with Optimal Reconstruction. In: Advances in Cryptology.21st International Conference on Cryptology, August 19-23, SantaBarbara, CA, USA. 2139 of Lecture Notes in Computer Science.Springer-Verlag: pp. 503-524, 2001.

Cramer, R.; Damgård, I.B.; Nielsen, J.B.: Multiparty Computation from Threshold Homomorphic Encryption. In: Advances in Cryptology. International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT '01.Pfitzmann, B. (Ed.). Innsbruck, Austria, May 6-10, 2001. 2045 ofLecture Notes in Computer Science. Springer-Verlag: pp. 280-300, 2001.

Crazzolara, F.; Winskel, G.: Events in Security Protocols. In: 8th ACM conference on Computer and Communications Security, CCS '01. Philadelphia, PA, USA, November 5-8, 2001. ACM Press: pp. 96-105, 2001.

Crazzolara, F.; Winskel, G.: Petri Nets in Cryptographic Protocols. In: 6thInternational Workshop on Formal Methods for Parallel Programming.Theory and Applications. Held in conjunction with 15th InternationalParallel & Distributed Processing Symposium. Charpentier, M.;Sanders, B. (Eds.). IPDPS '2001 (Hyatt Regency, San Francisco, USA,April 23-27, 2001). IEEE Press: pp. 149, 2001.

Crepeau, C.; Legare, F.; Salvail, L.: How to Convert a Flavor of Quantum Bit Commitment. In: Advances in Cryptology.http://www.cki.au.dk/publication.html. Eurocrypt'01, May 6-11,Innsbruck, Østrig. 2045 of Lecture Notes in Computer Science.Springer-Verlag, Berlin: pp. 60-77, 2001.

Cryan, M.; Miltersen, P.B.: On pseudorandom generators in NC0. In: Proc. 26th International Symposium on Mathematical Foundations of Computer Science.MFCS'01, August 27-31, Marianske Lazne, Czech Republic. 2136 of LectureNotes in Computer Science. Springer-Verlag: pp. 272-284, 2001.

Damgård, I.B.; Jurik, M.J.: A Generalisation, a Simplification andsome Applications of Paillier's Probabilistic Public-Key System. In: Fourth International Workshop on Practice and Theory in Public Key Cryptography, PKC '01.Kim, K. (Ed.). Cheju Island, Korea, February 13-15, 2001. 1992 ofLecture Notes in Computer Science. Springer-Verlag: pp. 119-136, 2001.

Damgård, I.B.; Koprowski, M.: Practical Threshold RSA Signatures Without a Trusted Dealer. In: Advances in Cryptology. International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT '01.Pfitzmann, B. (Ed.). Innsbruck, Austria, May 6-10, 2001. 2045 ofLecture Notes in Computer Science. Springer-Verlag: pp. 152-165, 2001.

Damian, D.: Time Stamps for Fixed-Point Approximation. In: Seventeenth Conference on the Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science. Elsevier Science, 2001.

Dantchev, S.; Riis, S.: "Planar" Tautologies Hard for Resolution. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS '01.IEEE (Ed.). Las Vegas, Nevada, USA, October 14-17, 2001. IEEE Press,1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA: pp.220-229, 2001.

Dantchev, S.; Riis, S.: Tree Resolution Proofs of the Weak Pigeon-Hole Principle. In: The 16th Annual IEEE Conference on Computational Complexity, COMPLEXITY '01. Fortnow, L. (Ed.). Chicago, Illinois, USA, June 18-21, 2001. IEEE Press, 2001.

Danvy, O.; Damian, D.: Static Transition Compression. In: 2nd International Workshop on Semantics, Applications, and Implementation of Program Generation, SAIG '01.Taha, W. (Ed.). Florence, Italy, September 6, 2001. 2196 of LectureNotes in Computer Science. Springer-Verlag: pp. 92-107, 2001.

Danvy, O.; Grobauer, B.; Rhiger, M.: A Unifying Approach to Goal-Directed Evaluation. In: 2nd International Workshop on Semantics, Applications, and Implementation of Program Generation, SAIG '01.Taha, W. (Ed.). Florence, Italy, September 6, 2001. 2196 of LectureNotes in Computer Science. Springer-Verlag: pp. 108-125, 2001.

Danvy, O.; Nielsen, L.R.: A Higher-Order Colon Translation. In: Fifth International Symposium on Functional and Logic Programming, FLOPS '01.Kuchen, H.; Ueda, K. (Eds.). Tokyo, Japan, March 7-9, 2001. 2024 ofLecture Notes in Computer Science. Springer-Verlag: pp. 78-91, 2001.

Danvy, O.; Nielsen, L.R.: CPS Transformation of Beta-Redexes. In: Third ACM SIGPLAN Workshop on Continuations. Sabry, A. (Ed.). 545 of Technical report. Computer Science Department, Indiana University, London, England: pp. 35-39, 2001.

Danvy, O.; Rhiger, M.: A Simple Take on Typed Abstract Syntax in Haskell-like Languages. In: Fifth International Symposium on Functional and Logic Programming, FLOPS '01.Kuchen, H.; Ueda, K. (Eds.). Tokyo, Japan, March 7-9, 2001. 2024 ofLecture Notes in Computer Science. Springer-Verlag: pp. 343-358, 2001.

Doh, K.; Mosses, P.D.: Composing Programming Languages by Combining Action-Semantics Modules. In: First Workshop on Language Descriptions, Tools and Applications. van den Brand, M.; Parigot, D. (Eds.). LDTA'01. 44(2) of Elec. Notes in Theoretical Comp. Sci, 2001.

Eugster, P.T.; Guerraoui, R.; Damm, C.H.: On Objects and Events. In: Proc. of ACM Conference on Object-Oriented Programming Systems, Languages and Applications. OOPSLA, October 14-18, Tampa Bay, Florida, USA. ACM: pp. 254-269, 2001.

Fagerberg, R.; Larsen, K.S.; Jensen, R.E.: Search Trees with Relaxed Balance and Near-Optimal Height. In: Algorithms and Data Structures. 7th International Workshop, WADS '01.Dehne, F.K.H.A.; Sack, J.; Tamassia, R. (Eds.). Providence, RI, USA,August, 8-10, 2001. 2125 of Lecture Notes in Computer Science.Springer-Verlag: pp. 414-425, 2001.

Filinski, A.: An Extensional CPS Transform (Preliminary Report). In: Third ACM SIGPLAN Workshop on Continuations. Sabry, A. (Ed.). 545 of Technical Report. Computer Science Department, Indiana University, London, UK: pp. 41-46, 2001.

Filinski, A.: Normalization by Evaluation for the Computational Lambda-Calculus. In: Typed Lambda Calculi and Applications. 5th International Conference, TLCA '01.Abramsky, S. (Ed.). Krakov, Poland, May 2-5 2001. 2044 of Lecture Notesin Computer Science. Springer-Verlag, Berlin: pp. 151-165, 2001.

Fredslund, J.; Mataric, M.J.: Robot Formations Using Only Local Sensing and Control. In: Proc. of the International Symposium on Computational Intelligence in Robotics and Automation. CIRA 2001, July 29-August 1, Banff, Alberta, Canada. IEEE: pp. 308-313, 2001.

Grobauer, B.: Cost Recurrences for DML Programs. In: 6th ACM SIGPLAN International Conference on Functional Programming. Leroy, X. (Ed.). Florence, September 3-5, 2001. ACM Press: pp. 253-264, 2001.

Grønbæk, K.; Gundersen, K.; Mogensen, P.; Ørbæk, P.: Interactive Room Support for Complex and Distributed Design Projects. In: Proceedings of the Interact'01. Hirose, M. (Ed.). Human Computer Interaction (Interact'01), Tokyo, Japan: pp. 407-414, 2001.

Hansen, K.M.: Fluid Interfaces. In: Proc. of the First Danish Human-Computer Interaction Symposium. November 27, University of Aarhus. Århus: pp. 25-26, 2001.

Hune, T.S.; Romijn, J.; Stoelinga, M.; Vaandrager, F.W.: Linear Parametric Model Checking of Timed Automata. In: Tools and Algorithms for The Construction and Analysis of Systems. 7th International Conference, TACAS '01.Margaria, T.; Yi, W. (Eds.). Genova, Italy, April 2-6, 2000. 2031 ofLecture Notes in Computer Science. Springer-Verlag: pp. 174-188, 2001.

Høyer, P.; Neerbek, J.; Shi, Y.: Quantum complexities of ordered searching, sorting, and element distinctness. In: Proc. of 28th International Colloquium on Automata, Languages, and Programming.ICALP'01, June 8-12, Hersonissos, Kreta, Grækenland. 2076 of LectureNotes in Computer Science. Springer-Verlag, Berlin: pp. 346-357, 2001.

Jagota, A.; Lyngsø, R.B.; Pedersen, C.N.S.: Comparing Hidden Markov Model and a Stochastic Context-Free Grammer. In: Algorithms in Bioinformatics. 1st International Workshop, WABI '01.Gascuel, O.; Moret, B.M.E. (Eds.). Aarhus Denmark, August 28-31, 2001.2149 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp.69-84, 2001.

Jensen, M.T.: Finding Worst-Case Flexible Schedules using Coevolution. In: Proc. of the Genetic and Evolutionary Computation Conference. Spector, L.et al. (Ed.). GECCO 2001, July 7-11, San Francisco, USA: pp. 1144-1151, 2001.

Kohlenbach, U.: On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems. In: Fourth Workshop on Computability and Complexity in Analysis, CCA '00.Blanck, J.; Brattka, V.; Hertling, P.; Weihrauch, K. (Eds.). Swansea,Wales, September 17-19, 2000. 2064 of Lecture Notes in ComputerScience. Springer-Verlag: pp. 119-145, 2001.

Korovina, M.; Kudinov, O.: Semantic Characterisations of Second-Order Computability over the Real Numbers. In: European Association for Computer Science Logic. 15th International Workshop, CSL '01.Fribourg, L. (Ed.). Paris, France, September 10-13, 2001. 2142 ofLecture Notes in Computer Science. Springer-Verlag, Berlin: pp.160-173, 2001.

Korovina, M.; Oleg, K.: Generalised Computability and Applications to Hybrid Systems. In: 4th International Andrei Ershov Memorial Conference, PSI2001.Bjørner, D.; Broy, M.; Zamulin, A.V. (Eds.). Akademgorodok,Novosibirsk, Russia, July 2-6, 2001. 2244 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 494-500, 2001.

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

Krink, T.; Ursem, R.K.; Filipic, B.: Evolutionary Algorithms in Control Optimization. The Greenhouse Problem. In: Third Genetic and Evolutionary Computation Conference.Spector, L.; Goodman, E.D.; Wu, A.; Langdon, W.B.; Voigt, H.; Gen, M.;Sen, S.; Dorio, M.; Pezeshk, S.; Garzon, M.H.; Burke, E. (Eds.).GECCO-2001: pp. 440-447, 2001.

Larsen, K.G.; Behrmann, G.; Brinksma, E.; Fehnker, A.; Hune, T.S.;Pettersson, P.; Judi, R.: As Cheap as Possible. Efficient Cost-optimalReachability for Priced Timed Automata. In: Computer Aided Verification, 2001.

Lindstrøm, B.; Haider, S.: Equivalent Coloured Petri Net Models of a Class of Timed Influence Nets with Logic. In: Proc. of the Third Workshop and Tutorial on Practical use of Coloured Petri Nets and the CPN Tools.Jensen, K. (Ed.). CPN'01, August 29-31, University of Aarhus. DAIMIPB-554. Department of Computer Science, Århus: pp. 35-55, 2001.

Lorentsen, L.; Kristensen, L.M.: Exploiting Stabilizers and Parallelism in State Space Generation with the Symmetry Method. In: Proc. of the Second International Conference on Application of Concurrency to System Design. ICACSD'01, June 22-29, Newcastle upon Tyne, UK. IEEE: pp. 211-220, 2001.

Lorentsen, L.; Tuovinen, A.-P.; Xu, J.: Modelling FeatureInteraction Patterns in Nokia Mobile Phones using Coloured Petri Netsand Design/CPN. In: Proc. of the Third Workshop on Practical Use of Coloured Petri Nets and the CPN Tools.Jensen, K. (Ed.). CPN'01, August 29-31, University of Aarhus. DAIMIPB-554. Department of Computer Science, Århus: pp. 1-15, 2001.

Lyngsø, R.B.; Pedersen, C.N.S.: Complexity of Comparing Hidden Markov Models. In: 12th International Symposium on Algorithms and Computation, ISAAC '01.Eades, P.; Takaoka, T. (Eds.). Christchurch, New Zealand, December19-21, 2001. 2223 of Lecture Notes in Computer Science.Springer-Verlag, Berlin: pp. 416-428, 2001.

MacIntyre, B.; Mynatt, E.D.; Voida, S.; Hansen, K.M.; Tullio, J.;Corso, G.: Support for Multitasking and background Awareness UsingInteractive Peripheral Displays. In: Proc. of the 14th ACM Symposium on User Interface Software and Technology. UIST'2001, November 11-14, Orlando, Florida, USA. ACM: pp. 41-50, 2001.

Miltersen, P.B.: Derandomizing complexity classes. In: Handbook on Randomized Computing. Rajasekaran, S.; Pardalos, P.M.; Reif, J.H.; Rolim, J.D.P. (Eds.). Volume II, chapter 19. Kluwer Academic Publishers, 2001.

Mortensen, K.H.: Efficient Data-Structures and Algorithms for a Coloured Petri Nets Simulator. In: Proc. of the Third Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools. Jensen, K. (Ed.). 29-31 August, University of Aarhus. DAIMI PB-554. Department of Computer Science, Århus: pp. 57-75, 2001.

Mosses, P.D.: The Varieties of Programming Language Semantics (and Their Uses). In: 4th International Andrei Ershov Memorial Conference, PSI2001.Bjørner, D.; Broy, M.; Zamulin, A.V. (Eds.). Akademgorodok,Novosibirsk, Russia, July 2-6, 2001. 2244 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 165-190, 2001.

Möller, M.O.; Alur, R.: Heuristics for Hierarchical Partitioning with Application to Model Checking. In: Correct Hardware Design and Verification Methods, 11th IFIP WG 10.5 Advanced Research Working Conference, CHARME '01.Margaria, T.; Melham, T. (Eds.). Livingston, Scotland, UK, September4-7, 2001. 2144 of Lecture Notes in Computer Science. Springer-Verlag,Berlin: pp. 71-85, 2001.

Møller, A.; Schwartzbach, M.I.: The Pointer Assertion Logic Engine. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '01. Snowbird, Utah, USA, June 20-22, 2001. ACM Press, 2001.

Nielsen, M.: Modelling with Partial Orders - Why and Why Not? In: 27th International Colloquium on Automata, Languages, and Programming, ICALP '01.Orejas, F.; Spirakis, P.; Leeuwen, J.v. (Eds.). Crete, Greece, July18-12, 2001. 2076 of Lecture Notes in Computer Science.Springer-Verlag: pp. 61-63, 2001.

Nielsen, M.; Sassone, V.; Srba, J.: Properties of Distributed Timed-Arc Petri Nets. In: Foundations of Software Technology and Theoretical Computer Science. 21st Conference, FST&TCS '00.Hariharan, R.; Mukund, M.; Vinay, V. (Eds.). Bangalore, India, December13-15, 2001. 2245 of Lecture Notes in Computer Science.Springer-Verlag: pp. 280-291, 2001.

Nielsen, M.; Sassone, V.; Srba, J.: Towards a Notion of Distributed Time for Petri Nets. In: 22nd International Conference on Application and Theory of Petri Nets, ICATPN '01.Colom, J.; Koutny, M. (Eds.). Newcastle upon Tyne, UK, June 25-29,2001A. 2075 of Lecture Notes in Computer Science. Springer-Verlag,Berlin: pp. 23-31, 2001.

O'Hearn, P.W.; Reynolds, J.C.; Yang, H.: Local Reasoning about Programs that Alter Data Structures. In: European Association for Computer Science Logic. 15th International Workshop, CSL '01.Fribourg, L. (Ed.). Paris, France, September 10-13, 2001. 2142 ofLecture Notes in Computer Science. Springer-Verlag, Berlin: pp. 1-19,2001.

Oliva, P.B.; Kohlenbach, U.: Proof Mining in L1-Approximation. In: 3rd International Workshop on Implicit Computational Complexity, ICC '01. Hofmann, M. (Ed.). Aarhus, Denmark, May 20-21, 2001. NS-01-3 of Notes Series. Aarhus: pp. 117-122, 2001.

Pagh, R.: On the Cell Probe Complexity of Membership and Perfect Hashing. In: The Thirty-Third Annual ACM Symposium on Theory of Computing, STOC '01. Yannakakis, M. (Ed.). Crete, Greece, July 6-8, 2001. ACM Press, New York: pp. 425-432, 2001.

Pagh, R.; Rodler, F.F.: Cuckoo Hashing. In: 9th Annual European Symposiumon on Algorithms, ESA '01.Meyer auf der Heide, F. (Ed.). Aarhus Denmark, August 28-31, 2001. 2161of Lecture Notes in Computer Science. Springer-Verlag: pp. 121-133,2001.

Pagh, R.; Rodler, F.F.: Lossy Dictionaries. In: 9th Annual European Symposiumon on Algorithms, ESA '01.Meyer auf der Heide, F. (Ed.). Aarhus Denmark, August 28-31, 2001. 2161of Lecture Notes in Computer Science. Springer-Verlag: pp. 300-311,2001.

Reynolds, J.C.: What do Types Mean? From Intrinsic to ExtrinsicSemantics. This is a shorter version of BRICS report RS-00-32describing a more limited language. In: Essays on Programming Methodology. McIver, A.; Morgan, C. (Eds.). Springer-Verlag, New York, 2001.

Sandvad, E.S.; Grønbæk, K.; Sloth, L.; Knudsen, J.L.: A Metro MapMetaphor for Guided Tours on the Web. The Webwise Guided Tour System.In: Proc. of the Tenth International World Wide Web Conference. WWW'01, May 1-5, Hong Kong. ACM, New York: pp. 326-333, 2001.

Santocanale, L.: F-Bicomplete Categories and Parity Functors. In: Fixed Point in Computer Science, Abstracts of the Talks. Labella, A. (Ed.), 2001.

Santocanale, L.: On the Equational Definition of the Least Prefixed Point. In: Mathematical Foundations of Computer Science. 26th International Symposium, MFCS '00.Sgall, J.; Pultr, A.; Kolman, P. (Eds.). Mariánské Lázne, CzechRepublic, August 27-31, 2001. 2136 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin: pp. 645-656, 2001.

Schultz, U.P.: Partial Evaluation for Class-Based Object-Oriented Languages. In: Symposium on Programs as Data Objects II.Danvy, O.; Filinski, A. (Eds.). PADO-II, May 20-23, University ofAarhus. 2053 of Lecture Notes in Computer Science. Springer-Verlag: pp.173-197, 2001.

Srba, J.: On the Power of Labels in Transition Systems. In: Concurrency Theory. 12th International Conference, CONCUR '01.Larsen, K.G.; Nielsen, M. (Eds.). Aalborg, Denmark, August 21-24, 2001.2154 of Lecture Notes in Computer Science. Springer-Verlag, Berlin: pp.277-291, 2001.

Brodal, G.S.; Fagerberg, R.; Pedersen, C.N.S.; Östlin, A.: TheComplexity of Constructing Evolutionary Trees Using Experiments. In: 27th International Colloquium on Automata, Languages, and Programming, ICALP '01.Orejas, F.; Spirakis, P.; Leeuwen, J.v. (Eds.). Crete, Greece, July18-12, 2001. 2076 of Lecture Notes in Computer Science.Springer-Verlag: pp. 140-151, 2001.

Toman, D.: Expiration of Historical Databases. In: Proc. of the International Symposium on Temporal Representation and Reasoning. TIME 2001, Cividale del Friuli, Italien: pp. 128-135, 2001.

Toman, D.; Bowman, I.T.: Optimizing Temporal Queries: Efficient Handling of Duplicates. In: Proc. of the International Symposium on Temporal Representation and Reasoning. TIME 2001, Cividale del Friuli, Italien: pp. 93-100, 2001.

Toman, D.; Khizder, L.; Weddel, G.: On Decidability and Complexity of Description Logics with Uniqueness Constraints. In: Proc. of the 8th International Conference on Database Theory. ICDT'01, January 4-6, London, UK. 1973 of Lecture Notes in Computer Science. Springer-Verlag: pp. 54-67, 2001.

Toman, D.; Weddel, G.: On Attributes, Roles, and Dependencies inDescription Logics and the Ackermann Case of the Decision Problem. In: Proc. 3rd International Workshop on Description Logics. DL2001, August 1-3, Stanford, USA: pp. 76-85, 2001.

Toman, D.; Weddel, G.: Query Processing in Embedded Control Programs. In: Proc. of Databases in Telecommunications II.Jonker, W. (Ed.). VLDB 2001, September 10, Rome, Italy. 2209 of LectureNotes in Computer Science. Springer-Verlag: pp. 68-87, 2001.

Ursem, R.K.: When Sharing Fails. In: Third Congress on Evolutionary Computation. CEC-2001: pp. 873-879, 2001.

Wells, L.; Christensen, S.; Kristensen, L.M.; Mortensen, K.H.: Simulation Based Performance Analysis of Web Servers. In: Proc. of the 9th International Workshop on Petri Nets and Performance Models. German, R.; Haverkort, B. (Eds.). September 11-14, Aachen, Germany. IEEE Computer Society: pp. 59-68, 2001.

Zellweger, P.T.; Bouvin, N.O.; Jehøj, H.; Mackinlay, J.D.: Fluid Annotations in a Open World. In: Proc. of the 12th ACM Conference on Hypertext and Hypermedia. Hypertext'01, August 14-18, 2001, University of Aarhus: pp. 9-18, 2001.

Artikler i internationale tidsskrifter

Bach, L.A.; Bentzen, S.; Alsner, J.; Christiansen, F.B.: Anevolutionary-game model of tumour-cell interactions: possible relevanceto gene therapy. European Journal of Cancer; 37: 2116-2120, 2001.

Bang-Jensen, J.; Yeo, A.: The minimum spanning strong subdigraphproblem for extended semicomplete digraphs and semicomplete bipartitedigraphs. J. Algorithms; 41: 1-19, 2001.

Berg, A.R.; Jackson, B.; Jordan, T.: Edge splitting and connectivity augmentation in directed hypergraphs. Technical report of The Egerváry Research Group on Combinatorial Optimization, Budapest; (TR-2001-16), 2001.

Berg, A.R.; Jackson, B.; Jordan, T.: Highly edge-connected detachments of graphs and digraphs. Technical Report of The Egerváry Research Group on Combinatorial Optimization, Budapest; (TR-2001-14), 2001.

Berg, A.R.; Jordan, T.: A proof of Connelly's conjecture on 3-connected generic cycles. Technical report of The Egerváry Research Group on Combinatorial Optimization, Budapest; (TR-2001-08), 2001.

Brodal, G.S.; Pinotti, M.C.: Comparator Networks for Binary Heap Construction. Theoretical Computer Science; 250(1-2): 235-245, 2001.

Bødker, S.; Krogh, P.; Petersen, M.G.: The interactive design collaboratorium. Human Computer Interaction: 51-58, 2001.

Büscher, M.; Gill, S.; Mogensen, P.; Shapiro, D.: Landscapes of Practice. The Journal of Collaborative Computing; 10(1): 1-28, 2001.

Büscher, M.; Krogh, P.; Mogensen, P.; Shapiro, D.: Vision on the move - technologies for the footloose. ApplianceDesign; 1(1): 11-14, 2001.

Cryan, M.; Goldberg, L.A.; Goldberg, P.W.: Evolutionary Trees can beLearned in Polynomial-Time in the Two-State General Markov Model. SIAM Journal on Computing; 32(2): 375-397, 2001.

Danvy, O.; Grobauer, B.; Rhiger, M.: A Unifying Approach to Goal-Directed Evaluation. New Generation Computing; 20(1), 2001.

Frandsen, G.S.; Hansen, J.P.; Miltersen, P.B.: Lower Bounds forDynamic Algebraic Problems. Also availabe as BRICS Report RS-98-11. Information and Computation; 171: 333-349, 2001.

Frank, A.; Jordan, T.; Szigeti, Z.: An orientation theorem with parity conditions. Discrete Applied Mathematics; 115: 37-47, 2001.

Gabow, H.N.; Jordan, T.: Bipartition constrained edge-splitting in directed graphs. Discrete Applied Mathematics; 115: 49-62, 2001.

Glover, F.; Gutin, G.; Yeo, A.; Zverovich, A.: Construction heuristics for the asymmetric TSP. European Journal of Operational Research; 129: 555-568, 2001.

Grobauer, B.; Yang, Z.: The Second Futamura Projection forType-Directed Partial Evaluation. Also availabe as BRICS ReportRS-00-44. Higher-Order and Symbolic Computation; 14(2-3): 173-219, 2001.

Gutin, G.; Yeo, A.: Remarks on hamiltonian digraphs. Australasian J. Combinatorics; 23: 115-118, 2001.

Gutin, G.; Yeo, A.: Solution of a conjecture of Volkman on thenumber of vertices in longest paths and cycles of strong semicompletemultipartite digraphs. Graphs and Combinatorics; 17(3): 473-477, 2001.

Gutin, G.; Yeo, A.: TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Letters; 28(3): 107-111, 2001.

Hagerup, T.; Miltersen, P.B.; Pagh, R.: Deterministic Dictionaries. Journal of Algorithms; 41: 69-85, 2001.

Hagerup, T.; Miltersen, P.B.; Pagh, R.: Deterministic dictionaries. J. Algorithms; 41(1): 69-85, 2001.

Jensen, M.T.: Improving Robustness and Flexibility of Tardiness and Total Flowtime Job Shops using Robustness Measures. Journal of Applied Soft Computing; 1(1): 35-52, 2001.

Kirchner, H.; Mosses, P.D.: Algebraic Specifications, Higher-order Types and Set-theoretic Models. Journal of Logic and Computation; 11(3): 453-481, 2001.

Kohlenbach, U.: A Note on Spector's Quantifier-Free Rule of Extensionality. Also availabe as BRICS Report RS-99-20. Archive for Mathematical Logic; 40: 89-92, 2001.

Kohlenbach, U.: A Quantitative Version of a Theorem due to Borwein-Reich-Shafrir. Numerical Functional Analysis and Optimization; 22(5&6): 641-656, 2001.

Kohlenbach, U.: Intuitionistic Choice and Restricted Classical Logic. Also availabe as BRICS Report RS-00-12. Mathemtical Logic Quaterly; 47(4): 455-460, 2001.

Krogh, P.G.; Grønbæk, K.: Architecture and pervasive Computing when buildings and design artifacts become popular interfaces. Nordic Journal of Architectural Research; (3): 11-22, 2001.

Lindstrøm, B.: Web-Based Interfaces for Simulators of Colored Petri Net Models. International Journal on Software Tools for Technology Transfer; 3(4): 405-416, 2001.

Nielsen, E.E.; Hansen, M.M.; Bach, L.A.: Looking for a needle in ahaystack. Discovery of indigenous Atlantic salmon (Salmo salar L.) instocked populations. Conservation Genetics; 2(3): 219-232, 2001.

Nielsen, P.; Schori, C.; Sørensen, J.; Salvail, L.; Damgård, I.;Polzik, E.: Experimental Quantum key Distribution with Proven SecurityAgainst Realistic Attacks. www.cki.au.dk/experiment/qrypto/doc. Journal of Modern Optics, London; 48(13): 1921-1942, 2001.

Pagh, R.: Low Redundancy in Static Dictionaries with Constant Query Time. SIAM Journal on Computing; 31: 353-363, 2001.

Sviridenko, M.I.: Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. Algorithmica; 30(3): 398-405, 2001.

Toman, D.; Chomicki, J.; Böhlen, M.H.: Querying ATSQL Databases with Temporal Logic. ACM Transactions on Database Systems; 26(2): 145-178, 2001.

Walukiewicz, I.: Pushdown Processes. Games and Model Checking. Also availabe as BRICS Report RS-96-54. Information and Computation; 164: 234-263, 2001.

Artikler i danske tidsskrifter

Alstrup, S.; Brodal, G.S.; Gørtz, I.L.; Rauhe, T.: Time and Space Efficient Multi-Method Dispatching. Technical Report; (ITU-TR-2001-8): 13, 2001.

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

Boschi, G.: Smart MIDI Interface Project Description. DAIMI IR, Department of Computer Science, University of Aarhus; (131): 12, 2001.

Brabrand, C.; Møller, A.; Olesen, S.; Schwartzbach, M.I.: Language-Based Caching of Dynamically Generated HTML. BRICS Research Series, Aarhus; (RS-01-17): 18, 2001.

Brodal, G.S.; Fagerberg, R.; Jacob, R.: Cache Oblivious Search Trees via Binary Trees of Small Height. BRICS Research Series, Aarhus; (RS-01-36): 20, 2001.

Brodal, G.S.; Jacob, R.: Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Technical Report; (ALCOMFT-TR-01-176): 12, 2001.

Cramer, R.; Shoup, V.: Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. BRICS Research Series, Aarhus; (RS-01-37): 34, 2001.

Damgård, I.B.; Frandsen, G.S.: An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. BRICS Research Series, Aarhus; (RS-01-45): 43, 2001.

Damgård, I.B.; Nielsen, J.B.: From Known-Plaintext Security to Chosen-Plaintext Security. BRICS Research Series, Aarhus; (RS-01-43): 18, 2001.

Damgård, I.B.; Nielsen, J.B.: Perfect Hiding and Perfect BindingUniversally Composable Commitment Schemes with Constant ExpansionFactor. BRICS Research Series, Aarhus; (RS-01-41): 43, 2001.

Damian, D.; Danvy, O.: A Simple CPS Transformation of Control-Flow Information. BRICS Research Series, Aarhus; (RS-01-55), 2001.

Damian, D.; Danvy, O.: CPS Transformation of Flow Information, Part II. Administrative Reductions. BRICS Research Series, Aarhus; (RS-01-40): 9, 2001.

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

Danvy, O.; Goldberg, M.: There and Back Again. BRICS Research Series, Aarhus; (RS-01-39): 14, 2001.

Danvy, O.; Nielsen, L.R.: A First-Order One-Pass CPS Transformation. BRICS Research Series, Aarhus; (RS-01-49): 21, 2001.

Danvy, O.; Nielsen, L.R.: Defunctionalization at Work. BRICS Research Series, Aarhus; (RS-01-23): 45, 2001.

Danvy, O.; Nielsen, L.R.: Syntactic Theories in Practice. BRICS Research Series, Aarhus; (RS-01-31): 37, 2001.

Danvy, O.; Rhiger, M.; Rose, K.H.: Normalization by Evaluation with Typed Abstract Syntax. BRICS Research Series, Aarhus; (RS-01-16): 9, 2001.

David, A.; Möller, M.O.: From HUppaal to Uppaal. A Translation from Hierarchical Timed Automata to Flat Timed Automata. BRICS Research Series, Aarhus; (RS-01-11): 40, 2001.

Fridlender, D.; Indrika, M.: Do we Need Dependent Types? BRICS Research Series, Aarhus; (RS-01-10): 6, 2001.

Goldberg, M.: A General Schema for Constructing One-Point Bases in the Lambda Calculus. BRICS Research Series, Aarhus; (RS-01-35): 6, 2001.

Groth, J.: Extracting Witnesses from Proofs of Knowledge in the Random Oracle Model. BRICS Research Series, Aarhus; (RS-01-52): 23, 2001.

Gutin, G.; Koh, K.M.; Tay, E.G.; Yeo, A.: On the Number of Quasi-Kernels in Digraphs. BRICS Research Series, Aarhus; (RS-01-7): 11, 2001.

Gutin, G.; Yeo, A.; Zverovich, A.: Traveling Salesman Should not beGreedy. Domination Analysis of Greedy-Type Heuristics for the TSP. BRICS Research Series, Aarhus; (RS-01-6): 7, 2001.

Hangos, K.M.; Tuza, Z.; Yeo, A.: Some Complexity Problems on Single Input Double Output Controllers. BRICS Research Series, Aarhus; (RS-01-18): 27, 2001.

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

Kohlenbach, U.: On Weak Markov's Principle. BRICS Research Series, Aarhus; (RS-01-51): 10, 2001.

Kohlenbach, U.; Oliva, P.B.: Effective Bounds on Strong Unicity in L1-Approximation. BRICS Research Series, Aarhus; (RS-01-14): 38, 2001.

Kristiansen, L.: The Implicit Computational Complexity of Imperative Programming Languages. BRICS Research Series, Aarhus; (RS-01-46): 46, 2001.

Möller, M.O.; Rueß, H.; Sorea, M.: Predicate Abstraction for Dense Real-Time Systems. BRICS Research Series, Aarhus; (RS-01-44): 27, 2001.

Møller, A.; Schwartzbach, M.I.: The XML Revolution (Revised). BRICS Notes Series, Aarhus; (NS-01-8): 186, 2001.

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

Nielsen, L.R.: A Selective CPS Transformation. BRICS Research Series, Aarhus; (RS-01-30): 24, 2001.

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

Pagh, R.; Pagter, J.: Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. BRICS Research Series, Aarhus; (RS-01-2): ii+20, 2001.

Palamidessi, C.; Valencia, F.D.: A Temporal Concurrent Constraint Programming Calculus. BRICS Research Series, Aarhus; (RS-01-20): 31, 2001.

Rodler, F.F.; Pagh, R.: Fast Random Access to Wavelet Compressed Volumetric Data Using Hashing. BRICS Research Series, Aarhus; (RS-01-34): 31, 2001.

Santocanale, L.: A Calculus of Circular Proofs and its Categorical Semantics. BRICS Research Series, Aarhus; (RS-01-15): 30, 2001.

Srba, J.: Note on the Tableau Technique for Commutative Transition Systems. BRICS Research Series, Aarhus; (RS-01-50): 19, 2001.

Tuza, Z.: Unsolved Combinatorial Problems, Part I. BRICS Lecture Series, Aarhus; (LS-01-1): viii+30, 2001.

Konferencebidrag, arbejdspapirer

Grønbæk, K.; Krogh, P.; Kyng, M.: Intelligent Buildings and pervasive computing - research perspectives and discussions. In: Proc. of Conference on Architectural Research and Information Technology. April 27-29, Århus School of Architecture. Nordic Association for Architectural Research, Århus: pp. 33-40, 2001.

Jensen, M.T.: A Remark on Solving Minimax Problems with Coevolution. In: Proc. of the Genetic and Evolutionary Computation Conference. Spector, L.et al. (Ed.). GECCO 2001, July 7-11, San Francisco, USA. Morgan Kaufmann: pp. 769, 2001.

Krogh, P.; Grønbæk, K.: Roomware and Intelligent Buildings - objects and buildings become computer interfaces. In: Proc. of Conference on Architectural Research and Information Technology. April 27-29, Århus School of Architecture. Nordic Association for Architectural Research, Århus: pp. 63-68, 2001.

Anden forskningsformidling

Bardram, J.; Christensen, H.B.: The future of Medical Work. 2 video-prototypes for Pervasive Healthcare, 2001.

Hansen, K.M.; MacIntyre, B.; Mynatt, E.D.; Tullio, J.; Voida, S.: Hypermediain the Kimura System. Using Spacial, Temporal and NavigationalRelationships to Support Multitasking and Background Awareness. Poster presentation. Hypertext'01, August 14-18, 2001, University of Aarhus, 2001.

MacIntyre, B.; Mynatt, E.D.; Voida, S.; Hansen, K.M.; Tullio, J.; Corso, G.: The Kimura System. Video companion to poster presentation. Hypertext'01, August 14-18, 2001, University of Aarhus, 2001.

Mogensen, P.: Interactive Workspaces. Demo. Nordic Interactive Conference, October 31-November 3, 2001, Copenhagen, 2001.

Mogensen, P.: Open 3D spatial Hypermedia as Roomware Components for Interactive Workspaces. Demo. The 12th ACM Conference on Hypertext and Hypermedia, August 14-18, 2001, University of Aarhus, 2001.

Mogensen, P.: Workspace - distributed work support through spatial computing environments. Demo. EU, Disappearing Computer Jamboree, October 18-19, Zürich, Switzerland, 2001.

Schultz, U.P.: Object-oriented program specialization: Aspects into Aspects - or maybe not? Position paper. Workshop on Generative Programming, ECOOP'2001, Budapest, Ungarn, 2001.

Redaktionsarbejde

Bertelsen, O.W.: Proceedings of the First Danish Human-Computer Interaction Research Symposium. November 27, University of Aarhus. DAIMI PB-555. Department of Computer Science, Århus, 2001.

Brodal, G.S.; Frigioni, D.; Marchetti-Spaccamela, A.: Algorithm Engineering, 5th International Workshop, WAE '01. Aarhus Denmark, August 28-31, 2001. 2041 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.

Danvy, O.; Filinski, A.: Second Symposium, PADO '01. Aarhus, Denmark, May 21-23, 2001. 2053 of Lecture Notes in Computer Science. Springer, Aarhus, Denmark, 2001.

Jensen, K.: Int. Journal on Software Tools for Technology Transfer. Special Section on Practical Use of High-level Petri Nets. 3/4. Springer-Verlag, 2001.

Jensen, K.: Proceedings of the Third Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools. August 29-31, University of Aarhus. DAIMI PB-554. Department of Computer Science, Århus, 2001.

Larsen, K.G.; Nielsen, M.: Concurrency Theory. 12th International Conference, CONCUR '01. Aalborg, Denmark, August 21-24, 2001. 2154 of Lecture Notes in Computer Science. Springer Verlag, 2001.

Lund, H.H.; Mayoh, B.; Perram, J.: Seventh Scandinavian Conference on Artificial Intelligence.SCAI'01, February 20-21, The Maersk Mc-Kinney Moller Institute forProduction Technology, University of Southern Denmark. 66. IOS Press,Amsterdam, 2001.

Moldt, D.: Workshop on Modelling of Objects, Components, and Agents. August 27-28, University of Aarhus. DAIMI PB-553. Department of Computer Science, Århus, 2001.

Nielsen, M.: Current Trends in Theoretical Computer Science Entering the 21st Century. Concurrency. World Scientific, 2001.

Ursem, R.K., Collection of student reports: Topics of Evolutionary Computation 2001. DAIMI IR-132. EVALife, Department of Computer Science, University of Aarhus, Århus, 2001.

• Afrati, F.; Bampis, E.; Chekuri, C.; Karger, D.; Kenyon, C.; Khanna, S.; Milis, I.; Queyranne, M.; Skutella, M.; Stein, C.; Sviridenko, M.: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. Procedings of FOCS99. IEEE Computer Society; New York City: 32-43, 1999.
• Agarwal, P.; Arge, L.; Brodal, G.S.; Vitter, J.S.: I/O-Efficient Dynamic Point Location in Monotone Subdivisions. The Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA '99), San Antonio, Texas, USA, March 22-24, 1999. ACM Press; 11-20, 1999.
• Ageev, A.A.; Sviridenko, M.I.: An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. RS-99-49. BRICS, Basic Research in Computer Science, Aarhus: 12 pages, 1999.
• Alon, N.; Dietzfelbinger, M.; Miltersen, P.B.; Petrank, E.; Tardos, G.: Linear Hashing. Journal of the ACM; 46(5): 667-683, 1999.
• Alstrup, S.; Ben-Amram, A.; Rauhe, T.: Worst-case and Amortised Optimality in Union-Find. The Thirty-First Annual ACM Symposium on Theory of Computing (STOC'99), Atlanta, Georgia, USA, May 1-4, 1999. ACM Press; 499-506, 1999.
• Amadio, R.M.; Prasad, S.: The Game of the Name in Cryptographic Tables. ASIAN'99, Advances in Computing Science, Phuket, December 10-12, 1999. Lecture Notes in Computer Science; Springer-Verlag, (1742): 15-26, 1999.
• Amtoft, T.: Partial Evaluation for Designing Efficient Algorithms. A Case Study. RS-99-45. BRICS, Basic Research in Computer Science, Aarhus, 1999.
• Amtoft, T.; Nielson, F.; Nielson, H.R.: Type and Effect Systems. Behaviours for Concurrency. Imperial College Press, 1999.
• Amtoft, T.; Nielson, H.R.; Nielson, F.: Behaviour Analysis for Validating Communication Patterns. Springer International Journal on Software Tools for Technology Transfer; 2, 1998(1): 13-28, 1999.
• Andersson, A.; Miltersen, P.B.; Thorup, M.: Fusion Trees Can Be Implemented with AC0 Instructions Only. Theoretical Computer Science; 215(1-2): 337-344, 1999.
• Arge, L.; Samoladas, V.; Vitter, J.S.: On Two-Dimensional Indexability and Optimal Range Search Indexing. The Eighteenth Annual ACM Symposium on Principles of Database Systems; The conference is held jointly with the SIGMOD International Conference on Management of Data (PODS'99), Philadelphia, PA, USA, May 31- June 2, 1999. ACM Press; 1999.
• Arvind, V.; Variyam, V.N.; Subrahmanyam, K.V.: The Query Complexity of Program Checking by Constant-Depth Circuits. 10th International Symposium on Algorithms and Computation (ISAAC'99), Chennai, India, December 13-15, 1999. Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1741: 123-132, 1999.
• Asklund, U.; Bendix, L.; Christensen, H.B.; Magnusson, B.: The Unified Extensional Versioning Model. System Configuration Management (SCM-9), Toulouse, Frankrig, September 1999. Lecture Notes in Computer Science; Estublier, J. (Ed.), Springer Verlag, 1675: 100-122, 1999.
• Baeck, T.; Fogel, D.; Michalewicz, Z.: Evolutionary Computation: Advanced Algorithms and Operators. Institute of Physics, London, 1999.
• Baeck, T.; Fogel, D.; Michalewicz, Z.: Evolutionary Computation: Basic Algorithms and Operators. Institute of Physics, London, 1999.
• Bang-Jensen, J.; Gabow, H.N.; Jordán, T.; Szigeti, Z.: Edge-connectivity augmentation with partition constraints SIAM. J. Discrete Mathematics; 12(2): 160-207, 1999.
• Bang-Jensen, J.; Guo, Y.; Yeo, A.: A New Sufficient Condition for a Digraph to be Hamiltonian. Discrete Applied Mathematics; 95(1-3): 61-72, 1999.
• Beaudouin-Lafon, M.: Computer-Supported Co-operative Work Trends in Software. John Wiley & Sons, Chichester, 1999: 258 pages, 1999.
• Beaudouin-Lafon, M.: Moins d'interface pour plus d'interaction. L'interface homme-machine dans la création musicale. Vinet, H.; Delalande, F. (Eds.), Hermès, Paris: 123-141, 1999.
• Bertelsen, O.W.: From shading to scripting - from retouchig to rendering. Digitalt Solskin, Digital Sunshine (Udstillingskatalog); Jürgensen, A. (Ed.), Kunsthallen Brandts Klædefabrik, 1999.
• Bertelsen, O.W.: Mediation and Heterogeneity in Design. Position statement for Conference on Social Thinking - Software Practice. Schloss Dagstuhl, Tyskland, September 1999. 6, 1999.
• Bertelsen, O.W.; Nielsen, C.: Augmenting reality in mobile substrates. On the design of computer support for process control. Proceedings of the 22nd Information Systems Research Seminar in Scandinavia. Jyväskylä, Finland. Jyväskylä University Printing House; Käkslä, T.K. (Ed.),: 123-134, 1999.
• Bertelsen, O.W.; Nielsen, C.: Dynamics in Wastewater Treatment. A Framework for Understanding Formal Constructs in Complex Technical Settings. Proceedings of The Sixth European Conference on Computer Supported Cooperative Work (ECSCW'99), København, September 12-16, 1999. Kluwer Academic Press; Bødker, S.; Kyng, M.; Schmidt, K. (Eds.), London: 277-290, 1999.
• Bodei, C.; Degano, P.; Nielson, F.; Nielson, H.R.: Static Analysis of Processes for No Read-Up and No Write-Down. Proc. FOSSACS'99. Lecture Notes in Computer Science; Springer-Verlag, 1578: 120-134, 1999.
• Brabrand, C.; Møller, A.; Sandholm, A.; Schwartzbach, M.I.: A Runtime System for Interactive Web Services. 8th International World Wide Web Conference, Toronto, Canada, May 11-14, 1999. Elsevier Computer Networks; 31: 1391-1401, 1999.
• Bradfield, J.C.: Fixpoint alternation and the game quantifier. Computer Science Logic 1999, Madrid, September 1999. Lecture Notes in Computer Science; Springer-Verlag, 1683: 350-361, 1999.
• Bradfield, J.C.: Fixpoint alternation: arithmetic, transition systems, and the binary tree. Theoretical Informatics and Applications; 33: 341-356, 1999.
• Bradfield, J.C.; Stevens, P.: Observational Mu-Calculus. RS-99-5. BRICS, Basic Research in Computer Science, Aarhus: 18 pages, 1999.
• Brodal, G.S.: Priority Queues on Parallel Machines. Parallel Computing; 25(8): 987-1011, 1999.
• Brodal, G.S.; Fagerberg, R.: Dynamic Representations of Sparse Graphs. Algorithms and Data Structures: 6th International Workshop (WADS'99), Vancouver, British Columbia, Canada, August 12-14, 1999. Lecture Notes in Computer Science; Springer-Verlag, 1663: 342-351, 1999.
• Brodal, G.S.; Lyngsø, R.B.; Pedersen, C.N.S.; Stoye, J.: Finding Maximal Pairs with Bounded Gap. Combinatorial Pattern Matching: 10th Annual Symposium (CPM'99), Warwick, Coventry, United Kingdom, July 22-24, 1999. Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1645: 134-149, 1999.
• Brodal, G.S.; Pedersen, C.N.S.: Finding Maximal Quasiperiodicities in Strings. RS-99-25. BRICS, Basic Research in Computer Science, Aarhus: 20 pages, 1999.
• Brodal, G.S.; Venkatesh, S.: Improved Bounds for Dictionary Look-up with One Error. RS-99-50. BRICS, Basic Research in Computer Science, Aarhus: 5 pages, 1999.
• Bruni, R.; Meseguer, J.; Montanari, U.; Sassone, V.: Functorial Semantics for Petri Nets Under the Individual Token Philosophy. Category Theory and Computer Science: 8th International Conference (CTCS'99), Edinburgh, Scotland, September 10-12, 1999. Electronic Notes in Theoretical Computer Science; Elsevier Science, 29: 18, 1999.
• Bucka-Lassen, K.; Caprani, O.; Hein, J.: Combining many multiple alignments in one improved alignment. Bioinformatics; 15(2): 122-130, 1999.
• Buhrman, H.; van Dam, W.; Høyer, P.; Tapp, A.: Multiparty Quantum Communication Complexity. Physical Review; 60(4): 2737-2741, 1999.
• Buss, J.F.; Frandsen, G.S.; Shallit, J.O.: The Computational Complexity of Some Problems of Linear Algebra. Journal of Computer and System Sciences; 58(3): 572-596, 1999.
• Butz, C.: A Topological Completeness Theorem Archive for Mathematical Logic. 38(2): 79-101, 1999.
• Büscher, M.; Mogensen, P.; Shapiro, D.; Wagner, I.: Spaces for Creating Context and Awareness - designing a Collaborative Virtual Workspace. Human-Computer Interaction: Communication, Cooperation, and Application Design.. Proceedings of HCI International '99, Munich, Germany. Lawrence Erlbaum Associates; Bullinger, H.J.; Ziegler, J. (Eds.), London: 283-287, 1999.
• Büscher, M.; Mogensen, P.; Shapiro, D.; Wagner, I.: The Manufaktur: Supporting Work Practice in (Landscape) Architecture. Proceedings of The Sixth European Conference on Computer Supported Cooperative Work. Copenhagen, Denmark. Kluwer Academic Press; Kyng, M.; Bødker, S.; Schmidt, K. (Eds.),: 21-40, 1999.
• Bødker, S.: Scenarios - setting the stage for reflection and action in user-centered design, Interacting with Computers. CD-ROM. Thirty-Second Annual Hawaii International Conference on System Sciences, Maui, Hawaii, January 1999. IEEE Computer Society, 1999.
• Bødker, S.; Grønbæk, K.: Multimedia. Interdisciplinary challenges to design Scandinavian. Journal of Information Systems; 10(1-2, 1998): 219-226, 1999.
• Bødker, S.; Kyng, M.; Schmidt, K.: Proceedings of The Sixth European Conference on Computer Supported Cooperative Work, ECSCW 99. Kluwer: 451 pages, 1999.
• Camenisch, J.; Michels, M.: Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes. Advances in Cryptology: International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'99), Prague, Czech Republic, May 2-6, 1999. Lecture Notes in Computer Science; Springer-Verlag, 1592: 106-121, 1999.
• Camenisch, J.; Michels, M.: Separability and Efficiency for Generic Group Signature Scheme. Advances in Cryptology (CRYPTO '99). Lecture Notes in Computer Science; Wiener, M. (Ed.), Springer Verlag, 1666: 413-430, 1999.
• Casalta, D.; Guiard Y.; Beaudouin-Lafon, M.: Evaluating Two-Handed Input Techniques: Rectangle Edition and Navigation. CHI 99. ACM Press, New York: 236-237, 1999.
• Caspersen, M.E.: A C++ Framework for Active Objects in Embedded Real-Time Systems. Bridging the gap between modeling and implementation. Technology of Object-Oriented Languages and Systems, TOOLS 32 (TOOLS Pacific '99), 22-25 November 1999, Melbourne, Australia. IEEE Computer Society; Los Alamitos, California: 52-65, 1999.
• Cattani, G.L.; Winskel, G.: Presheaf Models for CCS-like Languages. RS-99-36. BRICS, Basic Research in Computer Science, Aarhus: ii+46 pages, 1999.
• Cheng, E.; Jordán, T.: Successive edge-connectivity augmentation problems. Mathematical Programming; 84(3): 577-593, 1999.
• Cheriyan, J.; Jordán, T.; Ravi, R.: On 2-Coverings and 2-Packings of Laminar Familie. Seventh Annual European Symposium on Algorithm (ESA'99), Prague, Czech Republic, July 16-18, 1999. Lecture Notes in Computer Science; Springer-Verlag, 1643: 510-520, 1999.
• Christensen, H.B.: Ragnarok: An Architecture Based Software Development Environment. DAIMI-PB 540. Department of Computer Science, University of Aarhus: 133 pages, 1999.
• Christensen, H.B.: The Ragnarok Architectural Software Configuration Management Model. CD-Rom. Proceedings of the Thirty-Second Annual Hawaii International Conference on System Sciences, Maui, Hawaii, January 1999. IEEE Computer Society, 1999.
• Christensen, H.B.: The Ragnarok Software Development Environment Nordic. Journal of Computing; 6(1): 4-21, 1999.
• Christensen, H.B.: Utilising a Geographic Space Metaphor in a Software Development Environment. Proceedings of EHCI'98, IFIP Working Conference on Engineering for Human-Computer Interaction, Crete, Greece, September 1998. Chaty, S.; Dewan, P. (Eds.), Kluwer: 39-56, 1999.
• Christensen, M.; Damm, C.H.; Hansen, K.M.; Sandvad, E.; Thomsen, M.: Design and Evolution of Software Architecture in Practice. Proceedings of TOOLS Pacific 1999, Melbourne, Australia, November, 1999. IEEE; 2-15, 1999.
• Christensen, S.; Kristensen, L.M.; Mortensen, K.H.; Thomasen, J.S.: Capacity Planning of Web Servers using Timed Hierarchical Coloured Petri Nets. Proceedings of Hewlett-Packard OpenView University Association (HP-OVUA'99) 6th Plenary Workshop, Bologna, Italy, 1999. Hewlett Packard, Bologna, Italien: 29-45, 1999.
• Cramer, R.; Damgård, I.B.; Dziembowski, S.; Hirt, M.; Rabin, T.: Efficient Multiparty Computations with Dishonest Minority. Advances in Cryptology: International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'99), Prague, Czech Republic, May 2-6, 1999. Lecture Notes in Computer Science; Springer-Verlag, 1592: 311-326, 1999.
• Cryan, M.; Goldberg, L.A.; Phillips, C.A.: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica; 25(2): 311-329, 1999.
• Curien, P.; Plotkin, G.; Winskel, G.: Bistructures, Bidomains and Linear Logic. In: Essays in Honour of Robin Milner. Plotkin, G.; Stirling, C.; Tofte, M. (Eds.). MIT Press, 1999.
• Damgård, I.; Kilian, J.; Salvail, L.: On the (Im)possibility of basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. www.cki.au.dk/. EUROCRYPT'99, Czech Republic, May 2-6, 1999. Lecture Notes in Computer Science; Prague, Springer-Verlag(1592): 56-73, 1999.
• Damgård, I.B.: An Error in the Mixed Adversary Protocol by Fitzi, Hirt and Maurer. RS-99-2. BRICS, Basic Research in Computer Science, Aarhus: 4 pages, 1999.
• Damgård, I.B.: Commitment Schemes and Zero-Knowledge Protocols. In: Lectures on Data Security. Damgård, I.B. (Ed.). Springer-Verlag: 63-86, 1999.
• Damgård, I.B.: Lectures in Data Security. Modern Cryptology in Theory and Practice; Selected Lectures from the EEF Summer School in Cryptology and Data Security (Aarhus, Denmark, July 20-24, 1998). Springer-Verlag, Berlin, 1999.
• Damgård, I.B.: Unconditional Security in Cryptography - was Shannon too Pessimistic? Bulletin of the EATCS. European Association for Theoretical Computer Science; Leiden, Holland, 68: 166-179, 1999.
• Dantchev, S.; Al Matib, F.: Nonlinear Curve Fitting for Bioelectrical Data Analysis. A Minimum Ellipsoid. Volume Method, Physiological Measurement; 20(1): 1-9, 1999.
• Danvy, O.: ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'99), San Antonio, Texas, USA, January 22-23, 1999. NS-99-1. BRICS, Basic Research in Computer Science, Aarhus, 1999.
• Danvy, O.: An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. Also available as BRICS RS-99-21. Fourth Fuji International Symposium on Functional and Logic Programming, FLOPS (Tsukuba, Japan, November 11-13, 1999). Lecture Notes in Computer Science; Springer-Verlag, 1722: 241-250, 1999.
• Danvy, O.: Formalizing Implementation Strategies for First-Class Continuations. RS-99-51. BRICS, Basic Research in Computer Science, Aarhus, 1999.
• Danvy, O.: Type-Directed Partial Evaluation. Partial Evaluation. Practice and Theory; DIKU International Summer, PEPT '98 Lecture Notes (Copenhagen, Denmark, June 29 - July 10, 1998). Lecture Notes in Computer Science; Hatcliff, J.; Mogensen, T.Æ.; Thiemann, P. (Eds.), Springer-Verlag, Berlin: 367-411, 1999.
• Danvy, O.; Dzafic, B.; Pfenning, F.: On proving syntactic properties of CPS programs. Also available as BRICS RS-99-23. 3rd International Workshop on Higher Order Operational Techniques in Semantics, HOOTS '99, Paris, France. Electronic Notes in Theoretical Computer Science; Gordon, A.; Pitts, A. (Eds.), 26: 19-33, 1999.
• Danvy, O.; Hatcliff, J.: Partial Evaluation. In: Encyclopedia of Computer Science (Fourth Edition). Hemmendinger, D.; Ralston, A.; Reilly, E. (Eds.). Macmillan Reference/Grove Dictionaries, 1999.
• Danvy, O.; Schultz, U.P.: Lambda-Dropping. Transforming Recursive Equations into Programs with Block Structure. RS-99-27. BRICS, Basic Research in Computer Science, Aarhus: 57 pages, 1999.
• Danvy, O.; Yang, Z.: An Operational Investigation of the CPS Hierarchy. Programming Languages and Systems: Eighth European Symposium on Programming; Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS'99, ESOP'99), Amsterdam, The Netherlands, March 22-28, 1999. Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1576: 224-242, 1999.
• Eiben, A.E.; Hinterding, R.; and Michalewicz, Z.: Parameter Control in Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation; 3(2): 124-141, 1999.
• Ernst, E.: Dynamic inheritance in a statically typed language. Nordic Journal of Computing; 6(1): 72-92, 1999.
• Ernst, E.: gbeta - A Language with Virtual Attributes, Block Structure, and Propagating, Dynamic Inheritance. Department of Computer Science, University of Aarhus, Aarhus, Denmark, June 1999: 300 pages, 1999.
• Ernst, E.: Propagating class and method combination. ECOOP'99 - Object-Oriented Programming, Lisboa, Portugal, June 14-18, 1999. Lecture Notes in Computer Science; Guerraoui, R. (Ed.), Springer-Verlag, 1628: 67-91, 1999.
• Ettinger, M.; Høyer, P.: On Quantum Algorithms for Noncommutative Hidden Subgroups. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99), Trier, Germany, March 4-6, 1999. Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1563: 478-487, 1999.
• Fagerberg, R.: The Complexity of Rebalancing a Binary Search Tree. Foundations of Software Technology and Theoretical Computer Science: 19th Conference (FST&TCS '99). Chennai, India, December 13-15, 1999. Lecture Notes in Computer Science; Springer-Verlag, 1738: 72-83, 1999.
• Figueiredo, J.C.A.; Kristensen, L.M.: Using Coloured Petri Nets to Investigate Behavioural and Performance Issues of TCP Protocols. Second Workshop on Practical Use of Coloured Petri Nets and Design/CPN, Aarhus, Denmark, 13-15 October 1999. Aarhus, Denmark: 21-40, 1999.
• Filinski, A.: A Semantic Account of Type-Directed Partial Evaluation. Principles and Practice of Declarative Programming; Paris, France, September 1999. Lecture Notes in Computer Science; Springer-Verlag, Berlin, (1702): 378-395, 1999.
• Filinski, A.: Representing Layered Monads. 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '99 (San Antonio, Texas, USA, January 20-22, 1999). ACM Press; 175-188, 1999.
• Fiore, M.P.; Cattani, G.L.; Winskel, G.: Weak Bisimulation and Open Maps. Fourteenth Annual IEEE Symposium on Logic in Computer Science; The conference is part of the second Federated Logic Conference, (FLOC'99, LICS'99), Trento, Italy, July 2-5, 1999. IEEE Press; 67-76, 1999.
• Fleiner, T.; Jordán, T.: Coverings and structure of crossing families. Mathematical Programming; 84(3): 505-518, 1999.
• Fogel, D.B.; Michalewicz, Z.: Why Evolutionary Algorithms? Bulletin of the European Association for Theoretical Computer Science. European Association for Theoretical Computer Science; Leiden, Holland, (68): 115-133, 1999.
• Frandsen, G.S.; Hansen, J.P.; Miltersen, P.B.: Lower Bounds for Dynamic Algebraic Problems. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99) Proceedings (Trier, Germany, March 4-6, 1999). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1563: 362-372, 1999.
• Frank, A.; Jordán, T.: Directed vertex-connectivity augmentation. Mathematical Programming; 537-553, 84(3), 1999.
• Frank, A.; Jordán, T.; Szigeti, Z.: An orientation theorem with parity conditions. Lecture Notes in Computer Science; Cornuéjols, G.; Burkard, R.E.; Woeginger, G. (Eds.), Springer-Verlag, 1610: 183-190, 1999.
• Fridlender, D.: An Interpretation of the Fan Theorem in Type Theory. International Workshop, TYPES '98, Kloster Irsee, Germany, March 1998. Lecture Notes in Computer Science; Altenkirch, T.; Naraschewski, W.; Reus, B. (Eds.), Springer-Verlag, 1657: 93-105, 1999.
• Fröschle, S.B.; Hildebrandt, T.T.: On Plain and Hereditary History-Preserving Bisimulation. RS-99-4. BRICS, Basic Research in Computer Science, Aarhus: 21 pages, 1999.
• Gabow, H.N.; Jordán, T.: Bipartition constrained edge-splitting in directed graphs. Proceedings of the 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, Kyoto, March 1999. 225-232, 1999.
• Gabow, H.N.; Jordán, T.: How to make a square grid framework with cables rigid. Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), San Antonio, Texas, USA, March 22-24, 1999. ACM Press: 356-365, 1999.
• Gabow, H.N.; Jordán, T.: Incrementing bipartite digraph edge-connectivity. Tech. Rept. CU-CS-889-99. Univ. of Colorado, 1999.
• Grobauer, B.; Müller, O.: From I/O Automata to Timed I/O Automata. A solution to the 'Generalized Railroad Crossing'. Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, September 1999, Nice, France. Lecture Notes in Computer Science; Bertot, Y.; Dowek, G.; Paulin-Mohring, Ch.; Théry, L. (Eds.), Springer-Verlag, 1690: 273-290, 1999.
• Grønbæk, K.; Sloth, L.: Supporting interchange of open hypermedia structures and contents. Proceedings of the 5th Workshop on Open Hypermedia Systems, Darmstadt, Germany, Feb. 21-25, 1999. Report CS-99-01; Aalborg University Esbjerg, 1999.
• Grønbæk, K.; Sloth, L.; Ørbæk, P.: Webvise: Browser and Proxy support for open hypermedia structuring mechanisms on the WWW. Proceedings of The Eighth International World Wide Web Conference, Toronto, Canada, 11-14 May, 1999. Elsevier, Amsterdam, Holland: 253-267, 1999.
• Grønbæk, K.; Trigg, R.H.: From Web to Workplace: Designing Open Hypermedia Systems. MIT Press, Boston, Massachussets, USA, (ISBN 0-262-07191-6): 424 pages, 1999.
• Guiard, Y.; Beaudouin-Lafon, M.; Mottet, D.: Navigation as Multiscale Pointing: Extending Fitts' Model to Very High Precision Tasks Proc. ACM Human Factors in Computing Systems (CHI 99). ACM Press, New York: 450-457, 1999.
• Gutin, G.; Yeo, A.: Small diameter neighbourhood graphs for the traveling salesman problem. Computers and Operational Research; 26(4): 321-327, 1999.
• Gyóri, E.; Jordán, T.: How to make a graph four-connected. Mathematical Programming; 84(3): 555-563, 1999.
• Hansen, J.V.: Combining Predictors. Comparison of Five Meta Machine Learning Methods Information Science, an International Journal. 1999.
• Hansen, K.M.: Exploiting Architectures in Experimental System Development. Proceedings of OOSA'98. Research Report 13/98; University of Karlskrona/Ronneby (1998), 1999.
• Hansen, K.M.; Thomsen, M.: The 'Application Moderator' and The 'Domain Model Concealer' Patterns: Addressing Architectural Uncertainty in Interactive Systems. Proceedings of TOOLS Asia 1999, Nanjing, China, September, 1999. IEEE Computer Society; Chen, J.; Lu, J.; Meyer, B. (Eds.),: 177-190, 1999.
• Hansen, K.M.; Yndigegn, C.; Grønbæk, K.: Dynamic Use of Digital Library Material Supporting Users with Typed Links in Open Hypermedia. Proceedings of the Third European Conference, ECDL'99, Paris, France. Research and Advanced Technology for Digtial Libraries. Lecture Notes in Computer Science; Abiteboul, S.; Vercoustre A.-M. (Eds.), Springer-Verlag, 1696: 254-273, 1999.
• Hansen, R.R.; Jensen, J.G.; Nielson, F.; Nielson, H.R.: Abstract Interpretation of Mobile Ambients. Proc. SAS'99. Lecture Notes in Computer Science; Springer-Verlag, 1694: 134-148, 1999.
• Hedin, G.; Knudsen, J.L.: Language Support for Application Framework Design. In: Implementing Application Frameworks: Object-Oriented Frameworks at Work. Fayad, M.; Schmidt, D.; Johnson, R. (Eds.). Wiley Publishing Company, ISBN 0-471-25101-8, 1999.
• Henriksen, J.G.: An Expressive Extension of TLC. Fifth Asian Computing Science Conference, ASIAN '99 (Phuket, Thailand, December 10-12, 1999). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1742: 126-138, 1999.
• Henriksen, J.G.; Mukund, M.; Narayan Kumar, K.; Thiagarajan, P.S.: Towards a Theory of Regular MSC Languages. RS-99-52. BRICS, Basic Research in Computer Science, Aarhus, 1999.
• Henriksen, J.G.; Thiagarajan, P.S.: Dynamic Linear Time Temporal Logic. Annals of Pure and Applied Logic; 96(1-3): 187-207, 1999.
• Hildebrandt, T.T.: A Fully Abstract Presheaf Semantics of SCCS with Finite Delay. Category Theory and Computer Science: 8th International Conference, CTCS '99 (Edinburgh, Scotland, September 10-12, 1999). Electronic Notes in Theoretical Computer Science; Elsevier Science, 29: 25, 1999.
• Hune, T.: Modelling a real-time language. http: //www.brics.dk/~baris/Papers/fmics99.ps. 4th Workshop on Formal Methods for Industrial Critical Systems, Trento, Italy, July 11-12, 1999. Proceedings of the FLoC Workshop, 4th Workshop on Formal Methods for Industrial Critical Systems; Trento, II: 259-282, 1999.
• Hune, T.; Larsen, K.G.; Pettersson, P.: Guided Synthesis of Control Programs using Uppaal for an Industrial Batch Plant. Nordic Workshop on Programming Theory. Technical Report 1999-008, October 1999, ISSN 1404-3203; Victor, B.; Wang Yi. (Eds.), Dept. of Information Technology, Uppsala University, Uppsala: 41, 1999.
• Hüttel, H.; Kleist, J.; Nestmann, U.; Ravara, A.: Proceedings of the Workshop on Semantics of Objects As Processes, (SOAP '99), Lisbon, Portugal, June 15, 1999. NS-99-2. BRICS, Basic Research in Computer Science, Aarhus: iv+64 pages, 1999.
• Høyer, P.: Conjugated Operators in Quantum Algorithms. Physical Review A; 59(5): 3280-3289, 1999.
• Janecek, P.; Ratzer, A.; Mackay, W.: Petri Nets in Use: Redesigning Design CPN. Proceedings of the Second Workshop on Practical Use of Coloured Petri Nets and Design/CPN. Department of Computer Science, University of Aarhus; Jensen, K. (Ed.), Aarhus, Denmark, (PB-541): 119-131, 1999.
• Jansen, K.; Solis-Oba, R.; Sviridenko, M.: A Linear Time Approximation Scheme for Job Shop Scheduling Problems. Proceedings of RANDOM-APPROX99, Berkeley, USA, August 1999. Lecture Notes in Computer Science; Springer-Verlag, 1671: 177-188, 1999.
• Jansen, K.; Solis-Oba, R.; Sviridenko, M.: Makespan Minimization in Job Shops: a Linear Time Approximation Scheme. Proceedings of STOC99, Atlanta. ACM; 394-399, 1999.
• Jordán, T.: Edge splitting problems with demands. Proc. IPCO '99. Lecture Notes in Computer Science; Cornuéjols, G.; Burkard, R.E.; Woeginger, G. (Eds.), Springer-Verlag, 1610: 273-288, 1999.
• Jordán, T.: Extremal graphs in connectivity augmentation. J. Graph Theory; (31): 179-193, 1999.
• Jordán, T.: On the number of shredders. J. Graph Theory; (31): 195-200, 1999.
• Jordán, T.; Szigeti, Z.: Detachments Preserving Local Edge-Connectivity of Graphs. RS-99-35. BRICS, Basic Research in Computer Science, Aarhus: 16 pages, 1999.
• Jurdzinski, M.; Nielsen, M.: Hereditary History Preserving Bisimilarity is Undecidable. RS-99-19. BRICS, Basic Research in Computer Science, Aarhus: 18 pages, 1999.
• Jurdzinski, M.; Nielsen, M.: Hereditary History Preserving Simulation is Undecidable. RS-99-1. BRICS, Basic Research in Computer Science, Aarhus: 15 pages, 1999.
• Jørgensen, J.B.; Kristensen, L.M.: Computer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm Using Coloured Petri Nets and Occurrence Graphs with Symmetries. IEEE Transactions on Parallel and Distributed Systems; 10(7): 714-732, 1999.
• Kirchner, H.; Mosses, P.D.: Algebraic Specifications, Higher-Order Types, and Set-Theoretic Models. Algebraic Methodology and Software Technology: 7th International Conference, AMAST '98 (Amazonia, Brazil, January 4-8, 1999). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1548: 373-388, 1999.
• Klarlund, N.; Damgaard, N.; Schwartzbach, M.I.: YakYak: Parsing with Logical Side Constraints. 4th International Conference on Developments in Language Theory, Aachen, Tyskland, July 6-9, 1999. Aachener Informatik Berichte; Thomas, W. (Ed.), (99-5): 289-303, 1999.
• Klarlund, N.; Schwartzbach, M.I.: A Domain-Specific Language for Regular Sets of Strings and Trees. IEEE Transactions on Software Engineering; 25(3): 378-386, 1999.
• Kohlenbach, U.: A Note on Goodman's Theorem. Studia Logica; 63(1): 1-5, 1999.
• Kohlenbach, U.: A Note on Spector's Quantifier-Free Rule of Extensionality. RS-99-20. BRICS, Basic Research in Computer Science, Aarhus: 5 pages, 1999.
• Kohlenbach, U.: Foundational and Mathematical Uses of Higher Types. RS-99-31. BRICS, Basic Research in Computer Science, Aarhus: 34 pages, 1999.
• Kohlenbach, U.: On the No-Counterexample Interpretation. Journal of Symbolic Logic; 64(4): 1491-1511, 1999.
• Kohlenbach, U.: On the Uniform Weak König's Lemma. RS-99-11. BRICS, Basic Research in Computer Science, Aarhus: 13 pages, 1999.
• Kohlenbach, U.: The Use of a Logical Principle of Uniform Boundedness in Analysis. Logic and Foundations of Mathematics. Kluwer Academic Publishers; 280: 93-106, 1999.
• Koziel, S.; Michalewicz, Z.: Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization. Evolutionary Computation; 7(1): 19-44, 1999.
• Krink, T.: Cooperation and Selfishness in Strategies for Resource Management. MEMS-99, Marine Environmental Modelling Seminar. Lillehammer, Norway, 1: 295-305, 1999.
• Krink, T.; Mayoh, B.; Michalewicz, Z.: A Patchwork Model for Evolutionary Algorithms with Structured and Variable Size Populations. GECCO-99, Genetic Algorithms and Evolutionary Computation Conference, Orlando, FL. Morgan Kaufmann; 2: 1321-1328, 1999.
• Krink, T.; Vollrath, F.: Spatial Orientation of virtual Spider Robots by Object-oriented Rule-based Simulations. IEEE Intelligent Systems; 14(5): 77-84, 1999.
• Krink, T.; Vollrath, F.: Using a virtual robot to model the employment of regenerated legs in an orb spider. Animal Behaviour; 57: 223-241, 1999.
• Krink, T.; Vollrath, F.: Using a Virtual Robot to Model the Use of Regenerated Legs in a Web Spider. Animal Behaviour; 57: 223-232, 1999.
• Kristensen, L.M.; Christensen, S.; Jensen, K.: The Practitioner's Guide to Coloured Petri Nets. Int. Journal on Software Tools for Technology Transfer. Special Section on Coloured Petri Nets; Jensen, K. (Ed.), Springer-Verlag, (2 (1998)): 98-132, 1999.
• Leguizamon, G.; Michalewicz, Z.: A New Version of the Ant System for Subset Problems. Proceedings of the Congress on Evolutionary Computation, CEC'99, Washington DC, July 6-9, 1999. IEEE Press; 1459-1464, 1999.
• Lund, H.H.; Arendt, J.Å.; Fredslund, J.; Pagliarini, L.: Ola: What Goes Up, Must Fall Down. Journal of Artificial Life and Robotics; 4(1), 1999.
• Lund, H.H.; Pagliarini, L.: Robot Soccer with LEGO Mindstorms. Proceedings of RoboCup'98. Lecture Notes in Artificial Intelligence; Asada, M. (Ed.), Springer-Verlag, Heidelberg, 1604: 141-151, 1999.
• Lyngsø, R.B.; Pedersen, C.N.S.: Protein Folding in the 2D HP Model. RS-99-16. BRICS, Basic Research in Computer Science, Aarhus: 15 pages, 1999.
• Lyngsø, R.B.; Pedersen, C.N.S.; Nielsen, H.: Measures on Hidden Markov Models. RS-99-6. BRICS, Basic Research in Computer Science, Aarhus: 27 pages, 1999.
• Lyngsø, R.B.; Pedersen, C.N.S.; Nielsen, H.: Metrics and Similarity Measures for Hidden Markov Models. 7th International Conference on Intelligent Systems for Molecular Biology, ISMB '99. AAAI Press, Menlo Park, CA, USA; Heidelberg, Germany: 178-186, 1999.
• Lyngsø, R.B.; Zuker, M.; Pedersen, C.N.S.: Fast Evaluation of Internal Loops in RNA Secondary Structure Prediction. Bioinformatics; 15(6): 440-445, 1999.
• Lyngsø, R.B.; Zuker, M.; Pedersen, C.N.S.: Internal Loops in RNA Secondary Structure Prediction. Third Annual International Conference on Computational Molecular Biology, RECOMB '99 (Lyon, France, April 11-14, 1999). ACM Press; 260-267, 1999.
• Mackay, W.E.: Media Spaces: Environments for multimedia interaction. In: Computer-Supported Cooperative Work, Trends in Software Series. Beaudouin-Lafon, M. (Ed.). Wiley and Sons, Chichester, UK: 55-82, 1999.
• Mackay, W.E.: Video Techniques for Participatory Design: Observation, Brainstorming & Prototyping. Interface; British HCI Group, 1999.
• Mackay, W.E.; Fayard, A-L.: Designing Interactive Paper: Lessons from three Augmented Reality Projects. Proceedings of IWAR'98, 1st International Workshop on Augmented Reality, San Francisco, CA, USA, November 1, 1998. A K Peters, Ltd, Natick, MA, USA, 1999.
• Madsen, O.L.: COM Support in BETA. Fourth International Workshop on Component-Oriented Programming, Lisbon, Portugal, June 14, 1999. In conjunction with European Conference on Object-Oriented Programming, Lisbon, Portugal, June 14-18, 1999. University of Karlskrona, Rønneby, Sverige, 1999.
• Madsen, O.L.: Semantic Analysis of Virtual Classes and Nested Classes. Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'99), Denver, USA, November 1-5, 1999. ACM/SIGPLAN, 1999.
• Madsen, O.L.: Towards Integration of Object-Oriented Languages and State Machines. Technology of Object-Oriented Languages and Systems (TOOLS Europe '99), Nancy, June 7-10, 1999. IEEE Computer Society; 1999.
• Mayoh, B.; Krink, T.; Werk, E.G.; Junping, D.: How flexible should agent behaviour languages be? Intelligent Agent Technology: Systems, Methodologies, and Tools (IAT'99) Proceedings of the 1st Asia-Pacific Conference on IAT. World Scientific Publishing Co. Pte. Ltd; Hong Kong, 1: 146-150, 1999.
• Mayoh, B.H.: Evolutionary pattern grammars in artificial intelligence and design. Machine Graphics & Vision; (8): 230-238, 1999.
• Michalewicz, Z.: Seven Methods for Transforming Corporate Data into Business Intelligence, review. Emergence: A Journal of Complexity Issues in Organizations and Management; 1(2): 190-192, 1999.
• Michalewicz, Z.; Deb, K.; Schmidt, M.; Stidsen, T.: Evolutionary Algorithms for Engineering Applications. Proceedings of EUROGEN'99, May 30-June 3, 1999, Jyvaskyla, Finland. Wiley: 73-94, 1999.
• Michalewicz, Z.; Deb, K.; Schmidt, M.; Stidsen, T.: Towards Understanding Constrained-Handling Methods in Evolutionary Algorithms. Proceedings of the Congress on Evolutionary Computation, CEC'99, Washington DC, July 6-9, 1999. IEEE Press; 581-588, 1999.
• Michalewicz, Z.; Esquivel, S.; Gallard, R.; Michalewicz, M.; Tao, G.; Trojanowski, K.: The Spirit of Evolutionary Algorithms. Journal of Computing and Information Technology, special issue on Evolutionary Computing; 7(1): 1-18, 1999.
• Michalewicz, Z.; Michalewicz, M.: Teaching Evolutionary Algorithms. Proceedings of the Congress on Evolutionary Computation, CEC'99, Washington DC, July 6-9, 1999. IEEE Press; 1702-1706, 1999.
• Michalewicz, Z.; Schoenauer, M.; Yao, X; Zazala, A.: Proceedings of the Congress on Evolutionary Computation. Vol. 1-3. IEEE Service Center, Piscataway, NJ, Washington, DC, July 6-9, 1999.
• Miltersen, P.B.: Two Notes on the Computational Complexity of One-Dimensional Sandpiles. RS-99-3. BRICS, Basic Research in Computer Science, Aarhus: 8 pages, 1999.
• Miltersen, P.B.; Variyam, V.N.: Derandomizing Arthur-Merlin Games using Hitting Sets. 40th Annual Symposium on Foundations of Computer Science, FOCS '99 (New York City, New York, USA, October 17-19, 1999). IEEE Press; 71-80, 1999.
• Miltersen, P.B.; Variyam, V.N.; Watanabe, O.: Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. Computing and Combinatorics: 5th Annual International Conference, COCOON '99 (Tokyo, Japan, July 26-28, 1999). Lecture Notes in Computer Science; Springer-Verlag, 1627: 210-220, 1999.
• Mix Barrington, D.A.; Lu, C.; Miltersen, P.B.; Skyum, S.: On Monotone Planar Circuits. The 14th Annual IEEE Conference on Computational Complexity, COMPLEXITY '99 (Atlanta, Georgia, USA, May 4-6, 1999). IEEE Press; 24-33, 1999.
• Mortensen, K.H.: Automatic Code Generation from Coloured Petri Nets for an Access Control System. Second Workshop on Practical Use of Coloured Petri Nets and Design/CPN, Aarhus, Denmark, October 11-15, 1999. PB-541; Jensen, K. (Ed.), Department of Computer Science, University of Aarhus: 41-58, 1999.
• Mosses, P.D.: A Modular SOS for Action Notation (Extended Abstract). Second International Workshop on Action Semantics, AS '99 (Amsterdam, The Netherlands, March 21, 1999). BRICS, Basic Research in Computer Science; Aarhus, NS-99-3: 131-142, 1999.
• Mosses, P.D.: A Modular SOS for ML Concurrency Primitives. RS-99-57. BRICS, Basic Research in Computer Science, Aarhus: 22 pages, 1999.
• Mosses, P.D.: CASL. A Guided Tour of its Design. Recent Trends in Algebraic Development Techniques: 13th Workshop, WADT '98 Selected Papers (Lisbon, Portugal, April 2-4, 1998). Lecture Notes in Computer Science; Springer-Verlag, 1589: 216-240, 1999.
• Mosses, P.D.: Foundations of Modular SOS (Extended Abstract). Mathematical Foundations of Computer Science: 24th International Symposium, MFCS '99 (Szklarska Poreba, Poland, September 6-10, 1999). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1672: 70-80, 1999.
• Mosses, P.D.: Logical Specification of Operational Semantics. European Association for Computer Science Logic: 13th International Workshop, CSL '99 (Madrid, Spain, September 20-25,1999). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1683: 32-49, 1999.
• Mosses, P.D.; Watt, D.A.: Proceedings of the Second International Workshop on Action Semantics (AS'99), Amsterdam, The Netherlands, March 21, 1999. NS-99-3. BRICS, Basic Research in Computer Science, Aarhus: iv+172 pages, 1999.
• Möller, M.O.; Rueß, H.: Solving Bit-Vector Equations of Fixed and Non-Fixed Size. RS-99-18. BRICS, Basic Research in Computer Science, Aarhus: 18 pages, 1999.
• Nagamochi, H.; Jordán, T.; Nakao, Y.; Ibaraki, T.: Bisecting two subsets in 3-connected graphs. 10th Annual International Symposium on Algorithms and Computation, ISAAC'99. Lecture Notes in Computer Science; Aggarwal, E.; Rangan, C.P. (Eds.), Springer-Verlag, 1741: 425-434, 1999.
• Nielsen M.; Hune T.: Bisimulation and Open Maps for Timed Transition Systems. Fundamenta Informaticae; 38: 61-77, 1999.
• Nielson, F.: Validating Programs in Concurrent ML. In: Research Directions in Parallel Functional Programming. Hammond, K.; Michaelson, G. (Eds.). Springer-Verlag: 361-378, 1999.
• Nielson, F.; Nielson, H.R.: Interprocedural Control Flow Analysis. Proc. ESOP'99. Lecture Notes in Computer Science; Springer-Verlag, 1576: 20-39, 1999.
• Nielson, F.; Nielson, H.R.: Type and Effect Systems. In: Correct System Design. Olderog, E.R.; Steffen, B. (Eds.). Springer-Verlag: 114-136, 1999.
• Nielson, F.; Nielson, H.R.; Hankin, C.L.: Principles of Program Analysis. Springer-Verlag: 445 pages, 1999.
• Nielson, F.; Nielson, H.R.; Hansen, R.R.; Jensen, J.G.: Validating Firewalls in Mobile Ambients. Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999. Lecture Notes in Computer Science; Springer-Verlag, 1664: 463-477, 1999.
• Nürnberg, P.J.; Ashman, H.L.: What was the question? Reconciling open hypermedia and Web research. Proceedings of the 10th ACM Conference on Hypertext, HT 99, Darmstadt, Tyskland, February 1999. ACM Press: 83-90, 1999.
• Nürnberg, P.J.; Grønbæk, K.; Bucka-Lassen, D.; Aagaard Pedersen, C.; Reinert, O.: A component-based open hypermedia approach to integrating structure services. New Review of Hypermedia and Multimedia; 5, 1999.
• Nürnberg, Peter J.: Realizing the potential of hypertext as a collaborative artistic medium. First CyberMountain Colloquium (CM '99) Denver, CO, Apr 99. Aalborg University Esbjerg, Computer Science Department. Technical report AUE-CS-99-05; 1999.
• Pagh, R.: Faster Deterministic Dictionaries. RS-99-48. BRICS, Basic Research in Computer Science, Aarhus: 14 pages, 1999.
• Pagh, R.: Hash and Displace. Efficient Evaluation of Minimal Perfect Hash Functions. Algorithms and Data Structures: 6th International Workshop, WADS'99 (Vancouver, British Columbia, Canada, August 12-14, 1999). Lecture Notes in Computer Science; Springer-Verlag, 1663: 49-54, 1999.
• Pagh, R.: Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. 26th International Colloquium on Automata, Languages, and Programming, ICALP '99 (Prague, Czech Republic July 11-15, 1999). Lecture Notes in Computer Science; Springer-Verlag, 1644: 595-604, 1999.
• Panconesi, A.; Hanckowiak, M.; Karonski, M.: A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically. The Eighteenth Annual ACM Symposium on Principles of Distributed Computing; The conference is part of the Federated Computing Re-search Conference (FCRC '99), PODC '99 (Atlanta, Georgia, USA, April 29-May 6, 1999). ACM Press; 219-228, 1999.
• Reich, S.; Wiil, U.K.; Nürnberg, P.J.; Davis, H.C.; K.; Anderson, K.M.; Millard, D.E.; Haake, J.M.: Addressing Interoperability in Open Hypermedia: The Design of the Open Hypermedia Protocol. New Review of Hypermedia and Multimedia, 5, 1999.
• Rhiger, M.: Deriving a Statically Typed Type-Directed Partial Evaluator. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, PEPM '99, (San Antonio, Texas, USA, January 22-23, 1999). BRICS, Basic Research in Computer Science; Aarhus, NS-99-1 of Notes Series: 25-29, 1999.
• Riecke, J.G.; Sandholm, A.B.: A Relational Account of Call-by-Value Sequentiality. RS-99-10. BRICS, Basic Research in Computer Science, Aarhus: 51 pages, 1999.
• Riis, S.: A Complexity Gap for Tree-Resolution. RS-99-29. BRICS, Basic Research in Computer Science, Aarhus: 33 pages, 1999.
• Riis, S.M.; Sitharam, M.: Generating Hard Tautologies Using Predicate Logic and the Symmetric Group. WOLLIC'98 Special Issue of the Logic; Oxford University Press: 13, 1999.
• Rizzi, R.: Linear Time Recognition of P4-Indifferent Graphs. RS-99-38. BRICS, Basic Research in Computer Science, Aarhus: 11 pages, 1999.
• Rizzi, R.: On the Steiner Tree 3/2-Approximation for Quasi-Bipartite Graphs. RS-99-39. BRICS, Basic Research in Computer Science, Aarhus: 6 pages, 1999.
• Rodler, F.F.: Wavelet Based 3D Compression with Fast Random Access for Very Large Volume Data. http: //www.brics.dk/~ffr/Publications.html, also BRICS RS-99-34. Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Pacific Graphics'99), Seoul Korea, October 5-7 1999. IEEE Comput. Soc; 108-117, 1999.
• Røn, H.: An Overview of a Dynamic Programming Environment Based on Extensibility. Nordic Journal of Computing; 6(1): 55-71, 1999.
• Salvail, L.: The Search for the Holy Grail in Quantum Cryptology. In: Lectures in Data Security. Modern Cryptology in Theory and Practice; Selected Lectures from the EEF Summer School in Cryptology and Data Security (Aarhus, Denmark, July 20-24, 1998). Damgård, I.B. (Ed.). Springer-Verlag, Berlin: 183-216, 1999.
• Skyum, S.; Frandsen, G.S.; Miltersen, P.B.; Binderup, P.G.: The Complexity of Identifying Large Equivalence Classes. Fundamenta Informaticae; 38(1-2): 25-37, 1999.
• Srba, J.: Deadlocking States in Context-Free Process Algebra. http: //www.fi.muni.cz/~srba/publ.html. Proceedings of the The 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS 98. Lecture Notes in Computer Science; Springer Verlag, 1450: 388-398, 1999.
• Stidsen, T.; Caprani, O.; and Michalewicz, Z.: A Parabolic Operator for Parameter Optimization Problems. Proceedings of the Congress on Evolutionary Computation, CEC'99, Washington DC, July 6-9, 1999. IEEE Press; 1494-1500, 1999.
• Thorup, K.K.: Objective C. In: Handbook of Object Technology. Zamir, S. (Ed.). CRC Press, 1999.
• Thorup, K.K.; Torgersen, M.: Unifying Genericity - Combining the Benefits of Virtual Types and Parameterized Classes. In proceedings of ECOOP'99, Lisbon, Portugal, June 14-18, 1999. Lecture Notes in Computer Science; Springer-Verlag, 1628: 186-204, 1999.
• Tjørnfelt-Jensen, M.; Hansen, T.K.: Robust Solutions to Job Shop Problems. Congress of Evolutionary Computation 1999, Washington, DC, USA, July 6-7, 1999. 1138-1144, 1999.
• Topping, C.J.; Rehder, M.J.; Mayoh, B.H. 1: Viola: a new visual programming language designed for the rapid development of interacting-agent systems. Acta Biotheoretica; (47): 129-140, 1999.
• Trojanowski, K.; Michalewicz, Z.: Evolutionary algorithms for non-stationary environments. Proceedings of the 8th International Symposium on Intelligent Systems (ISS'99), June 14-18, 1999, Ustronie/Wisla, Poland. Institute of Computer Science, Polish Academy of Sciences Press: 229-240, 1999.
• Trojanowski, K.; Michalewicz, Z.: Evolutionary Approach to Non-stationary Optimisation Tasks. Proceedings of the 11th International Symposium on Methodologies of Intelligent Systems, June 8-11, 1999, Warsaw, Poland. Lecture Notes in Artificial Intelligence; Ras, Z.W.; Skowron, A. (Eds.), Springer-Verlag, 1609: 538-546, 1999.
• Trojanowski, K.; Michalewicz, Z.: Extensions of Evolutionary Algorithms for Non-stationary Environments. Proceedings of the 4th National Conference on Evolutionary Computation and Global Optimization, May 25-28, 1999, Potok Zloty, Poland. Warsaw University of Technology Press: 317 - 328, 1999.
• Trojanowski, K.; Michalewicz, Z.: Searching for Optima in Non-stationary Environments. Proceedings of the Congress on Evolutionary Computation, CEC'99, Washington DC, July 6-9, 1999. IEEE Press; 1843-1850, 1999.
• Ursem, R.K.: Multinational Evolutionary Algorithms. Congress of Evolutionary Computation. IEEE Press: 1633-1640, 1999.
• Wiedermann J; van Emde Boas P.; Nielsen M.: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings Lecture Notes in Computer Science. Springer Verlag, ISBN 3-540-66224-3: 718 pages, 1999.
• Wiil, U.K.; Nürnberg, P.J.: Evolving hypermedia middleware: Lessons and observations. In proceedings of ACM Symposium on Applied Computing, (SAC 99), San Antonio, TX, USA, May 1999. ACM; 427-436, 1999.
• Winskel, G.: A linear metalanguage for concurrency. 7th Int. Conf. on Algebraic Methodology and Software Technology, AMAST'98, Brazil, January 4-8, 1999. Lecture Notes in Computer Science; Haeberer, A.M. (Ed.), Springer-Verlag, 1548: 42-58, 1999.
• Winskel, G.: Event Structures as Presheaves. Two Representation Theorems. Concurrency Theory: 10th International Conference, CONCUR '99 (Eindhoven, The Netherlands, August 24-27, 1999). Lecture Notes in Computer Science; Springer-Verlag, Berlin, 1664: 541-556, 1999.
• Winskel, G.: La Semantica Formale dei Linguaggi di Programmazione. UTET Libreria, Torino, Italien: 394 pages, 1999.
• Xiao, J.; Michalewicz, Z.: An Evolutionary Computation Approach to Planning and Navigation. In: Soft-Computing and Mechatronics. Hirota, K.; Fukuda, T. (Eds.). Physica-Verlag: 117-148, 1999.
• Yeo, A.: A Polynomial Algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph. Journal of Algorithms; 33(11): 124-139, 1999.
• Yeo, A.: Diregular c-partite tournaments are vertex-pancyclic when c>=5. Journal of Graph Theory; 32: 137-152, 1999.
• Yeo, A.: Hamilton cycles, avoiding prescibed arcs, in close to regular tournaments. Journal of Graph Theory; 32: 123-136, 1999.

Go to new website - cs.au.dk