print page

Publications

Journal Articles | Conference Contributions | Students' Theses

 

Also see my profile at Google Scholar

 

Journal Articles

Sven Köhler and Volker Turau. Fault-containing self-stabilization in asynchronous systems with constant fault-gap. Distributed Computing, 2011.
@Article{Telematik_KT_2011_DC, author = {Sven Köhler and Volker Turau}, title = {Fault-containing self-stabilization in asynchronous systems with constant fault-gap}, journal = {Distributed Computing}, year = 2011, issn = {0178-2770}, }

Conference Contributions

Sven Köhler and Volker Turau. Space-efficient fault-containment in dynamic networks. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'11), Springer, October 2011, pp. 311–325. Grenoble, France.
@InProceedings{Telematik_KT_SSS11, author = {Sven Köhler and Volker Turau}, title = {Space-efficient fault-containment in dynamic networks}, booktitle = {Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'11)}, pages = {311-325}, series = {Lecture Notes in Computer Science}, volume = {6976}, publisher = {Springer}, day = {10-12}, month = oct, year = 2011, location = {Grenoble, France}, }
Abstract: Bounding the impact of transient small-scale faults by self-stabilizing protocols has been pursued with independent objectives: Optimizing the system's reaction upon topological changes (e.g. super-stabilization), and reducing system recovery time from memory corruptions (e.g. fault-containment). Even though transformations adding either super-stabilization or fault-containment to existing protocols exists, none of them preserves the other. This paper makes a first attempt to combine both objectives. We provide a transformation adding fault-containment to silent self-stabilizing protocols while simultaneously preserving the property of self-stabilization and the protocol's behavior in face of topological changes. In particular, the protocol's response to a topology change remains unchanged even if a memory corruption occurs in parallel to the topology change. The presented transformation increases the memory footprint only by a factor of 4 and adds O(1) bits per edge. All previously known transformations for fault-containing self-stabilization increase the memory footprint by a factor of 2m/n.
Sven Köhler and Volker Turau. A new Technique for proving Self-Stabilization under the Distributed Scheduler. In Proceedings of the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), Springer, September 2010, pp. 65–79. New York, NY, USA.
@InProceedings{Telematik_KT_ProofTechnique, author = {Sven Köhler and Volker Turau}, title = {A new Technique for proving Self-Stabilization under the Distributed Scheduler}, booktitle = {Proceedings of the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10)}, pages = {65-79}, series = {Lecture Notes in Computer Science}, volume = {6366}, publisher = {Springer}, day = {20-22}, month = sep, year = 2010, location = {New York, NY, USA}, }
Abstract: Proving stabilization of a complex algorithm under the distributed scheduler is a non-trivial task. This paper introduces a new method which allows to extend proofs for the central scheduler to the distributed scheduler. The practicability of the method is shown by applying it to two existing algorithms, for which stabilization under the distributed scheduler was an open problem.
Sven Köhler and Volker Turau. Fault-containing self-stabilization in asynchronous systems with constant fault-gap. In Proceedings of the 30th IEEE International Conference on Distributed Computing Systems (ICDCS'10), IEEE Computer Society, June 2010, pp. 418–427. Genoa, Italy.
@InProceedings{Telematik_KT_FaultContain, author = {Sven Köhler and Volker Turau}, title = {Fault-containing self-stabilization in asynchronous systems with constant fault-gap}, booktitle = {Proceedings of the 30th IEEE International Conference on Distributed Computing Systems (ICDCS'10)}, pages = {418-427}, publisher = {IEEE Computer Society}, day = {21-25}, month = jun, year = 2010, location = {Genoa, Italy}, }
Abstract: This paper presents a new transformation which adds fault-containment properties to any silent self-stabilizing protocol. The transformation features a constant slow-down factor and the fault-gap – that is the minimal time between two containable faults – is constant. The transformation scales well to arbitrarily large systems and avoids global synchronization.
Sven Köhler and Martin Ziegler. On the Stability of Fast Polynomial Arithmetic. In Proceedings of the 8th Conference on Real Numbers and Computers, 2008. Santiago de Compostela, Spain.
@InProceedings{KOEHLER_RNC08, author = {Sven Köhler and Martin Ziegler}, title = {On the Stability of Fast Polynomial Arithmetic}, booktitle = {Proceedings of the 8th Conference on Real Numbers and Computers}, year = 2008, location = {Santiago de Compostela, Spain}, }
Sven Köhler, Christian Schindelhauer and Martin Ziegler. On Approximating Real-World Halting Problems. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory, Springer, 2005, pp. 454–466. Lübeck, Germany.
@InProceedings{KOEHLER_FCT05, author = {Sven Köhler and Christian Schindelhauer and Martin Ziegler}, title = {On Approximating Real-World Halting Problems}, booktitle = {Proceedings of the 15th International Symposium on Fundamentals of Computation Theory}, pages = {454-466}, series = {Lecture Notes in Computer Science}, volume = {3623}, publisher = {Springer}, year = 2005, location = {Lübeck, Germany}, }

Students' Theses

Sven Köhler. Zur Praktikabilität schneller Polynomarithmetik. Diploma Thesis, University of Paderborn, Paderborn, Germany, June 2007.
@MastersThesis{KOEHLER_Diploma, author = {Sven Köhler}, type = {Diploma Thesis}, title = {Zur Praktikabilität schneller Polynomarithmetik}, school = {University of Paderborn}, address = {Paderborn, Germany}, month = jun, year = 2007, }
Sven Köhler. Zur Approximierbarkeit des Halteproblems in einer praktischen Gödelisierung. Bachelor's Thesis, University of Paderborn, Paderborn, Germany, June 2004.
@MastersThesis{KOEHLER_Bachelor, author = {Sven Köhler}, type = {Bachelor's Thesis}, title = {Zur Approximierbarkeit des Halteproblems in einer praktischen Gödelisierung}, school = {University of Paderborn}, address = {Paderborn, Germany}, month = jun, year = 2004, }