Konrad Schlude

According to our database, Konrad Schlude authored at least 7 papers between 2001 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

On the Complexity of Variations of Equal Sum Subsets.

Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis, Konrad Schlude

Nord. J. Comput., 2008

2003

Distributed Search Trees: Fault Tolerance in an Asynchronous Environment.

Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer

Theory Comput. Syst., 2003

Improving Customer Proximity to Railway Stations.

Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Distributed data & resources: models, tractability, and complexity.

Konrad Schlude

PhD thesis, 2002

Distributed Highly Available Search Trees.

Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer

Proceedings of the SIROCCO 9, 2002

Server Placements, Roman Domination and other Dominating Set Variants.

Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

On the Complexity of Train Assignment Problems.

Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001