Frederiksen, S. K. S. & Miltersen, P. B. (2013).
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. I L. Cai, S.-W. Cheng & T.-W. Lam (red.),
Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (s. 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.
BMC Bioinformatics,
14(Suppl 2), S18.
https://doi.org/10.1186/1471-2105-14-S2-S18
Mottin, D., Marascu, A., Basu Roy, S., Das, G., Palpanas, T. & Velegrakis, Y. (2013).
A Probabilistic Optimization Framework for the Empty-Answer Problem.
PVLDB,
6(14).
Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2013).
Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier. I K. Sako & P. Sarkar (red.),
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 (s. 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.
BMC Bioinformatics,
14 (Suppl 2), 1-9. Artikel 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. I D. Culler & C. Rosenberg (red.),
e-Energy 2013 - Proceedings of the 4th ACM International Conference on Future Energy Systems (s. 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. I G. Bebis et al. (red.),
Advances in Visual Computing: 9th International Symposium, ISVC 2013, Rethymnon, Crete, Greece, July 29-31, 2013. Proceedings, Part I (s. 206-215). Springer VS.
https://doi.org/10.1007/978-3-642-41914-0_21
John, M.
, Schulz, H.-J., Schumann, H., Uhrmacher, A. M. & Unger, A. (2013).
Constructing and visualizing chemical reaction networks from pi-calculus models.
Formal Aspects of Computing,
25(5), 723-742.
https://doi.org/10.1007/s00165-011-0209-0
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. I
Proceedings of the IADIS International Conference e-Health 2013, EH 2013 (s. 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. I
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
Feldthaus, A., Schäfer, M., Sridharan, M., Dolby, J. & Tip, F. (2013).
Efficient construction of approximate call graphs for JavaScript IDE services. I D. Notkin, B. H. C. Cheng & K. Pohl (red.),
Proceedings of the 2013 International Conference on Software Engineering, ICSE '13 (s. 752-761 ). IEEE Communications Society.
http://dl.acm.org.ez.statsbiblioteket.dk:2048/citation.cfm?id=2486887&CFID=280253056&CFTOKEN=11487082
Agarwal, P. K.
, Yang, J., Arge, L., Govindarajan, S. & Yi, K. (2013).
Efficient external memory structures for range-aggregate queries.
Computational Geometry,
46(3), 358-370.
https://doi.org/10.1016/j.comgeo.2012.10.003