Publications associées à Indicatrice de Carmichael

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of w workers and a multiset T ⊆ [t] of |T| = w tasks, a memoryless worker-task assignment function is any function ϕ that assigns the workers ...

Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik2022

What are the Longest Ropes on the Unit Sphere?

Henryk Gerlach

We consider the variational problem of finding the longest closed curves of given minimal thickness on the unit sphere. After establishing the existence of solutions for any given thickness between 0 and 1, we explicitly construct for each given thickness ...

Springer-Verlag2011

Ideal knots and other packing problems of tubes

Henryk Gerlach

This thesis concerns optimal packing problems of tubes, or thick curves, where thickness is defined as follows. Three points on a closed space curve define a circle. Taking the infimum over all radii of pairwise-distinct point triples defines the thickness ...

EPFL2010

The Disagreement Power of an Adversary

Rachid Guerraoui

At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where t processes can crash is exactly t + 1. In other words, an adversary that can crash any subset o ...

2009