Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Brodal, G. S. (2013). A Survey on Priority Queues. In A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (Eds.), Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (pp. 150-163 ). Springer VS. https://doi.org/10.1007/978-3-642-40273-9_11

Sand, A., Pedersen, C. N. S., Mailund, T., Brodal, G. S. & Fagerberg, R. (2013). A practical O(n log² 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

Chan, T. M. & Wilkinson, B. T. (2013). Adaptive and Approximate Orthogonal Range Counting. In S. Khanna (Ed.), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 (pp. 241-251). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973105.18

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. Lecture Notes in Computer Science Vol. 8125 https://doi.org/10.1007/978-3-642-40450-4_6

Kejlberg-Rasmussen, C. (2013). Dynamic Data Structures: The Interplay of Invariants and Algorithm Design. Department of Computer Science, Aarhus University.

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. A C M. S I G A C T - S I G M O D - S I G A R T Symposium on Principles of Database Systems. Proceedings https://doi.org/10.1145/2463664.2465225

Larsen, K. G. (2013). Models and Techniques for Proving Data Structure Lower Bounds. Department of Computer Science, Aarhus University.

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

Larsen, K. G. & Walderveen, F. V. (2013). Near-Optimal Range Reporting Structures for Categorical. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 (pp. 265-276). Association for Computing Machinery. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings http://knowledgecenter.siam.org/0236-000081/~~PdfSource/0

Jones, M., Moeslund, J. E., Alexander, C., Bøcher, P. K. & Svenning, J-C. (2013). Near-ground temperature variability and its predictability in Denmark. Poster session presented at Biodiversitetssymposium 2013, København, Denmark.

Afshani, P., Matulef, K. & Wilkinson, B. T. (2013). Property Testing on Linked Lists. Electronic Colloquium on Computational Complexity, TR13-187. http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc20.html

Bringmann, K. & Larsen, K. G. (2013). Succinct Sampling from Discrete Distributions. In Proceedings of the 45th annual ACM Symposium on Theory of Computing, STOC '13 (pp. 775-782 ). Association for Computing Machinery. A C M Symposium on the Theory of Computing. Annual Proceedings https://doi.org/10.1145/2488608.2488707

Afshani, P., Agrawal, M., Benjamin, D., Doerr, C., Larsen, K. G. & Mehlhorn, K. (2013). The Query Complexity of Finding a Hidden Permutation. In A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (Eds.), Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (pp. 1-11). Springer VS. Lecture Notes in Computer Science Vol. 8066 https://doi.org/10.1007/978-3-642-40273-9_1

Brodal, G. S., Brodnik, A. & Davoodi, P. (2013). The encoding complexity of two dimensional range minimum data structures. In H. L. Bodlaender & G. F. Italiano (Eds.), Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (pp. 229-240). Springer VS. Lecture Notes in Computer Science Vol. 8125 https://doi.org/10.1007/978-3-642-40450-4_20

Odgaard, M. V., Moeslund, J. E., Bøcher, P. K., Dalgaard, T. & Svenning, J-C. (2013). The relative importance of geophysical constraints, amenity values, and farm-related factors in the dynamics of grassland set-aside. Agriculture, Ecosystems & Environment, 164, 286-291. https://doi.org/10.1016/j.agee.2012.09.009

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T., Ejrnæs, R., Odgaard, M. V. & Svenning, J-C. (2013). Topographically controlled soil moisture drives plant diversity patterns within grasslands. Biodiversity and Conservation, 22(10), 2151-2166. https://doi.org/10.1007/s10531-013-0442-3

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T., Odgaard, M. V., Nygaard, B. & Svenning, J-C. (2013). Topographically controlled soil moisture is the primary driver of local vegetation patterns across a lowland region. Ecosphere (Washington, D.C.), 4(7), [91]. https://doi.org/10.1890/ES13-00134.1

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T. & Svenning, J-C. (2013). Topography as a driver of local terrestrial vascular plant diversity patterns. Nordic Journal of Botany, 31(2), 129-144. https://doi.org/10.1111/j.1756-1051.2013.00082.x

Kejlberg-Rasmussen, C. & Brodal, G. S. (2012). Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. Leibniz International Proceedings in Informatics, 14, 112--123. https://doi.org/10.4230/LIPIcs.STACS.2012.112

Arge, L. A., Brodal, G. S. & Satti, S. R. (2012). External Memory Planar Point Location with Logarithmic Updates. Algorithmica, 63(1-2), 457-475. https://doi.org/10.1007/s00453-011-9541-2

Brodal, G. S., Nielsen, J. A. S. & Truelsen, J. (2012). Finger Search in the Implicit Model. Lecture Notes in Computer Science, 7676, 527-536 . https://doi.org/10.1007/978-3-642-35261-4_55

Brodal, G. S., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2012). Fully Persistent B-trees. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 23, 602-614. http://delivery.acm.org.ez.statsbiblioteket.dk:2048/10.1145/2100000/2095167/p602-brodal.pdf?ip=130.225.27.190&acc=ACTIVE%20SERVICE&CFID=163115493&CFTOKEN=91446070&__acm__=1356816735_08b5a98a0788aa0b0163ee8e9fc7dce3

Larsen, K. G. (2012). Higher Cell Probe Lower Bounds for Evaluating Polynomials. In FOCS'12: IEEE 53rd Annual Symposium on Foundations of Computer Science (pp. 293 - 301 ). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2012.21

Arge, L., Afshani, P. & Larsen, K. G. (2012). Higher-dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model. In Proceedings of the 2012 Symposuim on Computational Geometry (pp. 323-338). Association for Computing Machinery. https://doi.org/10.1145/2261250.2261299

Larsen, K. G. & Pagh, R. (2012). I/O-Efficient Data Structures for Colored Range and Prefix Reporting. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 23, 583-592. http://siam.omnibooksonline.com/2012SODA/index.html

Kejlberg-Rasmussen, C., Tsakalidis, K. & Tsichlas, K. (2012). I/O-Efficient Dynamic Planar Range Skyline Queries. arXiv.org. http://arxiv.org/abs/1207.2341

Arge, L. & Larsen, K. G. (2012). I/O-Efficient Spatial Data Structures for Range Queries. SIGSPATIAL Special, 4(2), 2-7. http://www.sigspatial.org/sigspatial-special-issues/SIGSPATIALSpecialVol4No2.pdf

Larsen, K. G. & Nguyen, H. L. (2012). Improved Range Searching Lower Bounds. In Proceedings of the 2012 symposuim on Computational Geometry: Chapel Hill, NC, USA — June 17 - 20, 2012 (pp. 171-178). Association for Computing Machinery. https://doi.org/10.1145/2261250.2261275

Afshani, P. (2012). Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. In Proceedings of the 2012 Symposuim on Computational Geometry, SoCG (pp. 339-346 ). Association for Computing Machinery. https://doi.org/10.1145/2261250.2261301

Chan, T. M., Durocher, S., Skala, M. & Wilkinson, B. T. (2012). Linear-Space Data Structures for Range Minority Query in Arrays.

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

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. & Zeh, N. (2012). Lower Bounds for Sorted Geometric Queries in the I/O Model. Lecture Notes in Computer Science, 7501, 48-59 . https://doi.org/10.1007/978-3-642-33090-2_6

Brodal, G. S., Davoodi, P. & Rao, S. S. (2012). On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica, 63(4), 815-830. https://doi.org/10.1007/s00453-011-9499-0

Brodal, G. S., Moruz, G. & Negoescu, A. (2012). OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Lecture Notes in Computer Science, 7164, 164-175 . https://doi.org/10.1007/978-3-642-29116-6_14

Brodal, G. S., Lagogiannis, G. & Tarjan, R. E. (2012). Strict fibonacci heaps. In STOC '12 Proceedings of the 44th symposium on Theory of Computing (pp. 1177-1184 ). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214082

Larsen, K. G. (2012). The Cell Probe Complexity of Dynamic Range Counting. In STOC’12 : Proceedings of the 44th symposium on Theory of Computing (pp. 85-94). Association for Computing Machinery. https://doi.org/10.1145/2213977.2213987

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/

Moeslund, J. E. (2012). The role of topography in determining local plant diversity patterns across Denmark. Aarhus University, Faculty of Science and Technology.

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

Afshani, P., Agarwal, P. K., Arge, L. A., Larsen, K. G. & Phillips, J. M. (2011). (Approximate) Uncertain Skylines. In Proceedings of the 14th International Conference on Database Theory (pp. 186-196). Association for Computing Machinery. https://doi.org/10.1145/1938551.1938576

Chan, T. M. & Wilkinson, B. T. (2011). Bichromatic Line Segment Intersection Counting in O(n sqrt{log n}) Time. Paper presented at Canadian Conference on Computational Geometry, Canada. http://www.cccg.ca/proceedings/2011/papers/paper83.pdf

Brodal, G. S. & Tsakalidis, K. (2011). Dynamic Planar Range Maxima Queries. Lecture Notes in Computer Science, 6755 , 256-267. https://doi.org/10.1007/978-3-642-22006-7_22

Kutz, M., Brodal, G. S., Kaligosi, K. & Katriel, I. (2011). Faster Algorithms for Computing Longest Common Increasing Subsequences. Journal of Discrete Algorithms, 9(4), 314-325. https://doi.org/10.1016/j.jda.2011.03.013

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

Brodal, G. S., Greve, M., Pandey, V. & Satti, S. R. (2011). Integer Representations towards Efficient Counting in the Bit Probe Model. Lecture Notes in Computer Science, 6648, 206-217. https://doi.org/10.1007/978-3-642-20877-5_22

Larsen, K. G. (2011). On Range Searching in the Group Model and Combinatorial Discrepancy. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 542-549). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2011.14

Displaying results 151 to 200 out of 310

4

Revised 16.11.2021 -