Volker Turau

Prof. Dr. rer. nat. Volker Turau

Raum 4.088, Gebäude E
Am Schwarzenberg-Campus 3
21073 Hamburg

040 42878 - 3530

040 42878 - 2581

Seit Oktober 2002 bin ich Professor an der Technischen Universität Hamburg.

Program Committee Activities | Editorial Activities | CV | Doktoranden

Bücher

Algorithmische Graphentheorie - 4., erweiterte und überarbeitete Auflage
De Gruyter Studium, 2015, ISBN 978-3-110-41727-2 (Lösungen)

Erdős-Zahl

Meine Erdős-Zahl ist 4.

Lehre

Publikationen

Volker Turau. A O(log n) Distributed Algorithm to Construct Routing Structures for Pub/Sub Systems. In 20th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2018), November 2018. Tokyo, Japan. To be published.

[BibTeX]

@InProceedings{Telematik_sss_2018, author = {Volker Turau}, title = {A O(log n) Distributed Algorithm to Construct Routing Structures for Pub/Sub Systems}, booktitle = {20th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2018)}, pages = , day = {4-7}, month = nov, year = 2018, location = {Tokyo, Japan}, }

Tobias Lübkert, Marcus Venzke und Volker Turau. Calculating retail prices from demand response target schedules to operate domestic electric water heaters. In Energy Informatics 2018, Oktober 2018. Oldenburg, Germany. To be published.

[BibTeX] [Abstract]

@InProceedings{Telematik_EI_2018, author = {Tobias Lübkert and Marcus Venzke and Volker Turau}, title = {Calculating retail prices from demand response target schedules to operate domestic electric water heaters}, booktitle = {Energy Informatics 2018}, pages = , day = {11-12}, month = oct, year = 2018, location = {Oldenburg, Germany}, }

Abstract: The paper proposes a demand response scheme controlling many domestic electric water heaters (DEWHs) with a price function to consume electric power according to a target schedule. It discusses at length the design of an algorithm to calculate the price function from a target schedule. The price function is used by the control of each DEWH to automatically and optimally minimize its local heating costs. It is demonstrated that the resulting total power consumption approximates the target schedule. The algorithm was successfully validated by simulation with a realistic set of 50 DEWHs assuming perfect knowledge of parameters and water consumption. It is shown that the algorithm is also applicable to clusters of large numbers of DEWHs with statistical knowledge only. However, this leads to a slightly higher deviation from the target schedule.

Volker Turau. A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time. In Lecture Notes in Computer Science - Proceedings of 25th International Colloquium on Structural Information and Communication Complexity (Scirocco 2018), Juni 2018. Ma'ale HaHamisha, Israel. To be published.

[BibTeX] [Abstract] [Folien]

@InProceedings{Telematik_Scirocco_2018, author = {Volker Turau}, title = {A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time}, booktitle = {Lecture Notes in Computer Science - Proceedings of 25th International Colloquium on Structural Information and Communication Complexity (Scirocco 2018)}, pages = , day = {18-21}, month = jun, year = 2018, location = {Ma'ale HaHamisha, Israel}, }

Abstract: It is known for some time that a random graph G(n, p) con- tains w.h.p. a Hamiltonian cycle if p is larger than the critical value pcrit = (log n+log log n+ωn)/n. The determination of a concrete Hamil- tonian cycle is even for values much larger than pcrit a nontrivial task. In this paper we consider random graphs G(n, p) with p in Ω ̃(1/√n), where Ω ̃ hides poly-logarithmic factors in n. For this range of p we present a distributed algorithm AHC that finds w.h.p. a Hamiltonian cycle in O(log n) rounds. The algorithm works in the synchronous model and uses messages of size O(log n) and O(log n) memory per node.

Die vollständige Publikationsliste ist separat verfügbar.