Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Chan, T. M., Durocher, S., Skala, M. & Wilkinson, B. T. (2015). Linear-Space Data Structures for Range Minority Query in Arrays. Algorithmica, 72(4), 901-913. https://doi.org/10.1007/s00453-014-9881-9

Moeslund, J. E., Ejrnæs, R. & Wind, P. (2015). Manual til rødlistevurdering af danske arter 2013-2019. Aarhus Universitet, DCE – Nationalt Center for Miljø og Energi ©. Teknisk rapport fra DCE - Nationalt Center for Miljø og Energi No. 54

Brunbjerg, A. K., Bladt, J., Moeslund, J. E. & Ejrnæs, R. (2015). Naturen på kort - nye værktøjer målretter indsatsen for truede arter. Aktuel Naturvidenskab, (3), 12-15.

Clifford, R., Jørgensen, A. G. & Larsen, K. G. (2015). New Unconditional Hardness Results for Dynamic and Online Problems. In 56th IEEE Symposium on Foundations of Computer Science (FOCS) Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS IEEE Computer Society Press. http://arxiv.org/pdf/1504.01836v1.pdf

Larsen, K. G., Munro, J. I., Nielsen, J. S. & Thankachan, S. V. (2015). On hardness of several string indexing problems. Theoretical Computer Science, 582, 74-82. https://doi.org/10.1016/j.tcs.2015.03.026

Brodal, G. S., Moruz, G. & Negoescu, A. (2015). OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory of Computing Systems, 56 (1). https://doi.org/10.1007/s00224-012-9427-y

Wilkinson, B. T. (2015). Revisiting visibility in the plane. Paper presented at International Symposium on Computational Geometry, Eindhoven, Netherlands. http://www.madalgo.au.dk/~bw/papers/2015W.pdf

Afshani, P. & Sitchinava , N. (2015). Sorting and Permuting without Bank Conflicts on GPUs. In N. Bansal & I. Finocchi (Eds.), Algorithms – ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14–16, 2015, Proceedings (pp. 13-24). Springer VS. https://doi.org/10.1007/978-3-662-48350-3_2

Son, W. & Afshani, P. (2015). Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. In R. Jain, S. Jain & F. Stephan (Eds.), Theory and Applications of Models of Computation: 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (pp. 189-199 ). Springer VS. https://doi.org/10.1007/978-3-319-17142-5

Brodal, G. S., Nielsen, J. A. S. & Truelsen, J. (2015). Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. In F. Dehne, J-R. Sack & U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Proceedings (pp. 91-102). Springer VS. https://doi.org/10.1007/978-3-319-21840-3_8

Larsen, K. G., Nelson, J. & Nguyen, H. L. (2015). Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. In R. Servedio & R. Rubinfeld (Eds.), Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15 (pp. 803-812). Association for Computing Machinery. https://doi.org/10.1145/2746539.2746542

Johannsen, V. K., Rojas, S. K., Brunbjerg, A. K., Schumacher, J., Bladt, J., Bladt, J., Nyed, P., Moeslund, J. E., Nord-Larsen, T. & Ejrnæs, R. (2015). Udvikling af et High Nature Value - HNV-skovkort for Danmark: IGN Rapport November 2015, Institut for Geovidenskab og Naturforvaltning, Københavns Universitet, Frederiksberg.

Wilkinson, B. T. (2014). Amortized bounds for dynamic orthogonal range reporting. In A. S. Schulz & D. Wagner (Eds.), Algorithms - ESA 2014: 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings (pp. 842-856). Springer. https://doi.org/10.1007/978-3-662-44777-2_69

Ejrnæs, R., Moeslund, J. E. & Bladt, J., (2014). Analyse om omfang af biodiversitet repræsenteret i de udpegede Natura 2000 områder på land, 16 p., Notat fra DCE - Nationalt Center for Miljø og Energi

Ejrnæs, R., Petersen, A. H., Bladt, J., Bruun, H. H., Moeslund, J. E., Wiberg-Larsen, P. & Rahbek, C. (2014). Biodiversitetskort for Danmark: Udviklet i samarbejde mellem Center for Makroøkologi, Evolution og Klima på Københavns Universitet og Institut for Bioscience ved Aarhus Universitet. Aarhus Universitet, DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 112

Afshani, P., Sheng, C., Tao, Y. & Wilkinson, B. T. (2014). Concurrent range reporting in two-dimensional space. In C. Chekuri (Ed.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (pp. 983-994). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Afshani, P., Chan, T. M. & Tsakalidis, K. (2014). Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. In J. Esparza , P. Fraigniaud, T. Husfeldt & E. Koutsoupias (Eds.), Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I (pp. 77-88 ). Springer VS. https://doi.org/10.1007/978-3-662-43948-7_7

Stølting Brodal, G., Kaporis, A. C., Papadopoulos, A. N., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2014). Dynamic 3-sided planar range queries with expected doubly-logarithmic time. Theoretical Computer Science, 526(March), 58-74. https://doi.org/10.1016/j.tcs.2014.01.014

Belazzougui, D., Brodal, G. S. & Nielsen, J. A. S. (2014). Expected linear time sorting for word size Ω(log² n log log n). In R. Ravi & I. L. Gørtz (Eds.), Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings (pp. 26-37). Springer VS. https://doi.org/10.1007/978-3-319-08404-6_3

Afshani, P. (2014). Fast Computation of Output-Sensitive Maxima in a Word RAM. In C. Chekuri (Ed.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (pp. 1414-1423). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Odgaard, M. V., Moeslund, J. E., Dalgaard, T., Bøcher, P. K. & Svenning, J-C. (2014). Human-driven topographic effects on the distribution of forest in a flat, lowland agricultural region. Journal of Geographical Sciences, 24(1), 76-92. https://doi.org/10.1007/s11442-014-1074-6

Brodal, G. S., Greve, M., Pandy, V. & Satti, S. R. (2014). Integer representations towards efficient counting in the bit probe model. Journal of Discrete Algorithms, 26(May), 34–44. https://doi.org/10.1016/j.jda.2013.11.001

Afshani, P. & Sitchinava, N. (2014). I/O-efficient range minima queries. In R. Ravi & I. L. Gørtz (Eds.), Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings (pp. 1-12). Springer VS. https://doi.org/10.1007/978-3-319-08404-6_1

Chan, T. M., Durocher, S., Larsen, K. G., Morrison, J. & Wilkinson, B. T. (2014). Linear-Space Data Structures for Range Mode Query in Arrays. Theory of Computing Systems, 55(4), 719-741. https://doi.org/10.1007/s00224-013-9455-2

Alstrup, S., Bistrup Halvorsen, E. & Larsen, K. G. (2014). Near-optimal labeling schemes for nearest common ancestors. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 972-982). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902108771&partnerID=8YFLogxK

Larsen, K. G., Munro, J. I., Nielsen, J. A. S. & Thankachan, S. V. (2014). On Hardness of Several String Indexing Problems. In A. Kulikov, S. O. Kuznetsov & P. Pevzner (Eds.), Combinatorial Pattern Matching: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings (pp. 242-251 ). Springer VS. https://doi.org/10.1007/978-3-319-07566-2_25

Larsen, K. G. (2014). ON range searching in the group model and combinatorial discrepancy. S I A M Journal on Computing, 43(2), 673-686. https://doi.org/10.1137/120865240

Holt, M. K., Johansen, J. & Brodal, G. S. (2014). On the Scalability of Computing Triplet and Quartet Distances. In C. C. McGeoch & U. Meyer (Eds.), 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 9-19). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973198.2

Afshani, P. & Tsakalidis, K. (2014). Optimal deterministic shallow cuttings for 3D dominance ranges. In C. Chekuri (Ed.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (pp. 1389-1398 ). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Brodal, G. S. & Larsen, K. G. (2014). Optimal Planar Orthogonal Skyline Counting Queries. In R. Ravi & I. L. Gørtz (Eds.), Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Denmark. Proceedings (pp. 110-121). Springer VS. https://doi.org/10.1007/978-3-319-08404-6_10

Sand, A., Holt, M. K., Johansen, J., Brodal, G. S., Mailund, T. & Pedersen, C. N. S. (2014). tqDist: A Library for Computing the Quartet and Triplet Distances Between Binary and General Trees. Bioinformatics, 30(4), 2079-2080. https://doi.org/10.1093/bioinformatics/btu157

Nygaard, B., Elmeros, M., Holm, T. E., Kahlert, J. A., Moeslund, J. E., Therkildsen, O. R., Søgaard, B. & Ejrnæs, R. (2014). Vindmøller på § 3-beskyttede naturarealer: Potentielle konsekvenser for biodiversitet, fugle og flagermus. Aarhus Universitet, DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 115 http://dce2.au.dk/pub/SR115.pdf

Kejlberg-Rasmussen, C., Kopelowitz, T., Pettie, S. & Porat, E. (2014). Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. (1407.6755v1 ed.) arXiv.org. http://arxiv.org/abs/1407.6755v1

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. 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 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

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

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. 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

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.

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. http://knowledgecenter.siam.org/0236-000081/~~PdfSource/0

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. https://doi.org/10.1145/2488608.2488707

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. https://doi.org/10.1007/978-3-642-40450-4_20

Displaying results 151 to 200 out of 343

4

Revised 17.04.2023