Brodal, G. S., Fagerberg, R.
& Moruz, G. (2005).
Cache-Aware and Cache-Oblivious Adaptive Sorting. I L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi & M. Yung (red.),
Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings (s. 576-588). Springer.
https://doi.org/10.1007/11523468_47
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. (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., Ö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., 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.
Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017).
Cross-Referenced dictionaries and the limits of write optimization. I P. N. Klein (red.),
28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (s. 1523-1532). Association for Computing Machinery.
Afshani, P., Chan, T. M. & Tsakalidis, K. (2014).
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. I J. Esparza , P. Fraigniaud, T. Husfeldt & E. Koutsoupias (red.),
Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I (s. 77-88 ). Springer VS.
https://doi.org/10.1007/978-3-662-43948-7_7
Brodal, G. S., Sioutas, S., Tsichlas, K. & Zaroliagis, C. (2010).
D2-tree: A new overlay with deterministic bounds. I O. Cheong , K.-Y. Chwa & K. Park (red.),
Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju, Korea, December 15-17, 2010, Proceedings, Part II (s. 1-12). Springer VS.
https://doi.org/10.1007/978-3-642-17514-5_1
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S. & Stoye, J. (1999).
Finding Maximal Pairs with Bounded Gap. I M. Crochemore & M. Paterson (red.),
Combinatorial Pattern Matching: 10th Annual Symposium, CPM 99 Warwick University, UK, July 22–24, 1999 Proceedings (s. 134-149). Springer.
https://doi.org/10.1007/3-540-48452-3_11