Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jara Uitto is active.

Publication


Featured researches published by Jara Uitto.


international symposium on distributed computing | 2009

A local 2-approximation algorithm for the vertex cover problem

Matti Åstrand; Patrik Floréen; Valentin Polishchuk; Joel Rybicki; Jukka Suomela; Jara Uitto

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 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.


international colloquium on automata, languages and programming | 2014

Solving the ANTS Problem with Asynchronous Finite State Machines

Yuval Emek; Tobias Langner; Jara Uitto; Roger Wattenhofer

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 asynchronous (randomized) finite state machine: they possess a constant-size memory and can locally communicate with each other through constant-size messages. Despite the restriction to constant-size memory, we show that their collaborative performance remains the same by presenting a distributed algorithm that matches a lower bound established by Feinerman et al. on the run-time of any ANTS algorithm.


symposium on the theory of computing | 2016

A lower bound for the distributed Lovász local lemma

Sebastian Brandt; Orr Fischer; Juho Hirvonen; Barbara Keller; Tuomo Lempiäinen; Joel Rybicki; Jukka Suomela; Jara Uitto

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 algorithms for the Lovász local lemma with a running time of O(log n) rounds in bounded-degree graphs, and the best lower bound before our work was Omega(log* n) rounds [Chung et al. 2014].


International Colloquium on Structural Information and Communication Complexity | 2014

How Many Ants Does It Take to Find the Food

Yuval Emek; Tobias Langner; David Stolz; Jara Uitto; Roger Wattenhofer

Consider the Ants Nearby Treasure Search (ANTS) problem, where n mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. The agents are controlled by deterministic/randomized finite or pushdown automata and are able to communicate with each other through constant-size messages. We show that the minimum number of agents required to solve the ANTS problem crucially depends on the computational capabilities of the agents as well as the timing parameters of the execution environment. We give lower and upper bounds for different scenarios.


international symposium on distributed computing | 2014

Fault-Tolerant ANTS

Tobias Langner; Jara Uitto; David Stolz; Roger Wattenhofer

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 recover from them, thereby providing robustness to the protocol. More precisely, we provide a protocol that allows the agents to locate the treasure in time \(\mathcal{O}(D + D^2/n + Df)\) where D is the distance to the treasure and \(f \in \mathcal{O}(n)\) is the maximum number of failures.


mobile and ubiquitous multimedia | 2014

SpareEye: enhancing the safety of inattentionally blind smartphone users

Klaus-Tycho Foerster; Alex Gross; Nino Hail; Jara Uitto; Roger Wattenhofer

Using mobile phones while walking for activities that require continuous focus on the screen, such as texting, has become more and more popular in the last years. To avoid colliding with obstacles, such as lampposts and pedestrians, focus has to be taken off the screen in regular intervals. In this paper we introduce SpareEye, an Android application that warns the smartphone user from obstacles in her way. We use only the camera of the phone and no special hardware, ensuring that it requires minimal effort from the user to use the application during everyday life. Experimental results show that we can detect obstacles with high accuracy, with only some false positives and few false negatives.


Theoretical Computer Science | 2015

How many ants does it take to find the food

Yuval Emek; Tobias Langner; David Stolz; Jara Uitto; Roger Wattenhofer

Consider the Ants Nearby Treasure Search (ANTS) problem, where n mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. The agents are controlled by deterministic/randomized finite or pushdown automata and are able to communicate with each other through constant-size messages. We show that the minimum number of agents required to solve the ANTS problem crucially depends on the computational capabilities of the agents as well as the timing parameters of the execution environment. We give lower and upper bounds for different scenarios.


SIROCCO 2015 Post-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 9439 | 2015

Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond

Klaus-Tycho Förster; Rijad Nuridini; Jara Uitto; Roger Wattenhofer

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


international colloquium on automata, languages and programming | 2017

A Tight Lower Bound for the Capture Time of the Cops and Robbers Game.

Sebastian Brandt; Yuval Emek; Jara Uitto; Roger Wattenhofer

\ell \in {\mathcal{O}}\leftn\right


international symposium on distributed computing | 2015

Randomness vs. Time in Anonymous Networks

Jochen Seidel; Jara Uitto; Roger Wattenhofer

robbers can take

Collaboration


Dive into the Jara Uitto's collaboration.

Top Co-Authors

Avatar

Yuval Emek

Technion – Israel Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Joel Rybicki

Helsinki Institute for Information Technology

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge