Aarhus University Seal

Publications

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
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
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.
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.
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., 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
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
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
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
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
Belazzougui, D., Brodal, G. S. & Nielsen, J. A. S. (2014). Expected linear time sorting for word size Ω(log2 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
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
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
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 University, DCE - Danish Centre for Environment and Energy. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 112
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
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
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
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
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
Brodal, G. S., Sioutas, S., Pantazos, K. & Zaroliagis, C. D. (2015). D2-tree: A new overlay with deterministic bounds. Algorithmica, 72(3), 860-883. https://doi.org/10.1007/s00453-014-9878-4
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
Brunbjerg, A. K., Bruun, H. H., Moeslund, J. E., Sadler, J. P., Svenning, J.-C. & Ejrnæs, R. (2015). Ecospace - a unified framework for understanding variation in biodiversity. Poster session presented at Biodiversitetssymposiet 2015, Aarhus , Denmark.
Brunbjerg, A. K., Bruun, H. H., Moeslund, J. E., Sadler, J. P., Svenning, J.-C. & Ejrnæs, R. (2015). Ecospace - a unified framework for understanding variation in biodiversity. Poster session presented at International Congress for Conservation Biology, Montpellier, France.
Chytrý, M., Hennekens, S. M., Jiménez-Alfaro, B., Knollová, I., Dengler, J., Jansen, F., Landucci, F., Schaminée, J. H. J., Aćić, S., Agrillo, E., Ambarlı, D., Angelini, P., Apostolova, I., Attorre, F., Berg, C., Bergmeier, E., Biurrun, I., Botta-Dukát, Z., Brisse, H. ... Yamalov, S. (2015). European Vegetation Archive (EVA): an integrated database of European vegetation plots. Applied Vegetation Science, 19(1), 173-180. https://doi.org/10.1111/avsc.12191
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
de Berg, M., Tsirogiannis, C. & Wilkinson, B. T. (2015). Fast computation of categorical richness on raster data sets and related problems. In GIS '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Article 18 https://doi.org/10.1145/2820783.2820825
de Berg, M., Tsirogiannis, C. & Wilkinson, B. (2015). Fast Computation of Categorical Richness on Raster Data Sets and Related Problems. In Proceedings. Workshop on Massive Data Algorithmics (MASSIVE) (pp. 86-107)
Goswami, M., Jørgensen, A. G., Larsen, K. G. & Pagh, R. (2015). Approximate Range Emptiness in Constant Time and Optimal Space. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15 (pp. 769-775). Society for Industrial and Applied Mathematics. http://dl.acm.org/citation.cfm?id=2133036&picked=prox