Publications

Alstrup, S., Brodal, G. S. & Rauhe, T. (2000). Pattern matching in dynamic texts. In D. Shmoys (Ed.), Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 819-828). Society for Industrial and Applied Mathematics.

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

Bury, M., Gentili, M., Schwiegelshohn, C. & Sorella, M. (2021). Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities. Algorithmica, 83(5), 1371-1392. https://doi.org/10.1007/s00453-020-00787-3

Pouteau, R., Biurrun, I., Brunel, C., Chytrý, M., Dawson, W., Essl, F., Fristoe, T., Haveman, R., Hobohm, C., Jansen, F., Kreft, H., Lenoir, J., Lenzner, B., Meyer, C., Moeslund, J. E., Pergl, J., Pyšek, P., Svenning, J. C., Thuiller, W. ... van Kleunen, M. (2021). Potential alien ranges of European plants will shrink in the future, but less so for already naturalized than for not yet naturalized species. Diversity and Distributions, 27(11), 2063-2076. https://doi.org/10.1111/ddi.13378

Brodal, G. S. (1997). Predecessor queries in dynamic integer sets. In R. Reischuk & M. Morwan (Eds.), STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings (pp. 21-32). Springer. Lecture Notes in Computer Science Vol. 1200 https://doi.org/10.1007/BFb0023445

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

Fløjgaard, C., Frøslev, T. G., Brunbjerg, A. K., Bruun, H. H., Moeslund, J. E., Hansen, A. J. & Ejrnæs, R. (2019). Predicting provenance of forensic soil samples: Linking soil to ecological habitats by metabarcoding and supervised classification. PLOS ONE, 14(7), [e0202844]. https://doi.org/10.1371/journal.pone.0202844

Brodal, G. S. (2022). Priority Queues with Decreasing Keys. In P. Fraigniaud & Y. Uno (Eds.), 11th International Conference on Fun with Algorithms, FUN 2022 (pp. 8:1-8:19). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 226 https://doi.org/10.4230/LIPIcs.FUN.2022.8

Brodal, G. S. (1999). Priority queues on parallel machines. Parallel Computing, 25(8), 987-1011. https://doi.org/10.1016/S0167-8191(99)00032-0

Afshani, P., Matulef, K. & Wilkinson, B. T. (2013). Property Testing on Linked Lists. Electronic Colloquium on Computational Complexity, TR13-187. http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc20.html

Fleischhacker, N., Larsen, K. G. & Simkin, M. (2022). Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 764-781). Springer. Lecture Notes in Computer Science (LNCS) Vol. 13276 https://doi.org/10.1007/978-3-031-07085-3_26

Brodal, G. S., Makris, C. & Tsichlas, K. (2006). Purely Functional Worst Case Constant Time Catenable Sorted Lists. In Y. Azar & T. Erlebach (Eds.), Algorithms – ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings (pp. 172-183). Springer. Lecture Notes in Computer Science Vol. 4168 https://doi.org/10.1007/11841036_18

Anagnostopoulos, A., Angeletti, F., Arcangeli, F., Schwiegelshohn, C. & Vitaletti, A. (2019). Random projection to preserve patient privacy. CEUR Workshop Proceedings, 2482.

Jørgensen, A. G. & Larsen, K. G. (2011). Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures . In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2011 (pp. 805-813). Society for Industrial and Applied Mathematics. http://www.siam.org/proceedings/soda/2011/SODA11_062_jorgensena.pdf

Mailund , Brodal, G. S., Fagerberg, R., Pedersen, C. N. S. & Phillips, D. (2006). Recrafting the Neighbor-Joining Method. B M C Bioinformatics, 7(29).

Valdez, J., Brunbjerg, A. K., Fløjgaard, C., Dalby, L., Clausen, K. K., Pärtel, M., Pfeifer, N., Hollaus, M., Wimmer, M. H., Ejrnæs, R. & Moeslund, J. E. (2021). Relationships between macro-fungal dark diversity and habitat parameters using LiDAR. Fungal Ecology, 51, [101054]. https://doi.org/10.1016/j.funeco.2021.101054

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

Wilkinson, B. T. (2015). Revisiting visibility in the plane. Paper presented at International Symposium on Computational Geometry, Eindhoven, Netherlands. http://www.madalgo.au.dk/~bw/papers/2015W.pdf

Cohen-Addad, V., Epasto, A., Lattanzi, S., Mirrokni, V., Munoz Medina, A., Saulpic, D., Schwiegelshohn, C. & Vassilvitskii, S. (2022). Scalable Differentially Private Clustering via Hierarchically Separated Trees. In KDD 2022 - Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 221-230). Association for Computing Machinery, Inc. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining https://doi.org/10.1145/3534678.3539409

Brunbjerg, A. K., Fløjgaard, C., Frøslev, T. G., Andersen, D. K., Bruun, H. H., Dalby, L., Goldberg, I., Juhl Lehmann, L., Moeslund, J. E. & Ejrnæs, R. (2022). Scrub encroachment promotes biodiversity in temperate European wetlands under eutrophic conditions. Ecology and Evolution, 12(11), [e9445]. https://doi.org/10.1002/ece3.9445

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 566-578). Springer. Lecture Notes in Computer Science Vol. 12238 https://doi.org/10.1007/978-3-030-57990-6_28

Brodal, G. S. & Jørgensen, A. G. (2008). Selecting Sums in Arrays. Lecture Notes in Computer Science, 5369, 100-111. https://doi.org/10.1007/978-3-540-92182-0_12

Bury, M., Schwiegelshohn, C. & Sorella, M. (2020). Similarity Search for Dynamic Data Streams. IEEE Transactions on Knowledge and Data Engineering, 32(11), 2241-2253. https://doi.org/10.1109/TKDE.2019.2916858

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

Brodal, G. S. & Moruz, G. (2006). Skewed Binary Search Trees. In Y. Azar & T. Erlebach (Eds.), Algorithms – ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings (pp. 708-719). Springer. Lecture Notes in Computer Science Vol. 4168 https://doi.org/10.1007/11841036_63

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/

Brodal, G. S., Lyngsø, R. B., Östlin, A. & Pedersen, C. N. S. (2002). Solving the String Statistics Problem in Time O(n log n). 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. 728-739). Springer. Lecture Notes in Computer Science Vol. 2380 https://doi.org/10.1007/3-540-45465-9_62

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. Lecture Notes in Computer Science Vol. 9294 https://doi.org/10.1007/978-3-662-48350-3_2

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

Anagnostopoulos, A., Becchetti, L., Fazzone, A., Menghini, C. & Schwiegelshohn, C. (2020). Spectral Relaxations and Fair Densest Subgraphs. In CIKM 2020 - Proceedings of the 29th ACM International Conference on Information and Knowledge Management (pp. 35–44). Conference on Information and Knowledge Management https://doi.org/10.1145/3340531.3412036

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

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

Son, W. & Afshani, P. (2015). Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. In R. Jain, S. Jain & F. Stephan (Eds.), Theory and Applications of Models of Computation: 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (pp. 189-199 ). Springer VS. Lecture Notes in Computer Science LNCS Vol. 9076 https://doi.org/10.1007/978-3-319-17142-5

Brodal, G. S., Lagogiannis, G. & Tarjan, R. E. (2012). Strict fibonacci heaps. In STOC '12 Proceedings of the 44th symposium on Theory of Computing (pp. 1177-1184 ). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214082

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. Lecture Notes in Computer Science Vol. 9214 https://doi.org/10.1007/978-3-319-21840-3_8

Bury, M., Grigorescu, E., McGregor, A., Monemizadeh, M., Schwiegelshohn, C., Vorotnikova, S. & Zhou, S. (2019). Structural Results on Matching Estimation with Applications to Streaming. Algorithmica, 81(1), 367-392. https://doi.org/10.1007/s00453-018-0449-y

Bringmann, K. & Larsen, K. G. (2013). Succinct Sampling from Discrete Distributions. In Proceedings of the 45th annual ACM Symposium on Theory of Computing, STOC '13 (pp. 775-782 ). Association for Computing Machinery. A C M Symposium on the Theory of Computing. Annual Proceedings https://doi.org/10.1145/2488608.2488707

Sporbert, M., Keil, P., Seidler, G., Bruelheide, H., Jandt, U., Aćić, S., Biurrun, I., Campos, J. A., Čarni, A., Chytrý, M., Ćušterevska, R., Dengler, J., Golub, V., Jansen, F., Kuzemko, A., Lenoir, J., Marceno, C., Moeslund, J. E., Pérez-Haase, A. ... Welk, E. (2020). Testing macroecological abundance patterns: the relationship between local abundance and range size, range position and climatic suitability among European vascular plants. Journal of Biogeography, 47(10), 2210-2222. https://doi.org/10.1111/jbi.13926

Larsen, K. G. (2012). The Cell Probe Complexity of Dynamic Range Counting. In STOC’12 : Proceedings of the 44th symposium on Theory of Computing (pp. 85-94). Association for Computing Machinery. https://doi.org/10.1145/2213977.2213987

Westergaard, M., Kristensen, L. M., Brodal, G. S. & Arge, L. (2007). The ComBack Method - Extending Hash Compaction with Backtracking. In 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 (pp. 455-464). Springer. Lecture Notes in Computer Science Vol. 4546 https://doi.org/10.1007/978-3-540-73094-1_26

Brodal, G. S. & Skyum, S. (1996). The Complexity of Computing the -ary Composition of a Binary Associative Operator. Department of Computer Science, Aarhus University. BRICS-RS No. 96-42 http://www.brics.dk/RS/96/42/BRICS-RS-96-42.pdf

Brodal, G. S., Fagerberg, R., Pedersen, C. N. S. & Östlin, A. (2001). The Complexity of Constructing Evolutionary Trees Using Experiments. In F. Orejas, P. G. Spirakis & J. van Leeuwen (Eds.), Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings (pp. 140-151). Springer. Lecture Notes in Computer Science Vol. 2076 https://doi.org/10.1007/3-540-48224-5_12

Bender, M. A., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2003). The Cost of Cache-Oblivious Searching. In Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS): IEEE Computer Society Press, Washington D.C. (Vol. Session 6, pp. 271-282). IEEE Computer Society Press.

Bender, M. A., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2011). The Cost of Cache-Oblivious Searching. Algorithmica, 61(2), 463-505. https://doi.org/10.1007/s00453-010-9394-0

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

Braverman, V., Cohen-Addad, V., Jiang, S. H-C., Krauthgamer, R., Schwiegelshohn, C., Toftrup, M. B. & Wu, X. (2022). The Power of Uniform Sampling for Coresets. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 462-473). IEEE. https://doi.org/10.1109/FOCS54457.2022.00051

Afshani, P., Afrawal, M., Benjamin, D., Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012). The Query Complexity of Finding a Hidden Permutation. Electronic Colloquium on Computational Complexity, (TR12-087). http://eccc.hpi-web.de/report/2012/087/

Afshani, P., Agrawal, M., Benjamin, D., Doerr, C., Larsen, K. G. & Mehlhorn, K. (2013). The Query Complexity of Finding a Hidden Permutation. 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. 1-11). Springer VS. Lecture Notes in Computer Science Vol. 8066 https://doi.org/10.1007/978-3-642-40273-9_1

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. Lecture Notes in Computer Science Vol. 8125 https://doi.org/10.1007/978-3-642-40450-4_20

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 presented at Beyond Kyoto: Addressing the challenges of climate change, Aarhus, Denmark.

Displaying results 251 to 300 out of 335