*Lecture Notes in Computer Science - Proceedings of 26th International Colloquium on Structural Information and Communication Complexity (Scirocco 2019, to be published)*, July 2019. L'Aquila, Italy.

# Volker Turau

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

- Distributed Algorithms
- Distributed Systems
- Operating Systems
- Randomised Algorithms and Random Graphs
- Software for Embedded Systems
- Seminar Smart Grids

## Publications

Volker Turau. Self-Stabilizing Randomized Algorithms. In

@InProceedings{Telematik_Scirocco_2019,
author = {Volker Turau},
title = {Self-Stabilizing Randomized Algorithms},
booktitle = {Lecture Notes in Computer Science - Proceedings of 26th International Colloquium on Structural Information and Communication Complexity (Scirocco 2019, to be published)},
pages = ,
day = {1-4},
month = jul,
year = 2019,
location = {L'Aquila, Italy},
}

Florian Meyer and Volker Turau. Delay-Bounded Scheduling in IEEE 802.15.4e DSME using Linear Programming. In

*Proceedings of 1st International Workshop on Intelligent Systems for the Internet of Things (ISIoT 2019), to be published*, May 2019. Santorini, Greece.@InProceedings{Telematik_ISIoT_2019,
author = {Florian Meyer and Volker Turau},
title = {Delay-Bounded Scheduling in IEEE 802.15.4e DSME using Linear Programming},
booktitle = {Proceedings of 1st International Workshop on Intelligent Systems for the Internet of Things (ISIoT 2019), to be published},
pages = ,
day = {29-31},
month = may,
year = 2019,
location = {Santorini, Greece},
}

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)*, June 2018, pp. 72–87. Ma'ale HaHamisha, Israel.@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 = {72-87},
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.

The complete list of publications is available separately.