print page

Volker Turau

Picture of Volker Turau
Prof. Dr. rer. nat. Volker Turau
Room 4.088, building E
Am Schwarzenberg-Campus 3
21073 Hamburg
phone+49 40 42878 - 3530
fax+49 40 427 - 3 - 10456
e-mail

I am professor at Hamburg Universtity of Technology since October 2002.


Program Committee Activities | Editorial Activities | CV | Ph.D. students

Books

Algorithmische Graphentheorie - 4., extended and revised edition
De Gruyter Studium, 2015, ISBN 978-3-110-41727-2 (Solutions)

Erdős number

My Erdős number is 4.

Teaching

Publications

Fairouz Beggas, Volker Turau, Mohammed Haddad and Hamamache Kheddouci. [1,2]-domination in generalized Petersen graphs. Technical Report, 2019.
@TechReport{Telematik2019, author = {Fairouz Beggas and Volker Turau and Mohammed Haddad and Hamamache Kheddouci}, title = {[1,2]-domination in generalized Petersen graphs}, pages = , journal = {Discrete Mathematics, Algorithms and Applications}, publisher = {World Scientific}, month = , year = 2019, }
Fairouz Beggas, Volker Turau, Mohammed Haddad and Hamamache Kheddouci. [1,2]-domination in generalized Petersen graphs. Discrete Mathematics, Algorithms and Applications, 2019.
@Article{Telematik__2019, author = {Fairouz Beggas and Volker Turau and Mohammed Haddad and Hamamache Kheddouci}, title = {[1,2]-domination in generalized Petersen graphs}, pages = , journal = {Discrete Mathematics, Algorithms and Applications}, publisher = {World Scientific}, month = , year = 2019, }
Volker Turau. Stateless Information Dissemination Algorithms. In Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Springer, June 2020, pp. 183–199.
@InProceedings{Telematik_sirocco_2020, author = {Volker Turau}, title = {Stateless Information Dissemination Algorithms}, booktitle = {Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020}, pages = {183-199}, publisher = {Springer}, day = {29-1}, month = jun, year = 2020, location = {}, }
Abstract: Stateless protocols are advantageous in high volume applications, increasing performance by removing the load caused by retention of session information and by providing crash tolerance. In this paper we present an optimal stateless information dissemination algorithm for synchronous distributed systems. The termination time is considerable lower than that of a recently proposed stateless dissemination protocol. Apart from a special case the new algorithm achieves the minimum possible termination time. The problem of selecting k dissemination nodes with minimal termination time is NP-hard. We prove that unless NP = P there is no approximation algorithm for this problem with approximation ratio 3/2−ϵ. We also prove for asynchronous systems that deterministic stateless information dissemination is only possible if a large enough part of the message can be updated by each node.

The complete list of publications is available separately.

Supervised Theses

Open Theses

Ongoing Theses

Completed Theses