Kontinen, J., Meier, A., &; Mahmood, Y. (2021). A Parameterized View on the Complexity of Dependence Logic. Logical Foundations of Computer Science.https://doi.org/10.1007/978-3-030-93100-1_9 
LibreCat: /record/45846
DOI: 10.1007/978-3-030-93100-1_9

Alhaddad, S., Förstner, J., Groth, S., Grünewald, D., Grynko, Y., Hannig, F., Kenter, T., Pfreundt, F.-J., Plessl, C., Schotte, M., Steinke, T., Teich, J., Weiser, M., &; Wende, F. (2021). HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids. In Euro-Par 2020: Parallel Processing Workshops.https://doi.org/10.1007/978-3-030-71593-9_15 
LibreCat: /record/21587
DOI: 10.1007/978-3-030-71593-9_15

Ramaswami, A., Kenter, T., Kühne, T., &; Plessl, C. (2021). Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing. In Applied Reconfigurable Computing. Architectures, Tools, and Applications. Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and Applications. Springer International Publishing.https://doi.org/10.1007/978-3-030-79025-7_21 
LibreCat: /record/29936
DOI: 10.1007/978-3-030-79025-7_21

Kontinen, J., Meier, A., &; Mahmood, Y. (2021). A Parameterized View on the Complexity of Dependence Logic. In Logical Foundations of Computer Science. Springer International Publishing.https://doi.org/10.1007/978-3-030-93100-1_9 
LibreCat: /record/45823
DOI: 10.1007/978-3-030-93100-1_9

Pfannschmidt, K., &; Hüllermeier, E. (2020). Learning Choice Functions via Pareto-Embeddings. In Lecture Notes in Computer Science. Cham.https://doi.org/10.1007/978-3-030-58285-2_30 
LibreCat: /record/19521
DOI: 10.1007/978-3-030-58285-2_30

Sellmann, M., &; Tierney, K. (2020). Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. In Lecture Notes in Computer Science. Cham.https://doi.org/10.1007/978-3-030-53552-0_12 
LibreCat: /record/19561
DOI: 10.1007/978-3-030-53552-0_12

Jager, T., &; Niehues, D. (2020). On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In Lecture Notes in Computer Science. Cham.https://doi.org/10.1007/978-3-030-38471-5_13 
LibreCat: /record/21396
DOI: 10.1007/978-3-030-38471-5_13

Jazayeri, B., Schwichtenberg, S., Küster, J., Zimmermann, O., &; Engels, G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In Advanced Information Systems Engineering. Cham.https://doi.org/10.1007/978-3-030-49435-3_3 
LibreCat: /record/17337
DOI: 10.1007/978-3-030-49435-3_3

Knüppel, A., Krüger, S., Thüm, T., Bubel, R., Krieter, S., Bodden, E., &; Schaefer, I. (2020). Using Abstract Contracts for Verifying Evolving Features and Their Interactions. In Lecture Notes in Computer Science.https://doi.org/10.1007/978-3-030-64354-6_5 
LibreCat: /record/20891
DOI: 10.1007/978-3-030-64354-6_5

El Mesaoudi-Paul, A., Weiß, D., Bengs, V., Hüllermeier, E., &; Tierney, K. (2020). Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach. In Learning and Intelligent Optimization. LION 2020. (Vol. 12096, pp. 216–232). Cham: Springer.https://doi.org/10.1007/978-3-030-53552-0_22 
LibreCat: /record/18014
DOI: 10.1007/978-3-030-53552-0_22