Publications

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

Groom, G. B., Bladt, J., Moeslund, J. E. & Ejrnæs, R. (2018). Developing biodiversity proxies: Technical description. Aarhus Universitet, DCE – Nationalt Center for Miljø og Energi ©. Technical Report from DCE – Danish Centre for Environment and Energy Nr. 123

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

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.

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.

Afshani, P. & Tsakalidis, K. (2018). Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. Algorithmica, 80(11), 3192-3206. https://doi.org/10.1007/s00453-017-0376-3

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

Bury, M., Schwiegelshohn, C. & Sorella, M. (2018). Sketch 'em all: Fast approximate similarity search for dynamic data streams. WSDM 2018 - Proceedings of the 11th ACM International Conference on Web Search and Data Mining, 72-80. https://doi.org/10.1145/3159652.3159694

Chakraborty, D., Kamma, L. & Larsen, K. G. (2018). Tight cell probe bounds for succinct boolean matrix-Vector multiplication. I STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (s. 1297-1306). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188830

Clifford, R., Grønlund, A., Larsen, K. G. & Starikovskaya, T. (2018). Upper and lower bounds for dynamic data structures on strings. I R. Niedermeier & B. Vallée (red.), 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 (Bind 96, s. 22:1-22:14). artikel 22 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2018.22

Ejrnæs, R., Moeslund, J. E., Brunbjerg, A. K., Groom, G. B. & Bladt, J. (2018). Videreudvikling af lokal bioscore for biodiversitetskortet for Danmark. Aarhus Universitet, DCE – Nationalt Center for Miljø og Energi ©. Teknisk rapport fra DCE - Nationalt Center for Miljø og Energi Bind 122 http://dce2.au.dk/pub/TR122.pdf

Larsen, K. G. & Nielsen, J. B. (2018). Yes, There is an Oblivious RAM Lower Bound! I H. Shacham & A. Boldyreva (red.), Advances in Cryptology -- CRYPTO 2018 (s. 523-542). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_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

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

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

Brodal, G. S. & Mampentzidis, K. (2017). Cache oblivious algorithms for computing the triplet distance between trees. I K. Pruhs & C. Sohler (red.), 25th European Symposium on Algorithms, ESA 2017 (Bind 87, s. 21:1--21:14). artikel 21 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.21

Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017). Cross-Referenced dictionaries and the limits of write optimization. I P. N. Klein (red.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (s. 1523-1532). Association for Computing Machinery.

Eenberg, K., Larsen, K. G. & Yu, H. (2017). DecreaseKeys are expensive for external memory priority queues. I STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Bind Part F128415, s. 1081-1093). Association for Computing Machinery. https://doi.org/10.1145/3055399.3055437

Brunbjerg, A. K., Bruun, H. H., Moeslund, J. E., Sadler, J. P., Svenning, J-C. & Ejrnæs, R. (2017). Ecospace: a unified framework for understanding variation in terrestrial biodiversity. Basic and Applied Ecology, 18, 86-94. https://doi.org/10.1016/j.baae.2016.09.002

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

Peterka, T., Hájek, M., Jiroušek, M., Jiménez-Alfaro, B., Aunina, L., Bergamini, A., Dítě, D., Felbaba-Klushyna, L., Graf, U., Hájková, P., Hettenbergerová, E., Ivchenko, T. G., Jansen, F., Koroleva, N. E., Lapshina, E. D., Lazarević, P. M., Moen, A., Napreenko, M. G., Pawlikowski, P. ... Chytrý, M. (2017). Formalized classification of European fen vegetation at the alliance level. Applied Vegetation Science, 20(1), 124-142. https://doi.org/10.1111/avsc.12271

Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T. M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S. & Wilkinson, B. T. (2017). How to Morph Planar Graph Drawings. S I A M Journal on Computing, 46(2), 824-852. https://doi.org/10.1137/16M1069171

Madalgo, P. A., Barbay, J. & Chan, T. M. (2017). Instance-optimal geometric algorithms. Journal of the ACM, 64(1), artikel 3. https://doi.org/10.1145/3046673

Freksen, C. B. & Larsen, K. G. (2017). On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. I O. Yoshio & T. Tokuyama (red.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (s. 32:1-32:12). artikel 32 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2017.32

Larsen, K. G. & Nelson, J. (2017). Optimality of the Johnson-Lindenstrauss Lemma. I Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017 (s. 633-638). artikel 8104096 https://doi.org/10.1109/FOCS.2017.64

Afshani, P. & Van Duijn, I. (2017). Permuting and batched geometric lower bounds in the I/O model. I K. Pruhs & C. Sohler (red.), 25th European Symposium on Algorithms, ESA 2017 (Bind 87, s. 2:1-2:13). artikel 2 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. https://doi.org/10.4230/LIPIcs.ESA.2017.2

Moeslund, J. E., Brunbjerg, A. K., Clausen, K., Dalby, L., Fløjgaard, C., Juel, A. & Lenoir, J. (2017). Using dark diversity and plant characteristics to guide conservation and restoration. Journal of Applied Ecology, 54(6), 1730-1741. https://doi.org/10.1111/1365-2664.12867

Chan, T. M. & Wilkinson, B. T. (2016). Adaptive and approximate orthogonal range counting. ACM Transactions on Algorithms, 12(4), 45:1-45:15. artikel 45. https://doi.org/10.1145/2830567

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

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. & Nielsen, J. A. S. (2016). Data Structure Lower Bounds for Document Indexing Problems. I I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani & D. Sangiorgi (red.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Bind 55, s. 93:1-93:15). artikel 93 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. https://doi.org/10.4230/LIPIcs.ICALP.2016.93

Brunbjerg, A. K., Bladt, J., Brink, M., Fredshavn, J. R., Mikkelsen, P., Moeslund, J. E., Nygaard, B., Skov, F. & Ejrnæs, R. (2016). Development and implementation of a High Nature Value (HNV) farming indicator for Denmark. Ecological Indicators, 61(2), 274-281. adv. onlinepublikation. https://doi.org/10.1016/j.ecolind.2015.09.027

Brodal, G. S. (2016). External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. I N. Ollinger & H. Vollmer (red.), 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) (Bind 47, s. 23:1-23:14). artikel 23 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. https://doi.org/10.4230/LIPIcs.STACS.2016.23

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

Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016). How to prove knowledge of small secrets. I J. Katz & M. Robshaw (red.), Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Bind 9816, s. 478-498). Springer VS. https://doi.org/10.1007/978-3-662-53015-3_17

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

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/

Larsen, K. G. & Nelson, J. (2016). The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. Leibniz International Proceedings in Informatics, 55, 82:1 - 82:11. https://doi.org/10.4230/LIPIcs.ICALP.2016.82

Grønlund, A. & Larsen, K. G. (2016). Towards Tight Lower Bounds for Range Reporting on the RAM. Leibniz International Proceedings in Informatics, 55, 92:1 - 92:12. https://doi.org/10.4230/LIPIcs.ICALP.2016.92

Stølting Brodal, G., Davoodi, P., Lewenstein, M., Raman, R. & Satti, S. R. (2016). Two dimensional range minimum queries and Fibonacci lattices. Theoretical Computer Science, 638, 33-43. https://doi.org/10.1016/j.tcs.2016.02.016

Brody, J. E. & Larsen, K. G. (2015). Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures. Theory of Computing, 11(19), 471-489. https://doi.org/10.4086/toc.2015.v011a019

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

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

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.

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

Wilkinson, B. T. (2015). Exploring the Problem Space of Orthogonal Range Searching. Department of Computer Science, Aarhus University.

de Berg, M., Tsirogiannis, C. & Wilkinson, B. T. (2015). Fast computation of categorical richness on raster data sets and related problems. I GIS '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems artikel 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. I Proceedings. Workshop on Massive Data Algorithmics (MASSIVE) (s. 86-107)

Viser resultater 101 til 150 ud af 343

Forrige