Find

For students
For PhDs
For employees

Institut for Datalogi

Publications

Moeslund, J. E., Arge, L., Bøcher, P. K., Nygaard, B. & Svenning, J-C. (2009). Konsekvenser af "coastal squeezing" for plantesamfund på strandenge i Danmark.

Tsourakakis, C. E., Mitzenmacher, M., Larsen, K. G., Blasiok, J., Lawson, B., Nakkiran, P. & Nakos, V. (2018). Predicting Positive and Negative Links with Noisy Queries: Theory Practice. arXiv.org. http://arxiv.org/abs/1709.07308

Freksen, C. B., Kamma, L. & Larsen, K. G. (2018). Fully Understanding the Hashing Trick. arXiv.org. http://arxiv.org/abs/1805.08539

Moeslund, J. E. (2016, jul. 15). Small steps for man, giant leaps for plants. http://blogs.springer.com/lst/small-steps-man-giant-leaps-plants/

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 s., Notat fra DCE - Nationalt Center for Miljø og Energi

Bladt, J., Brunbjerg, A. K., Moeslund, J. E., Petersen, A. H. & Ejrnæs, R., (2016). Appendix 6: Opdatering af biodiversitetskortet for Danmark 2015, 10 s., Notat fra DCE - Nationalt Center for Miljø og Energi

Moeslund, J. E. & Helsing, F., (2020). Indsamlingsforbud for danske dagsommerfugle, 13 s., Notat fra DCE - Nationalt Center for Miljø og Energi Bind 2020 Nr. 24 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notatet_2020/N2020_24.pdf

Moeslund, J. E., (2021). Kortlægning af beskyttede dagsommerfugle ved Natura 2000-område: Bygholm Ådal, 5 s., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Bind 2021 Nr. 22 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notater_2021/N2021_22.pdf

Moeslund, J. E., (2021). Oversigter over forekomsten af rødlistede arter, 212 s., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Bind 2021 Nr. 24 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notater_2021/N2021_24.pdf

Høye, T. T., Olsen, K., Moeslund, J. E., Strandberg, M. T. & Kjær, C., (2019). Oversigt og status for de danske sommerfuglearter, 8 s., Notat fra DCE - Nationalt Center for Miljø og Energi https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notater_2019/Status_danske_sommerfugle.pdf

Moeslund, J. E. & Helsing, F., (2020). Vurdering af WWF’s anbefalinger om at udvide indsamlingsforbud af dagsommerfugle i Danmark, 5 s., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Bind 2020 Nr. 54 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notatet_2020/N2020_54.pdf

Moeslund, J. E. & Helsing, F., (2020). Vurdering og genvurdering af effekten af et indsamlingsforbud på bestemte dagsommerfuglearter, 6 s., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Bind 2020 Nr. 47 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notatet_2020/N2020_47.pdf

Dalsgaard, P., Pedersen, B. P., Dimke, H., Møller, N. M., Normand, S., Bjørk, R., Bille, M. & Larsen, K. G. (2018). Opholdskrav i skatteaftale hæmmer dansk forskning. Politiken, (Sektion 2 (Kultur)), 7.

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

Goodrich, M. T., Sitchinava, N. & Zhang, Q. (2011). Sorting, Searching, and Simulation in the MapReduce Framework. http://arxiv.org/pdf/1101.1902.pdf

Brodal, G. S., Fagerberg, R., Mailund, T., Pedersen, C. N. S. & Phillips, D. (2003). Speeding Up Neighbour-Joining Tree Construction.

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

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

Larsen, K. G., Starup, J. L. & Steensgaard, J. (2021). Further Unifying the Landscape of Cell Probe Lower Bounds. Afhandling præsenteret på Happening virtually , -. https://cs.au.dk/~larsen/papers/FurtherUnifying.pdf

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

Wilkinson, B. T. (2015). Revisiting visibility in the plane. Afhandling præsenteret på International Symposium on Computational Geometry, Eindhoven, Holland. http://www.madalgo.au.dk/~bw/papers/2015W.pdf

Afshani, P., Arge, L. A. & Larsen, K. D. (2010). I/O-efficient Orthogonal Range Reporting in Three and Higher Dimensions. Abstract fra Workshop on Massive Data Algorithms, Snowbird, USA.

Freksen, C. B., Kamma, L. & Larsen, K. G. (2018). Fully Understanding the Hashing Trick. 1. Poster session præsenteret på Neural Information Processing Systems Conference, Montreal, Canada.

Moeslund, J. E., Brunbjerg, A. K., Clausen, K. K., Dalby, L., Fløjgaard, C., Juel, A. & Lenoir, J. (2015). Dark diversity illuminates the dim side of restoration. Poster session præsenteret på International Congress for Conservation Biology, Montpellier, Frankrig.

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 præsenteret på Biodiversitetssymposiet 2015, Aarhus , Danmark.

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 præsenteret på International Congress for Conservation Biology, Montpellier, Frankrig.

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 præsenteret på Biodiversitetssymposium 2013, København, Danmark.

Moeslund, J. E., Arge, L. A., Bøcher, P. K., Nygaard, B. & Svenning, J-C. (2009). The impacts of coastal squeezing on salt-meadow plant communities in Denmark. Poster session præsenteret på Beyond Kyoto: Addressing the challenges of climate change, Aarhus, Danmark.

Brodal, G. S. (2008). Cache-Oblivious Sorting. I M-Y. Kao (red.), Encyclopedia of Algorithms (Bind 3, s. 126-129). Springer. https://doi.org/10.1007/978-0-387-30162-4_63

Bladt, J., Brunbjerg, A. K., Moeslund, J. E., Petersen, A. H. & Ejrnæs, R. (2016). Opdatering af lokal bioscore for biodiversitetskortet for Danmark 2015. I DCE rapport http://dce2.au.dk/pub/TR74.pdf

Afshani, P. & Cheng, P. (2020). 2D generalization of fractional cascading on axis-aligned planar subdivisions. I Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (s. 716-727). artikel 9317953 IEEE. https://doi.org/10.1109/FOCS46700.2020.00072

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

Bringmann, K., Grønlund, A. & Larsen, K. G. (2017). A Dichotomy for Regular Expression Membership Testing. I Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017 (s. 307-318). artikel 8104068 IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2017.36

Jiang, S. & Larsen, K. G. (2019). A Faster External Memory Priority Queue with DecreaseKeys. I T. M. Chan (red.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Bind PRDA19, s. 1331-1343). Society for Industrial and Applied Mathematics. https://epubs.siam.org/doi/pdf/10.1137/1.9781611975482.81

Brodal, G. S. & Jørgensen, A. G. (2007). A Linear Time Algorithm for the k Maximal Sums Problem. I L. Kucera & A. Kucera (red.), Mathematical Foundations of Computer Science 2007: 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007 Proceedings (s. 442-453). Springer. https://doi.org/10.1007/978-3-540-74456-6_40

Afshani, P. (2021). A Lower Bound for Dynamic Fractional Cascading. I ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 (s. 2229-2248). Association for Computing Machinery. https://doi.org/10.5555/3458064.3458197

Afshani, P., van Duijn, I., Killmann, R. & Nielsen, J. S. (2020). A lower bound for jumbled indexing. I S. Chawla (red.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (s. 592-606). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975994.36

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

Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C., Sitchinava, N. & Tsirogiannis, C. (2017). An efficient algorithm for the 1D total visibility-index problem. I S. Fekete & V. Ramachandran (red.), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Bind PRAL17, s. 218-231). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974768.18

Schwiegelshohn, C. & Sheikh-Omar, O. A. (2022). An Empirical Evaluation of k-Means Coresets. I S. Chechik, G. Navarro, E. Rotenberg & G. Herman (red.), 30th Annual European Symposium on Algorithms, ESA 2022 (s. 84:1-84:17). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2022.84

Cohen-Addad, V., Saulpic, D. & Schwiegelshohn, C. (2021). A new coreset framework for clustering. I S. Khuller & V. V. Williams (red.), STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (s. 169-182). Association for Computing Machinery. https://doi.org/10.1145/3406325.3451022

Afshani, P. (2019). A new lower bound for semigroup orthogonal range searching. I G. Barequet & Y. Wang (red.), 35th International Symposium on Computational Geometry, SoCG 2019 artikel 3 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.3

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

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

Brodal, G. S. & Gasieniec, L. (1996). Approximate dictionary queries. I D. Hirschberg & G. Myers (red.), Combinatorial Pattern Matching: 7th Annual Symposium, CPM 96 Laguna Beach, California, June 10–12, 1996 Proceedings (s. 65-74). Springer. https://doi.org/10.1007/3-540-61258-0_6

Goswami, M., Jørgensen, A. G., Larsen, K. G. & Pagh, R. (2015). Approximate Range Emptiness in Constant Time and Optimal Space. I Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15 (s. 769-775). Society for Industrial and Applied Mathematics. http://dl.acm.org/citation.cfm?id=2133036&picked=prox

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

Yon, J., Won, S. B., Cheng, S. W., Cheong, O. & Wilkinson, B. T. (2016). Approximating convex shapes with respect to symmetric difference under homotheties. I S. Fekete & A. Lubiw (red.), 32nd International Symposium on Computational Geometry, SoCG 2016 (Bind 51, s. 63.1-63.15). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.63

Afshani, P., de Berg, M., Buchin, K., Gao, J., Loffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Wang, H-T. (2021). Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. I S. M. LaValle, M. Lin, T. Ojala, D. Shell & J. Yu (red.), Algorithmic Foundations of Robotics XIV-Part A: Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics Springer. https://arxiv.org/abs/2005.02530

Berglin, E. & Brodal, G. S. (2017). A simple greedy algorithm for dynamic graph orientation. I Y. Okamoto & T. Tokuyama (red.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (s. 12:1-12:12). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2017.12

Viser resultater 1 til 50 ud af 343

1

Revideret 17.04.2023