Publications

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

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

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

Brodal, G. S., Kejlberg-Rasmussen, C. & Truelsen, J. (2010). A Cache-Oblivious Implicit Dictionary with the Working Set Property. Lecture Notes in Computer Science, 6507, 37-48. https://doi.org/10.1007/978-3-642-17514-5_4

Brodal, G. S. & Husfeldt, T. (1996). A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth. Department of Computer Science, Aarhus University. BRICS-RS No. 96-1 http://www.brics.dk/RS/96/1/BRICS-RS-96-1.pdf

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

Hájek, M., Jimenez-Alfaro, B., Hájek, O., Brancaleoni, L., Cantonati, M., Carbognani, M., Dedić, A., Dítě, D., Gerdol, R., Hájková, P., Horsáková, V., Jansen, F., Kamberović, J., Kapfer, J., Kolari, T. H. M., Lamentowicz, M., Lazarević, P. M., Mašić, E., Moeslund, J. E. ... Biţă-Nicolae, C. (2021). A European map of groundwater pH and calcium. Earth System Science Data, 13, 1089-1105. https://doi.org/10.5194/essd-13-1089-2021

Jiang, S. & Larsen, K. G. (2019). A Faster External Memory Priority Queue with DecreaseKeys. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. PRDA19, pp. 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. In L. Kucera & A. Kucera (Eds.), Mathematical Foundations of Computer Science 2007: 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007 Proceedings (pp. 442-453). Springer. Lecture Notes in Computer Science Vol. 4708 https://doi.org/10.1007/978-3-540-74456-6_40

Afshani, P. (2021). A Lower Bound for Dynamic Fractional Cascading. In SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2229-2248). Association for Computing Machinery. https://doi.org/10.5555/3458064.3458197

Brodal, G. S., Träff, J. L. & Zaroliagis, C. D. (1998). A Parallel Priority Queue with Constant Time Operations. Journal of Parallel and Distributed Computing, 49(1), 4-21. https://doi.org/10.1006/jpdc.1998.1425

Berglin, E. & Brodal, G. S. (2020). A Simple Greedy Algorithm for Dynamic Graph Orientation. Algorithmica, 82(2), 245-259. https://doi.org/10.1007/s00453-018-0528-0

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

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

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

Afshani, P. (2019). A new lower bound for semigroup orthogonal range searching. In G. Barequet & Y. Wang (Eds.), 35th International Symposium on Computational Geometry, SoCG 2019 [3] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 129 https://doi.org/10.4230/LIPIcs.SoCG.2019.3

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

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

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

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

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

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

Brodal, G. S., Frigioni, D. & Marchetti-Spaccamela, A. (Eds.) (2001). Algorithm Engineering: Proceedings of 5th International Workshop on Algorithm Engineering (WAE 2001). (2141 i Lecture Notes in Computer Science ed.) Springer.

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

Böhm, M., Fazzone, A., Leonardi, S., Menghini, C. & Schwiegelshohn, C. (2021). Algorithms for fair k-clustering with multiple protected attributes. Operations Research Letters, 49(5), 787-789. https://doi.org/10.1016/j.orl.2021.08.011

Barnabo, G., Leonardi, S., Fazzone, A. & Schwiegelshohn, C. (2019). Algorithms for fair team formation in online labour marketplaces. The Web Conference 2019 - Companion of the World Wide Web Conference, WWW 2019, 484-490. https://doi.org/10.1145/3308560.3317587

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. Lecture Notes in Computer Science Vol. 8737 https://doi.org/10.1007/978-3-662-44777-2_69

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

Brodal, G. S., Georgiadis, L. & Katriel, I. (2008). An O(n log n) Version of the Averbakh-Berman Algorithm for the Robust Median of a Tree. Operations Research Letters, 36(1), 14 -18. https://doi.org/10.1016/j.orl.2007.02.012

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. In S. Fekete & V. Ramachandran (Eds.), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Vol. PRAL17, pp. 218-231). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974768.18

Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C., Sitchinava, N. & Tsirogiannis, C. (2018). An efficient algorithm for the 1D total visibility-index problem and its parallelization. ACM Journal of Experimental Algorithmics, 23, [2.3]. https://doi.org/10.1145/3209685

Brodal, G. S., Fagerberg, R., Hammer, D., Meyer, U., Penschuck, M. & Tran, H. (2021). An experimental study of external memory algorithms for connected components. In D. Coudert & E. Natale (Eds.), 19th International Symposium on Experimental Algorithms, SEA 2021 (pp. 23). [23] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 190 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. In Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (pp. 61-72). Springer VS. Lecture Notes in Computer Science Vol. 8125 https://doi.org/10.1007/978-3-642-40450-4_6

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

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

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

Brodal, G. S. & Gasieniec, L. (1996). Approximate dictionary queries. In D. Hirschberg & G. Myers (Eds.), Combinatorial Pattern Matching: 7th Annual Symposium, CPM 96 Laguna Beach, California, June 10–12, 1996 Proceedings (pp. 65-74). Springer. Lecture Notes in Computer Science Vol. 1075 https://doi.org/10.1007/3-540-61258-0_6

Yon, J., Won, S. B., Cheng, S. W., Cheong, O. & Wilkinson, B. T. (2016). Approximating convex shapes with respect to symmetric difference under homotheties. In S. Fekete & A. Lubiw (Eds.), 32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 63.1-63.15). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics Vol. 51 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. In S. M. LaValle, M. Lin, T. Ojala, D. Shell & J. Yu (Eds.), Algorithmic Foundations of Robotics XIV-Part A: Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics Springer. Springer Proceedings in Advanced Robotics https://arxiv.org/abs/2005.02530

Sporbert, M., Bruelheide, H., Seidler, G., Keil, P., Jandt, U., Austrheim, G., Biurrun, I., Campos, J. A., Čarni, A., Chytrý, M., Csiky, J., De Bie, E., Dengler, J., Golub, V., Grytnes, J-A., Indreica, A., Jansen, F., Martin Jiroušek, M., Lenoir, J. ... Welk, E. (2019). Assessing sampling coverage of species distribution in biodiversity databases. Journal of Vegetation Science, 30(4), 620-632. https://doi.org/10.1111/jvs.12763

Fandina, O. N., Høgsgaard, M. M. & Larsen, K. G. (2023). Barriers for Faster Dimensionality Reduction. In P. Berenbrink, P. Bouyer, A. Dawar & M. M. Kante (Eds.), 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023 [31] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 254 https://doi.org/10.4230/LIPIcs.STACS.2023.31

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

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

Ejrnæs, R., Bladt, J., Moeslund, J. E. & Brunbjerg, A. K. (2021). Biodiversitetskortets bioscore. Aarhus Universitet, DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 456

Damgård, I. B., Larsen, K. G. & Yakoubov, S. (2021). Broadcast secret-sharing, bounds and applications. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 [10] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 199 https://doi.org/10.4230/LIPIcs.ITC.2021.10

Brodal, G. S. & Fagerberg, R. (2002). Cache Oblivious Distribution Sweeping. In P. Widmayer, S. Eidenbenz, F. Triguero, R. Morales, R. Conejo & M. Hennessy (Eds.), Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings (pp. 426-438). Springer. Lecture Notes in Computer Science Vol. 2380 https://doi.org/10.1007/3-540-45465-9_37

Brodal, G. S., Fagerberg, R. & Jacob, R. (2001). Cache Oblivious Search Trees via Binary Trees of Small Height. B R I C S Report Series, (RS-01-36), 1-20.

Brodal, G. S. & Mampentzidis, K. (2017). Cache oblivious algorithms for computing the triplet distance between trees. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 21:1--21:14). [21] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics Vol. 87 https://doi.org/10.4230/LIPIcs.ESA.2017.21

Brodal, G. S., Fagerberg, R. & Moruz, G. (2005). Cache-Aware and Cache-Oblivious Adaptive Sorting. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi & M. Yung (Eds.), Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings (pp. 576-588). Springer. Lecture Notes in Computer Science Vol. 3580 https://doi.org/10.1007/11523468_47

Brodal, G. S. (2004). Cache-Oblivious Algorithms and Data Structures. In T. Hagerup & J. Katajainen (Eds.), Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings (pp. 3-13). Springer. Lecture Notes in Computer Science Vol. 3111 https://doi.org/10.1007/978-3-540-27810-8_2

Displaying results 1 to 50 out of 340