Formally Verifying an Efficient Sorter
Beckert, B.; Sanders, P.; Ulbrich, M.; Witt, S.; Wiesler, J.
2024. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000167846  

Formally Verifying an Efficient Sorter
Beckert, B.; Sanders, P.; Ulbrich, M.; Wiesler, J.; Witt, S.
2024. 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, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I. Ed.: B. Finkbeiner, 268–287, Springer Nature Switzerland. doi:10.1007/978-3-031-57246-3_15  

Formally Verifying an Efficient Sorter - Verification and Benchmarking Artifact
Beckert, B.; Sanders, P.; Ulbrich, M.; Wiesler, J.; Witt, S.
2023, Dezember 30. doi:10.5281/zenodo.8436535 

Engineering In-place (Shared-memory) Sorting Algorithms
Axtmann, M.; Witt, S.; Ferizovic, D.; Sanders, P.
2022 

Engineering In-place (Shared-memory) Sorting Algorithms
Axtmann, M.; Witt, S.; Ferizovic, D.; Sanders, P.
2022. ACM Transactions on Parallel Computing, 9 (1), Art.-Nr.: 2. doi:10.1145/3505286 

In-Place Parallel Super Scalar Samplesort (IPSSSSo)
Axtmann, M.; Witt, S.; Ferizovic, D.; Sanders, P.
2017. 25th European Symposium on Algorithms : (ESA 2017) Vienna, Austria, September 4-6, 2017. Ed.: K. Pruhs, C. Sohler, Art.Nr. 9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2017.9  

Trip-Based Public Transit Routing Using Condensed Search Trees
Witt, S.
2016. 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), Aarhus, Denmark, August 25, 2016. Ed.: M. Goerigk, 10.1–10.12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/OASIcs.ATMOS.2016.10  

Trip-Based Public Transit Routing
Witt, S.
2015. Algorithms - ESA 2015. 23rd Annual European Symposium Patras, Greece, September 14–16, 2015. Proceedings. Ed.: N. Bansal, 1025–1036, Springer-Verlag. doi:10.1007/978-3-662-48350-3_85