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
Kohlweiss , M., Maurer , U., Onete , C., Tackmann , B.
& Venturi, D. (2013).
Anonymity-Preserving Public-Key Encryption: A Constructive Approach. In E. De Cristofaro & M. Wright (Eds.),
Privacy Enhancing Technologies: 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013. Proceedings (pp. 19-39). Springer VS.
https://doi.org/10.1007/978-3-642-39077-7_2
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.
https://doi.org/10.1007/978-3-642-40450-4_6
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
Frederiksen, S. K. S. & Miltersen, P. B. (2013).
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. In L. Cai, S.-W. Cheng & T.-W. Lam (Eds.),
Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (pp. 457-467 ). Springer VS.
https://doi.org/10.1007/978-3-642-45030-3_43
Sand, A., Pedersen, C. N. S., Mailund, T., Brodal, G. S. & Fagerberg, R. (2013).
A practical O(n log2 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
Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2013).
Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier. In K. Sako & P. Sarkar (Eds.),
Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (pp. 140-160 ). Springer VS.
https://doi.org/10.1007/978-3-642-42045-0_8
Sükösd, Z., Knudsen, B., Anderson, J. WJ., Novák, A.
, Kjems, J. & Pedersen, C. N. S. (2013).
Characterising RNA secondary structure space using information entropy.
B M C Bioinformatics,
14 (Suppl 2), 1-9. Article S22.
https://doi.org/10.1186/1471-2105-14-S2-S22
Blunck, H., Bouvin, N. O., Entwistle, J. M., Grønbæk, K., Kjærgaard, M. B., Nielsen, M., Petersen, M. G., Rasmussen, M. & Wüstenberg, M. (2013).
Computational environmental ethnography: combining collective sensing and ethnographic inquiries to advance means for reducing environmental footprints. In D. Culler & C. Rosenberg (Eds.),
e-Energy 2013 - Proceedings of the 4th ACM International Conference on Future Energy Systems (pp. 87-98). Association for Computing Machinery.
https://doi.org/10.1145/2487166.2487176
Rasmusson, A., Sørensen, T. S. & Ziegler, G. (2013).
Connected Components Labeling on the GPU with Generalization to Voronoi Diagrams and Signed Distance Fields. In G. Bebis et al. (Ed.),
Advances in Visual Computing: 9th International Symposium, ISVC 2013, Rethymnon, Crete, Greece, July 29-31, 2013. Proceedings, Part I (pp. 206-215). Springer VS.
https://doi.org/10.1007/978-3-642-41914-0_21
Sandager, P., Lindahl, C., Schlütter, J. M., Uldbjerg, N., Wagner, S. R., Toftegaard, T. S. & Bertelsen, O. W. (2013).
Context-aware patient guidance during blood pressure self-measurement. In
Proceedings of the IADIS International Conference e-Health 2013, EH 2013 (pp. 153-157). University of Twente.
http://www.scopus.com/record/display.url?view=basic&eid=2-s2.0-84886912072&origin=resultslist
Moreira, J. M. M.
, Jensen, C. S., Dias, P. & Mesquita, P. (2013).
Creating data representations for moving objects with extent from images. In
Presented at the COST MOVE Workshop at Moving Objects at Sea, Brest, France, June 28–29, 2013
Brodal, G. S., Fagerberg, R.
, Mailund, T., Pedersen, C. N. S. & Sand, A. (2013).
Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree.
The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings,
24, 1814-1832.
http://knowledgecenter.siam.org/0236-000098/0236-000098/1