Papakonstantinou, P. A., Xu, J.
& Yang, G. (2016).
On the power and limits of distance-based learning. I M.-F. Balcan & K. Q. Weinberger (red.),
Proceedings of the 33nd International Conference on Machine Learning, {ICML} 2016, New York City, NY, USA, June 19-24, 2016 (Bind 48, s. 2263-2271). JMLR.org.
Dahlsen-Jensen, M. B., Fievet, B., Petrucci, L.
& de Pol, J. V. (2024).
On-The-Fly Algorithm for Reachability in Parametric Timed Games. I B. Finkbeiner & L. Kovács (red.),
Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Proceedings (s. 194-212). Springer Science and Business Media Deutschland GmbH.
https://doi.org/10.1007/978-3-031-57256-2_10
Campos, G. O., Zimek, A., Sander, J., Campello, R. J. G. B.
, Micenková, B., Schubert, E.
, Assent, I. & Houle, M. E. (2016).
On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study.
Data Mining and Knowledge Discovery,
30(4), 891-927.
https://doi.org/10.1007/s10618-015-0444-8
Campos, G. O., Zimek, A., Sander, J., Campello, R. J. G. B.
, Micenkova, B., Schubert, E.
, Assent, I. & Houle, M. E. (2016).
On the Evaluation of Outlier Detection: Measures, Datasets, and an Empirical Study Continued. I R. Krestel, D. Mottin & E. Müller (red.),
Proceedings of the Conference "Lernen, Wissen, Daten, Analysen" (Bind 1670, s. 1). ceur workshop proceedings.
http://ceur-ws.org/Vol-1670/paper-55.pdf
Chakraborty, S., Kayal, C., Mittal, R.
, Paraashar, M., Sanyal, S. & Saurabh, N. (2023).
On the Composition of Randomized Query Complexity and Approximate Degree. I N. Megow & A. Smith (red.),
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX/RANDOM 2023 Artikel 63 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63
Trifiletti, R., Nielsen, J. B., Frederiksen, T. K. & Jakobsen, T. P. (2016).
On the Complexity of Additively Homomorphic UC Commitments. I E. Kushilevitz & T. Malkin (red.),
Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings (Bind 9562, s. 542-565). Springer VS.
https://doi.org/10.1007/978-3-662-49096-9
Polychroniadou, A., Damgård, I. B., Garg, S., Mukherjee, P.
, Nielsen, J. B. & Pandey, O. (2016).
On the Communication and Round Complexity of Secure Computation. Institut for Datalogi, Aarhus Universitet.
http://cs.au.dk/fileadmin/user_upload/IvanFest_AP.pdf
Scheder, D. & Tan, L. Y. (2013).
On the average sensitivity and density of k-CNF formulas. I P. Prasad , S. Raskhodnikova, K. Jansen & J. D. P. Rolim (red.),
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings (s. 683-698). Springer VS.
https://doi.org/10.1007/978-3-642-40328-6_47