Publications

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Afshani, P. & Killmann, R. (2023). Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions. Computational Geometry: Theory and Applications, 111, [101959]. https://doi.org/10.1016/j.comgeo.2022.101959

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

Davoodi, P., Brodal, G. S. & Satti, S. R. (2011). Path Minima Queries in Dynamic Weighted Trees. Lecture Notes in Computer Science, 6844 , 290-301. https://doi.org/10.1007/978-3-642-22300-6_25

Brodal, G. S. (1996). Partially persistent data structures of bounded degree with constant update time. Nordic Journal of Computing, 3(3), 238-255.

Arge, L. A., Goodrich, M. T. & Sitchinava, N. (2010). Parallel External Memory Graph Algorithms. I P D P S Proceedings, 1-11. https://doi.org/10.1109/IPDPS.2010.5470440

Moeslund, J. E., (2021). Oversigter over forekomsten af rødlistede arter, 212 p., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Vol. 2021 No. 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 p., Notat fra DCE - Nationalt Center for Miljø og Energi https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notater_2019/Status_danske_sommerfugle.pdf

Chan, T. M., Larsen, K. G. & Patrascu, M. (2011). Orthogonal Range Searching on the RAM, Revisited. In Proceedings of the 27th annual ACM symposium on Computational geometry (pp. 1-10). Association for Computing Machinery. https://doi.org/10.1145/1998196.1998198

Afshani, P., Arge, L. A. & Larsen, K. D. (2010). Orthogonal Range Reporting: Query Lower Bounds, Optimal Structures in 3-d, and Higher Dimensional Improvements. Annual A C M Symposium on Computational Geometry. Proceedings, 240-246. https://doi.org/10.1145/1810959.1811001

Afshani, P., Arge, L. A. & Larsen, K. D. (2009). Orthogonal Range Reporting in Three and Higher Dimensions. Symposium on Foundations of Computer Science. Annual Proceedings, 149-158. https://doi.org/10.1109/FOCS.2009.58

Afshani, P., Brodal, G. S. & Zeh, N. (2011). Ordered and Unordered Top-K Range Reporting in Large Data Sets. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algoritms. SODA 2011 (pp. 390-400). Society for Industrial and Applied Mathematics. http://www.siam.org/proceedings/soda/2011/SODA11_031_afshanip.pdf

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

Bartal, Y., Fandina, O. N. & Larsen, K. G. (2022). Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 [13] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 224 https://doi.org/10.4230/LIPIcs.SoCG.2022.13

Brodal, G. S. & Okasaki, C. (1996). Optimal purely functional priority queues. Journal of Functional Programming, 6(6), 839-858. https://doi.org/10.1017/S095679680000201X

Jafargholi, Z., Larsen, K. G. & Simkin, M. (2021). Optimal oblivious priority queues. In D. Marx (Ed.), ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 (pp. 2366-2383). Association for Computing Machinery. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Afshani, P. & Tsakalidis, K. (2014). Optimal deterministic shallow cuttings for 3D dominance ranges. In C. Chekuri (Ed.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (pp. 1389-1398 ). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Displaying results 51 to 100 out of 336

Revised 09.03.2023

Department of Computer Science

Publications

Kasper Green Larsen

Peyman Afshani

Gerth Stølting Brodal

Chris Schwiegelshohn

Publications

Head of research

Kasper Green Larsen

Faculty

Peyman Afshani

Gerth Stølting Brodal

Chris Schwiegelshohn