Brand, M. V. D.
, Mosses, P. D. & Iversen, J. (2004).
An Action Environment. I
Proceedings of the Fourth Workshop on Language Descriptions, Tools and Applications (Bind 110, s. 149-168). Electronic Notes in Theoretical Computer Science.
Brodal, G. S. & Fagerberg, R. (2002).
Cache Oblivious Distribution Sweeping. I P. Widmayer, S. Eidenbenz, F. Triguero, R. Morales, R. Conejo & M. Hennessy (red.),
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings (s. 426-438). Springer.
https://doi.org/10.1007/3-540-45465-9_37
Brodal, G. S., Fagerberg, R., Bose, P. (red.) & Morin, P. (red.) (2002).
Funnel Heap - A Cache Oblivious Priority Queue. I P. Bose & P. Morin (red.),
Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21–23, 2002 Proceedings (s. 219-228). Springer.
https://doi.org/10.1007/3-540-36136-7_20
Brodal, G. S., Fagerberg, R., Meyer, U. & Zeh, N. (2004).
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. I T. Hagerup & J. Katajainen (red.),
Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings (s. 480-492). Springer.
https://doi.org/10.1007/978-3-540-27810-8_41
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Eades, P. (red.) & Takaoka, T. (red.) (2001).
Computing the Quartet Distance Between Evolutionary Trees in Time O(n log² n). I
Proceedings of Algorithms and Computation : 12th International Symposium, ISAAC 2001 (2223 of Lecture Notes in Computer Science udg., Bind 2223/2001, s. 731-742). Springer.
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S. & Östlin, A. (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. I F. Orejas, P. G. Spirakis & J. van Leeuwen (red.),
Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings (s. 140-151). Springer.
https://doi.org/10.1007/3-540-48224-5_12
Brodal, G. S., Fagerberg, R., Östlin, A.
, Pedersen, C. N. S. & Rao, S. S. (2003).
Computing Refined Buneman Trees in Cubic Time. I G. Benson & R. Page (red.),
Algorithms in Bioinformatics: Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003. Proceedings (s. 259-270). Springer.
https://doi.org/10.1007/978-3-540-39763-2_20
Brodal, G. S., Lagogiannis, G., Makris, C., Tsakalidis, A. & Tsichlas, K. (2003).
Optimal Finger Search Trees in the Pointer Machine.
Journal of Computer and System Sciences,
67(2), 381-418.
https://doi.org/10.1016/S0022-0000(03)00013-8
Brodal, G. S., Lyngsø, R. B., Östlin, A.
& Pedersen, C. N. S. (2002).
Solving the String Statistics Problem in Time O(n log n). I P. Widmayer, S. Eidenbenz, F. Triguero, R. Morales, R. Conejo & M. Hennessy (red.),
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings (s. 728-739). Springer.
https://doi.org/10.1007/3-540-45465-9_62
Brodal, G. S., Makris, C., Sioutas, S., Tsakalidis, A. K. & Tsichlas, K. (2002).
Optimal Solutions for the Temporal Precedence Problem.
Algorithmica,
33(4), 494-510.
https://doi.org/10.1007/s00453-002-0935-z
Bødker, S. & Christiansen, E. (2002).
Lost and Found in Flexibility. I K. Bødker, M. K. Pedersen, J. Simonsen & M. T. Vendelø (red.),
Proceedings of the 25th Information Systems Research Seminar in Scandinavia Human-Computer Interaction Resource Network.
Büscher, M., Hartswood, M.
, Mogensen, P. H., Procter, R., Shapiro, D., Slack, R. & Voss, A. (2002).
Promises, Premises and Risks: Sharing Responsibilities, Working Up Trust and Sustaining Commitment in Participatory Design Projects. I
Proceedings of PDC 2002
Cáccamo, M. J.
, Winskel, G., Boulton, R. J. (red.) & Jackson, P. B. (red.) (2001).
A Higher-Order Calculus for Categories. I
Lecture Notes in Computer Science: Theorem Proving in Higher Order Logics (Lecture Notes in Computer Science udg., Bind 2152, s. 136-153). Springer.
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. (2003).
Using trust for Secure Collaboration in Uncertain Environments.
I E E E Pervasive Computing,
2(3), 52-61.
https://doi.org/10.1109/MPRV.2003.1228527
Canetti, R.
, Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2004).
Adaptive versus Non-Adaptive Security of Multi-Party Protocols.
Journal of Cryptology,
17(3), 153-207.
https://doi.org/10.1007/s00145-004-0135-x
Canetti, R.
, Damgård, I. B., Dziembowski, S., Ishai, Y. & Malkin, T. (2001).
On Adaptive vs. Non-adaptive Security of Multiparty Protocols. I B. Pfitzmann (red.),
Advances in Cryptology --- EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings (s. 262-279). Springer.
https://doi.org/10.1007/3-540-44987-6_17
Caspersen, M. E. (2004).
Discussant Submission. Afhandling præsenteret på 3rd "Killer Examples" for Design Patterns and Objects First Workshop at OOPSLA 2004, Vancouver, British Columbia, Canada.