Find

For students
For PhDs
For employees

Institut for Datalogi

Publications

Andet bidrag

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

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/

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

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

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

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

Bidrag til artikel

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.

Arbejdspapir (Working Paper)

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

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

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.

Bidrag til konference

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

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

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

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.

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.

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.

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.

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.

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.

Bidrag til bog-antologi

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

Zardbani, F., Afshani, P. & Karras, P. (2020). Revisiting the theory and practice of database cracking. I A. Bonifati, Y. Zhou, M. A. Vaz Salles, A. Bohm, D. Olteanu, G. Fletcher, A. Khan & B. Yang (red.), Advances in Database Technology - EDBT 2020: 23rd International Conference on Extending Database Technology, Proceedings (s. 415-418). openproceedings.org. https://doi.org/10.5441/002/edbt.2020.46

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

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

Westergaard, M., Kristensen, L. M., Brodal, G. S. & Arge, L. (2007). The ComBack Method - Extending Hash Compaction with Backtracking. I Petri Nets and Other Models of Concurrency – ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007. Proceedings (s. 455-464). Springer. https://doi.org/10.1007/978-3-540-73094-1_26

Stissing, M., Mailund, T., Pedersen, C. N. S., Brodal, G. S. & Fagerberg, R. (2007). Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. I Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC) (s. 91-100)

Stissing, M., Pedersen, C. N. S., Mailund, T. & Brodal, G. S. (2007). Computing the Quartet Distance between Evolutionary Trees of Bounded Degree. I Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC) (s. 101-110)

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

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

Schmidt, M., Schwiegelshohn, C. & Sohler, C. (2020). Fair Coresets and Streaming Algorithms for Fair k-means. I E. Bampis & N. Megow (red.), Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Revised Selected Papers (s. 232-251). Springer. https://doi.org/10.1007/978-3-030-39479-0_16

Larsen, K. G. (2019). Constructive Discrepancy Minimization with Hereditary L2 Guarantees. I R. Niedermeier & C. Paul (red.), 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) artikel 48 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. https://doi.org/10.4230/LIPIcs.STACS.2019.48

Larsen, K. G., Pagh, R. & Tetek, J. (2021). CountSketches, Feature Hashing and the Median of Three. I M. Meila & T. Zhang (red.), Proceedings of the 38th International Conference on Machine Learning, ICML 2021 (s. 6011-6020) http://proceedings.mlr.press/v139/larsen21a.html

Larsen, K. G., Weinstein, O. & Yu, H. (2018). Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. I M. Henzinger, D. Kempe & I. Diakonikolas (red.), STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (s. 978-989). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188790

Larsen, K. G., Obremski, M. & Simkin, M. (2023). Distributed Shuffling in Adversarial Environments. I K-M. Chung (red.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 artikel 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.10

Larsen, K. G. & Williams, R. (2017). Faster Online Matrix-Vector Multiplication. I P. N. Klein (red.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (Bind PRDA17, s. 2182-2189). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782

Larsen, K. G., Nelson, J., Nguyen, H. L. & Thorup, M. (2016). Heavy hitters via cluster-preserving clustering. I Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 (s. 61-70). artikel 7782918 IEEE. https://doi.org/10.1109/FOCS.2016.16

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

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

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. I R. Pass & K. Pietrzak (red.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (s. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Larsen, K. G., Malkin, T., Weinstein, O. & Yeo, K. (2020). Lower Bounds for Oblivious Near-Neighbor Search. I S. Chawla (red.), SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms (s. 1116-1134). Society for Industrial and Applied Mathematics. https://doi.org/10.5555/3381089.3381157

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

Viser resultater 1 til 50 ud af 343

1

Revideret 17.04.2023