Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
264 Publications
2019 | Book Chapter | LibreCat-ID: 15005
Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Analogy-Based Preference Learning with Kernels. In KI 2019: Advances in Artificial Intelligence. Cham. https://doi.org/10.1007/978-3-030-30179-8_3
LibreCat
| DOI
2019 | Book Chapter | LibreCat-ID: 15006
Nguyen, V.-L., Destercke, S., & Hüllermeier, E. (2019). Epistemic Uncertainty Sampling. In Discovery Science. Cham. https://doi.org/10.1007/978-3-030-33778-0_7
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 15080
Hartel, R., & Dunst, A. (2019). How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics. In International Conference on Multimedia Modeling, MMM (pp. 662–671). Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-030-05716-9_59
LibreCat
| DOI
2019 | Book Chapter | LibreCat-ID: 13872
Beyer, D., & Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based Testing. In Fundamental Approaches to Software Engineering. Cham. https://doi.org/10.1007/978-3-030-16722-6_23
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 45818
Mahmood, Y., Meier, A., & Schmidt, J. (2019). Parameterised Complexity of Abduction in Schaefer’s Framework. Logical Foundations of Computer Science. https://doi.org/10.1007/978-3-030-36755-8_13
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 2862 | 
Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings (pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25
LibreCat
| Files available
| DOI
| Download (ext.)
2018 | Conference Paper | LibreCat-ID: 24396
Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA). https://doi.org/10.1007/978-3-319-94667-2_18
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 3362
Lösch, A., Wiens, A., & Platzner, M. (2018). Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In Proceedings of the International Conference on Architecture of Computing Systems (ARCS) (Vol. 10793, pp. 73–84). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-77610-1_6
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 3373
Hansmeier, T., Platzner, M., & Andrews, D. (2018). An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications (Vol. 10824, pp. 153–165). Santorini, Greece: Springer International Publishing. https://doi.org/10.1007/978-3-319-78890-6_13
LibreCat
| Files available
| DOI
2018 | Book Chapter | LibreCat-ID: 3536
Schellhorn, G., Wedel, M., Travkin, O., König, J., & Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software Engineering and Formal Methods (pp. 105–120). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-92970-5_7
LibreCat
| DOI