Professor
Vgl. http://sprechstunde.peterfaber.net
A Closer Look at Loop-Carried Code Replacement.
Gesellschaft für Informatik e.V pg. 109-118
(2001)
Loop-Carried Code Placement.
SV pg. 340-348
(2001)
Replicated Placements in the Polyhedron Model.
Springer-Verlag pg. 303-308
(2003)
Polyhedral Loop Parallelization: The Fine Grain.
LRR-TUM, Technische Universität München pg. 25-36
(2004)
Space-time mapping and tiling: a helpful combination.
In: Concurrency and Computation: Practice and Experience (vol. 16) , pg. 221-246
(2004)
DOI: 10.1002/cpe.772
Code Optimization in the Polyhedron Model ‐ Improving the Efficiency of Parallel Loop Nests.
Universität Passau
(2007)
Virtuelles Guckloch.
In: c’t Magazin für Computer Technik (vol. 24) , pg. 212-216
(2013)
Parallelwelten.
In: c’t Magazin für Computer Technik (vol. 26) , pg. 160-165
(2014)
Panoramabilder auf Android-Handys anzeigen.
In: c’t Programmieren , pg. 212-216
(2014)
A Comparison of GPGPU Computing Frameworks on Embedded Systems.
In: IFAC-PapersOnLine/13th IFAC and IEEE Conference on Programmable Devices and Embedded Systems — PDES 2015 (vol. 48) , pg. 240-245
(2015)
DOI: 10.1016/j.ifacol.2015.07.040
Using Code Metrics for Android Programming.
In: Bavarian Journal of Applied Sciences , pg. 162-175
(2016)
DOI: 10.25929/y4b9-e908
Contactless Inductive Flow Tomography (CIFT). Posterpräsentation.
Deggendorf 10.04.2019.
(2019)
High-Performance and Quantum Computing for Students.
Bonn: Gesellschaft für Informatik vol. P-326 pg. 1085-1091
(2022)
Travel Mate Matching – Strengthening Shared Mobility through the Formation of Interest Groups.
Deggendorf; Online 13.05.2022.
DGS206 (HPC I / Computergrafik)