Alstrup, S.
, Brodal, G. S. & Rauhe, T. (2000).
Pattern matching in dynamic texts. I D. Shmoys (red.),
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (s. 819-828). Society for Industrial and Applied Mathematics.
Arge, L., Brodal, G. S., Truelsen, J. & Tsirogiannis, C. (2013).
An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. I
Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (s. 61-72). Springer VS.
https://doi.org/10.1007/978-3-642-40450-4_6
Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016).
How to prove knowledge of small secrets. I J. Katz & M. Robshaw (red.),
Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Bind 9816, s. 478-498). Springer VS.
https://doi.org/10.1007/978-3-662-53015-3_17
Braverman, V., Cohen-Addad, V., Jiang, S. H.-C., Krauthgamer, R.
, Schwiegelshohn, C., Toftrup, M. B. & Wu, X. (2022).
The Power of Uniform Sampling for Coresets. I
Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022 (s. 462-473). IEEE.
https://doi.org/10.1109/FOCS54457.2022.00051
Brodal, G. S., Fagerberg, R., Hammer, D., Meyer, U., Penschuck, M. & Tran, H. (2021).
An experimental study of external memory algorithms for connected components. I D. Coudert & E. Natale (red.),
19th International Symposium on Experimental Algorithms, SEA 2021 (s. 23). Artikel 23 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.SEA.2021.23
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.
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
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