Nielsen, M., Krukow, K., Karhumäki, J. (Ed.), Maurer, H. A. (Ed.), Paun, G. (Ed.) & Rozenberg, G. (Ed.) (2004).
On the Formal Modeling of Trust in Reputation-Based Systems. In
Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday (pp. 192-204). Springer.
https://doi.org/10.1007/978-3-540-27812-2_18
Dahlsen-Jensen, M. B., Fievet, B., Petrucci, L.
& de Pol, J. V. (2024).
On-The-Fly Algorithm for Reachability in Parametric Timed Games. In B. Finkbeiner & L. Kovács (Eds.),
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 (pp. 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. In R. Krestel, D. Mottin & E. Müller (Eds.),
Proceedings of the Conference "Lernen, Wissen, Daten, Analysen" (Vol. 1670, pp. 1). ceur workshop proceedings.
http://ceur-ws.org/Vol-1670/paper-55.pdf
Cramer, R.
, Damgård, I. B. & Fehr, S. (2001).
On the Cost of Reconstructing a Secret or VSS with Optimal Reconstruction. In J. Killian (Ed.),
Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 Proceedings (pp. 503-524). Springer.
https://doi.org/10.1007/3-540-44647-8_30
Chakraborty, S., Kayal, C., Mittal, R.
, Paraashar, M., Sanyal, S. & Saurabh, N. (2023).
On the Composition of Randomized Query Complexity and Approximate Degree. In N. Megow & A. Smith (Eds.),
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX/RANDOM 2023 Article 63 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63
Kostitsyna, I., Löffler, M., Polishchuk, V.
& Staals, F. (2016).
On the complexity of minimum-link path problems. In S. Fekete & A. Lubiw (Eds.),
32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 49.1-49.16). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.SoCG.2016.49
Trifiletti, R., Nielsen, J. B., Frederiksen, T. K. & Jakobsen, T. P. (2016).
On the Complexity of Additively Homomorphic UC Commitments. In E. Kushilevitz & T. Malkin (Eds.),
Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings (Vol. 9562, pp. 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