In what year did the author of 'Asynchronous Random Polling Dynamic Load Balancing' become a professor at Karlsruhe Institute of Technology?
2004
Towards Optimal Locality in Mesh-Indexings. (2002) authored by Peter Sanders 0001. Jan Wassenberg et al.: An Efficient Parallel Algorithm for Graph-Based Image Segmentation. (2009) authored by Peter Sanders 0001. Daniel Funke et al.: A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. (2023) authored by Peter Sanders 0001. Hans-Peter Lehmann et al.: ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. (2023) authored by Peter Sanders 0001. authored by Peter Sanders 0001. Julian Arz et al.: 3D Cell Nuclei Segmentation with Balanced Graph Partitioning. (2009) authored by Peter Sanders 0001. Yaroslav Akhremtsev et al.: Space Efficient Hash Tables with Worst Case Constant Access Time. (2009) authored by Peter Sanders 0001. Peter Sanders 0001 is the author of Ilya Safro et al.: k-way Hypergraph Partitioning via n-Level Recursive Bisection. (2014). He is also the author of Jens Maue et al.: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. Ümit V. <unk>atalyürek et al.: More Recent Advances in (Hyper)Graph Partitioning. (2022) authored by Peter Sanders 0001. Lars Gottesbüren et al.: Scalable High-Quality Hypergraph Partitioning. (2023) authored by Peter Sanders 0001. Florian Kurpicz et al.: PaCHash: Packed and Compressed Hash Tables. (2022) authored by Peter Sanders 0001. Aydin Buluç et al.: Recent Advances in Graph Partitioning. (2016) authored by Peter Sanders 0001. Ümit V. <unk>atalyürek et al.: Advanced Coarsening Schemes for Graph Partitioning. (2005) authored by Peter Sanders 0001. Timo Bingmann et al.: Engineering Parallel String Sorting. (2017) authored by Peter Sanders 0001'<unk>.
[INST]
Utilize the provided context information, to generate answers to the following question: 
- Generate the answer to the question based on the provided context.
- Avoid including any explanations or apologies in your responses.
- Only respond to questions that ask for the answer to the target question without any additional information.
- Strictly provide the answer without any additional text.
Question: In what year did the author of 'Asynchronous Random Polling Dynamic Load Balancing' become a professor at Karlsruhe Institute of Technology?
Context: Towards Optimal Locality in Mesh-Indexings. (2002) authored by Peter Sanders 0001. Jan Wassenberg et al.: An Efficient Parallel Algorithm for Graph-Based Image Segmentation. (2009) authored by Peter Sanders 0001. Daniel Funke et al.: A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. (2023) authored by Peter Sanders 0001. Hans-Peter Lehmann et al.: ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. (2023) authored by Peter Sanders 0001. authored by Peter Sanders 0001. Julian Arz et al.: 3D Cell Nuclei Segmentation with Balanced Graph Partitioning. (2009) authored by Peter Sanders 0001. Yaroslav Akhremtsev et al.: Space Efficient Hash Tables with Worst Case Constant Access Time. (2009) authored by Peter Sanders 0001. Peter Sanders 0001 is the author of Ilya Safro et al.: k-way Hypergraph Partitioning via n-Level Recursive Bisection. (2014). He is also the author of Jens Maue et al.: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. Ümit V. <unk>atalyürek et al.: More Recent Advances in (Hyper)Graph Partitioning. (2022) authored by Peter Sanders 0001. Lars Gottesbüren et al.: Scalable High-Quality Hypergraph Partitioning. (2023) authored by Peter Sanders 0001. Florian Kurpicz et al.: PaCHash: Packed and Compressed Hash Tables. (2022) authored by Peter Sanders 0001. Aydin Buluç et al.: Recent Advances in Graph Partitioning. (2016) authored by Peter Sanders 0001. Ümit V. <unk>atalyürek et al.: Advanced Coarsening Schemes for Graph Partitioning. (2005) authored by Peter Sanders 0001. Timo Bingmann et al.: Engineering Parallel String Sorting. (2017) authored by Peter Sanders 0001'<unk>.
[/INST] Answer:
