Tataru, P., Sand, A., Hobolth, A., Mailund, T. & Pedersen, C. N. S. (2013).
Algorithms for Hidden Markov Models Restricted to Occurrences of Regular Expressions.
Biology,
2(4), 1282-1295.
https://doi.org/10.3390/biology2041282
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
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
Schulz, H.-J., Röhlig, M., Nonnemann, L.
, Hogräfer, M., Aehnelt, M., Urban, B. & Schumann, H. (2020).
A Layered Approach to Lightweight Toolchaining in Visual Analytics. In A. P. Cláudio, K. Bouatouch, M. Chessa, A. Paljic, A. Kerren, C. Hurter, A. Tremeau & G. M. Farinella (Eds.),
Computer Vision, Imaging and Computer Graphics Theory and Applications : 14th International Joint Conference, VISIGRAPP 2019, Revised Selected Papers (pp. 313-337). Springer.
https://doi.org/10.1007/978-3-030-41590-7_13
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
Petersen, D. E., Li, S., Stokbro, K.
, Sørensen, H. H. B., Hansen, P. C., Skelboe, S. & Darve, E. (2009).
A hybrid method for the parallel computation of Green’s functions.
Journal of Computational Physics,
228(14), 5020-5039.
https://doi.org/10.1016/j.jcp.2009.03.035 |
Cáccamo, M. J.
, Winskel, G., Boulton, R. J. (Ed.) & Jackson, P. B. (Ed.) (2001).
A Higher-Order Calculus for Categories. In
Lecture Notes in Computer Science: Theorem Proving in Higher Order Logics (Lecture Notes in Computer Science ed., Vol. 2152, pp. 136-153). Springer.
Arge, L. A., Knudsen, M. & Larsen, K. (1993).
A general lower bound on the I/O-complexity of comparison-based algorithms. In F. Dehne, J.-R. Sack, N. Santoro & S. Whitesides (Eds.),
Algorithms and Data Structures: Third Workshop, WADS '93 Montréal, Canada, August 11-13, 1993 Proceedings (pp. 83-94). Springer.
https://doi.org/10.1007/3-540-57155-8_238