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).
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
Le, T., Dietz, F.
, Pfeuffer, K. & Alt, F. (2022).
A Practical Method to Eye-Tracking on the Phone: Toolkit, Accuracy and Precision. I T. Doring, S. Boll, A. Colley, A. Esteves & J. Guerreiro (red.),
Proceedings of MUM 2022, the 21st International Conference on Mobile and Ubiquitous Multimedia (s. 182-188). Association for Computing Machinery.
https://doi.org/10.1145/3568444.3568463
Afshani, P., de Berg, M., Buchin, K., Gao, J., Loffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Wang, H.-T. (2021).
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. I S. M. LaValle, M. Lin, T. Ojala, D. Shell & J. Yu (red.),
Algorithmic Foundations of Robotics XIV-Part A: Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics Springer.
https://arxiv.org/abs/2005.02530
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
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
Cao, X., Cong, G., Cui, B.
, Jensen, C. S. & Yuan, Q. (2012).
Approaches to Exploring Category Information for Question Retrieval in Community Question-Answer Archives.
A C M Transactions on Information Systems,
30(2), Article No. 7 .
https://doi.org/10.1145/2180868.2180869
Thai Son, M., Assent, I. & Le, A. T. (2016).
Anytime OPTICS: An efficient approach for hierarchical density-based clustering. I S. B. Navathe, W. Wu, S. Shekhar, X. Du, X. Sean Wang & H. Xiong (red.),
Database Systems for Advanced Applications - 21st International Conference, DASFAA 2016, Proceedings (Bind 9642, s. 164-179). Springer VS.
https://doi.org/10.1007/978-3-319-32025-0_11
Agarwal, P. K.
, Arge, L., Kaplan, H., Molad, E., Tarjan, R. E. & Yi, K. (2012).
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries.
S I A M Journal on Computing,
41(1), 104–127.
https://doi.org/10.1137/10078791X
Arge, L., Brodal, G. S., Truelsen, J. & Tsirogiannis, C. (2013).
An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. I
Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (s. 61-72). Springer VS.
https://doi.org/10.1007/978-3-642-40450-4_6
Kohlweiss , M., Maurer , U., Onete , C., Tackmann , B.
& Venturi, D. (2013).
Anonymity-Preserving Public-Key Encryption: A Constructive Approach. I E. De Cristofaro & M. Wright (red.),
Privacy Enhancing Technologies: 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013. Proceedings (s. 19-39). Springer VS.
https://doi.org/10.1007/978-3-642-39077-7_2
Braun, L., Castagnos, G.
, Damgård, I. B., Laguillaumie, F.
, Melissaris, K., Orlandi, C. & Tucker, I. (2024).
An Improved Threshold Homomorphic Cryptosystem Based on Class Groups.
https://eprint.iacr.org/2024/717
Hoggan, E., Hsieh, Y.-T., Myllymaa, K., Lantz, V., Kildal, J., Eiler, J. & Jacucci, G. (2017).
An Exploration of Mobile Shape-Changing Textures. I
TEI 2017 - Proceedings of the 11th International Conference on Tangible, Embedded, and Embodied Interaction: TEI '17 (s. 275-282). Association for Computing Machinery.
https://doi.org/10.1145/3024969.3024983
Brodal, G. S., Fagerberg, R., Hammer, D., Meyer, U., Penschuck, M. & Tran, H. (2021).
An experimental study of external memory algorithms for connected components. I D. Coudert & E. Natale (red.),
19th International Symposium on Experimental Algorithms, SEA 2021 (s. 23). Artikel 23 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.SEA.2021.23
Mailund, T., Halager, A. E., Westergaard, M., Dutheil, J. Y., Munch, K., Andersen, L. N., Lunter, G., Prüfer, K., Scally, A.
, Hobolth, A. & Schierup, M. H. (2012).
A New Isolation with Migration Model along Complete Genomes Infers Very Different Divergence Processes among Closely Related Great Ape Species.
P L o S Genetics,
8(12), e1003125.
https://doi.org/10.1371/journal.pgen.1003125