Bender, M. A.
, Brodal, G. S., Fagerberg, R., Jacob, R. & Vicari, E. (2010).
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Theory of Computing Systems,
47(4), 934-962.
https://doi.org/10.1007/s00224-010-9285-4
Moeslund, J. E., Arge, L. A., Bøcher, P. K., Nygaard, B. & Svenning, J-C. (2011).
Geographically Comprehensive Assessment of Salt-Meadow Vegetation-Elevation Relations Using LiDAR.
Wetlands,
31(3), 471-482.
https://doi.org/10.1007/s13157-011-0179-2
Bender, M. A.
, Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2011).
The Cost of Cache-Oblivious Searching.
Algorithmica,
61(2), 463-505.
https://doi.org/10.1007/s00453-010-9394-0
Chan, T. M., Durocher, S.
, Larsen, K. G., Morrison, J.
& Wilkinson, B. T. (2012).
Linear-Space Data Structures for Range Mode Query in Arrays.
Leibniz International Proceedings in Informatics,
14, 290-301.
https://doi.org/10.4230/LIPIcs.STACS.2012.290
Afshani, P., Afrawal, M., Benjamin, D.
, Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012).
The Query Complexity of Finding a Hidden Permutation.
Electronic Colloquium on Computational Complexity, (TR12-087).
http://eccc.hpi-web.de/report/2012/087/
Brodal, G. S., Davoodi, P., Lewenstein, M., Raman, R. & Rao, S. S. (2012).
Two Dimensional Range Minimum Queries and Fibonacci Lattices.
Lecture Notes in Computer Science,
7501, 217-228 .
https://doi.org/10.1007/978-3-642-33090-2_20
Alexander, C., Moeslund, J. E., Bøcher, P. K., Arge, L. & Svenning, J-C. (2013).
Airborne laser scanner (LiDAR) proxies for understory light conditions.
Remote Sensing of Environment,
134, 152-161.
https://doi.org/10.1016/j.rse.2013.02.028
Sand, A., Holt, M. K., Johansen, J., Fagerberg, R.
, Pedersen, C. N. S., Brodal, G. S. & Mailund, T. (2013).
Algorithms for Computing the Triplet and Quartet Distances for Binary and General Trees.
Biology,
2(4), 1189-1209.
https://doi.org/10.3390/biology2041189
Arge, L., Brodal, G. S., Truelsen, J. & Tsirogiannis, C. (2013).
An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. In
Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (pp. 61-72). Springer VS.
https://doi.org/10.1007/978-3-642-40450-4_6
Afshani, P., Agarwal, P. K.
, Arge, L., Larsen, K. G. & Phillips, J. (2013).
(Approximate) Uncertain Skylines.
Theory of Computing Systems,
52(3), 342-366.
https://doi.org/10.1007/s00224-012-9382-7
Sand, A., Pedersen, C. N. S., Mailund, T., Brodal, G. S. & Fagerberg, R. (2013).
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
B M C Bioinformatics,
14(Suppl 2), S18.
https://doi.org/10.1186/1471-2105-14-S2-S18
Brodal, G. S., Fagerberg, R.
, Mailund, T., Pedersen, C. N. S. & Sand, A. (2013).
Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree.
The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings,
24, 1814-1832.
http://knowledgecenter.siam.org/0236-000098/0236-000098/1
Kejlberg-Rasmussen, C., Tao, Y., Tsakalidis, K., Tsichlas, K. & Yoon, J. (2013).
I/O-Efficient Planar Range Skyline and Attrition Priority Queues. In R. Hull & W. Fan (Eds.),
Proceedings of the 32nd symposium on Principles of database systems , PODS '13 (pp. 103-114 ). Association for Computing Machinery.
https://doi.org/10.1145/2463664.2465225
Alamdari, S., Angelini, P., Chan, T. M., Di Battista, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2013).
Morphing Planar Graph Drawings with a Polynomial Number of Steps.
The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings,
24, 1656-1667.
http://knowledgecenter.siam.org/0236-000137/0236-000137/1