#### Filter Results:

- Full text PDF available (26)

#### Publication Year

2009

2017

- This year (6)
- Last 5 years (24)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sebastian Brandt, Orr Fischer, +5 authors Jara Uitto
- STOC
- 2016

We show that any randomised Monte Carlo distributed algorithm for the Lovász local lemma requires Omega(log log n) communication rounds, assuming that it finds a correct assignment with high probability. Our result holds even in the special case of d = O(1), where d is the maximum degree of the dependency graph. By prior work, there are distributed… (More)

- Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer
- ICALP
- 2014

Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed in a single cell of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that each agent is controlled by an… (More)

- Jara Uitto, Roger Wattenhofer
- ALT
- 2013

We are given an unknown binary matrix, where the entries correspond to preferences of users on items. We want to find at least one 1-entry in each row with a minimum number of queries. The number of queries needed heavily depends on the input matrix and a straightforward competitive analysis yields bad results for any online algorithm. Therefore, we analyze… (More)

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆+ 1) synchronous communication rounds, where ∆ is the maximum degree of the graph. For ∆ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

- Tobias Langner, Jara Uitto, David Stolz, Roger Wattenhofer
- DISC
- 2014

In this paper, we study a variant of the Ants Nearby Treasure Search problem, where n mobile agents, controlled by finite automata, search collaboratively for a treasure hidden by an adversary. In our version of the model, the agents may fail at any time during the execution. We provide a distributed protocol that enables the agents to detect failures and… (More)

- Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto
- ArXiv
- 2010

A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum dominating set problem and the maximum matching problem in 2-coloured and weakly 2-coloured graphs. In a weakly 2-coloured graph, both problems admit a local algorithm with the… (More)

- Klaus-Tycho Foerster, Rijad Nuridini, Jara Uitto, Roger Wattenhofer
- SIROCCO
- 2015

In the classical game of Cops and Robbers on graphs, the capture time is defined by the least number of moves needed to catch all robbers with the smallest amount of cops that suffice. While the case of one cop and one robber is well understood, it is an open question how long it takes for multiple cops to catch multiple robbers. We show that capturing ` ∈… (More)

- Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer
- ArXiv
- 2013

Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that the agents are controlled by a… (More)

- Tobias Langner, Barbara Keller, Jara Uitto, Roger Wattenhofer
- OPODIS
- 2015

Consider a group of mobile finite automata, referred to as agents, located in the origin of an infinite grid. The grid is occupied by obstacles, i.e., sets of cells that can not be entered by the agents. In every step, an agent can sense the states of the co-located agents and is allowed to move to any neighboring cell of the grid not blocked by an… (More)

- Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer
- ICALP
- 2017

For the game of Cops and Robbers, it is known that in 1-cop-win graphs, the cop can capture the robber in O(n) time, and that there exist graphs in which this capture time is tight. When k ≥ 2, a simple counting argument shows that in k-cop-win graphs, the capture time is at most O(nk+1), however, no non-trivial lower bounds were previously known; indeed,… (More)