Schaef, M.: Rekonstruktion von bewegtem Stoff mittels direkter Suchverfahren. Bachelor, Universität des Saarlandes, Saarbrücken (2005)

Volkamer, A.: Implementation of a Method to Filter out Compounds with Toxic, Reactive and Unsuitable Functional Groups. Bachelor, Universität des Saarlandes, Saarbrücken (2005)

Weiss, J.: Generating Frequency Profiles from Multiple Structure Alignments. Bachelor, Universität des Saarlandes, Saarbrücken (2005)

Eyrisch, S.: Fun2Struc - A Tool For Predicting Protein Structure Classes from Function Predictions. Bachelor, Universität des Saarlandes, Saarbrücken (2004)

Schlicker, A.: Automated Differential Analysis of Proteomes. Bachelor, Universität des Saarlandes, Saarbrücken (2004)

Hossain, I.; Fanfani, V.; Fischer, J.; Quackenbush, J.; Burkholz, R.: Biologically Informed NeuralODEs for Genome-wide Regulatory Dynamics. (2024), 39 S.

Nguyen, T.-P.; Razniewski, S.; Weikum, G.: Multi-Cultural Commonsense Knowledge Distillation. (2024), 20 S.

Parchami-Araghi, A.; Boehle, M. D.; Rao, S. S.; Schiele, B.: Good Teachers Explain: Explanation-Enhanced Knowledge Distillation. (2024), 21 S.

Singhania, S.; Razniewski, S.; Weikum, G.: Recall Them All: Retrieval-Augmented Language Models for Long Object List Extraction from Long Documents. (2024), 17 S.

Akrami, H.; Garg, J.: Breaking the 3/4 Barrier for Approximate Maximin Share. (2023), 32 S.

Akrami, H.; Garg, J.; Sharma, E.; Taki, S.: Improving Approximation Guarantees for Maximin Share. (2023), 41 S.

Ansari, N.; Seidel, H.-P.; Babaei, V.: Large-batch, Iteration-efficient Neural Bayesian Design Optimization. (2023), 25 pages S.

Arnaout, H.; Razniewski, S.: Can Large Language Models Generate Salient Negative Statements? (2023), 7 S.

Ashvinkumar, V.; Bernstein, A.; Cao, N.; Grunau, C.; Haeupler, B.; Jiang, Y.; Nanongkai, D.; Su, H. H.: Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. (2023), 38 S.

Baumann, P.; Meyer, R.; Zetzsche, G.: Regular Separability in Büchi VASS. (2023), 31 S.

Bernstein, A.; Nanongkai, D.; Wulff-Nilsen, C.: Negative-Weight Single-Source Shortest Paths in Near-linear Time. (2023), 38 S.

Bhattacharya, S.; Kiss, P.; Saranurak, T.: Dynamic (1.5+Epsilon)-Approximate Matching Size in Truly Sublinear Update Time. (2023), 42 S.

Blikstad, J.; Kiss, P.: Incremental (1 - ε)-approximate dynamic matching in O(poly(1/ε)) update time. (2023), 19 S.

Bromberger, M.; Leutgeb, L.; Weidenbach, C.: Explicit Model Construction for Saturated Constrained Horn Clauses. (2023), 22 S.

Bromberger, M.; Schwarz, S.; Weidenbach, C.: SCL(FOL) Revisited. (2023), 23 S.