A Local 2-Approximation Algorithm for the Vertex Cover Problem. - Matti Åstrand; Patrik Floréen; Valentin Polishchuk; Joel Rybicki; Jukka Suomela; Jara Uitto (DISC, 2009)

Local algorithms in (weakly) coloured graphs - Matti Åstrand; Valentin Polishchuk; Joel Rybicki; Jukka Suomela; Jara Uitto (CoRR, 2010)

Ants: Mobile Finite State Machines. - Yuval Emek; Tobias Langner 001; Jara Uitto; Roger Wattenhofer (CoRR, 2013)

Solving the ANTS Problem with Asynchronous Finite State Machines. - Yuval Emek; Tobias Langner 001; Jara Uitto; Roger Wattenhofer (ICALP (2), 2014)

SpareEye: enhancing the safety of inattentionally blind smartphone users. - Klaus-Tycho Förster; Alex Gross; Nino Hail; Jara Uitto; Roger Wattenhofer (MUM, 2014)

Fault-Tolerant ANTS. - Tobias Langner 001; Jara Uitto; David Stolz; Roger Wattenhofer (DISC, 2014)

Ignorant vs. Anonymous Recommendations. - Jara Uitto; Roger Wattenhofer (ESA, 2015)

Overcoming Obstacles with Ants. - Tobias Langner 001; Barbara Keller; Jara Uitto; Roger Wattenhofer (OPODIS, 2015)

Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond. - Klaus-Tycho Förster; Rijad Nuridini; Jara Uitto; Roger Wattenhofer (SIROCCO, 2015)

Randomness vs. Time in Anonymous Networks. - Jochen Seidel; Jara Uitto; Roger Wattenhofer (DISC, 2015)

How many ants does it take to find the food? - Yuval Emek; Tobias Langner 001; David Stolz; Jara Uitto; Roger Wattenhofer (Theor. Comput. Sci., 2015)

Collaboration in Multi-Agent Systems: Adaptivity and Active Learning. - Jara Uitto (2015)

A lower bound for the distributed Lovász local lemma. - Sebastian Brandt 002; Orr Fischer; Juho Hirvonen; Barbara Keller; Tuomo Lempiäinen; Joel Rybicki; Jukka Suomela; Jara Uitto (STOC, 2016)

On competitive recommendations. - Jara Uitto; Roger Wattenhofer (Theor. Comput. Sci., 2016)

Exploring an Infinite Space with Finite Memory Scouts. - Lihi Cohen; Yuval Emek; Oren Louidor; Jara Uitto (SODA, 2017)

Tight Bounds for Asynchronous Collaborative Grid Exploration. - Sebastian Brandt 002; Jara Uitto; Roger Wattenhofer (CoRR, 2017)

Fine-grained Lower Bounds on Cops and Robbers. - Sebastian Brandt 002; Seth Pettie; Jara Uitto (ESA, 2018)

The Complexity of Distributed Edge Coloring with Small Palettes. - Yi-Jun Chang; Qizheng He; Wenzheng Li; Seth Pettie; Jara Uitto (SODA, 2018)

Deterministic distributed edge-coloring with fewer colors. - Mohsen Ghaffari 001; Fabian Kuhn; Yannic Maus; Jara Uitto (STOC, 2018)

Distributed Recoloring. - Marthe Bonamy; Paul Ouvrard; Mikaël Rabie; Jukka Suomela; Jara Uitto (DISC, 2018)

Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with nε Memory per Machine. - Manuela Fischer; Jara Uitto (CoRR, 2018)

Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (CoRR, 2018)

Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation. - Manuela Fischer; Mohsen Ghaffari 001; Jara Uitto (CoRR, 2018)

Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. - Mohsen Ghaffari 001; Fabian Kuhn; Jara Uitto (FOCS, 2019)

On the Complexity of Distributed Splitting Problems. - Philipp Bamberger; Mohsen Ghaffari 001; Fabian Kuhn; Yannic Maus; Jara Uitto (PODC, 2019)

Massively Parallel Computation of Matching and MIS in Sparse Graphs. - Soheil Behnezhad; Sebastian Brandt 002; Mahsa Derakhshan; Manuela Fischer; MohammadTaghi Hajiaghayi; Richard M. Karp; Jara Uitto (PODC, 2019)

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. - Sebastian Brandt 002; Yannic Maus; Jara Uitto (PODC, 2019)

The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. - Yi-Jun Chang; Manuela Fischer; Mohsen Ghaffari 001; Jara Uitto; Yufan Zheng (PODC, 2019)

Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. - Mohsen Ghaffari 001; Jara Uitto (SODA, 2019)

SIROCCO 2019 Review. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (SIGACT News, 2019)

Navigating an Infinite Space with Unreliable Movements. - Anders Martinsson; Jara Uitto (SODA, 2020)

Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. - Sebastian Brandt 002; Barbara Keller; Joel Rybicki; Jukka Suomela; Jara Uitto (DISC, 2020)

Tight Bounds for Deterministic High-Dimensional Grid Exploration. - Sebastian Brandt 002; Julian Portmann; Jara Uitto (DISC, 2020)

A tight lower bound for semi-synchronous collaborative grid exploration. - Sebastian Brandt 002; Jara Uitto; Roger Wattenhofer (Distributed Comput., 2020)

Improved distributed degree splitting and edge coloring. - Mohsen Ghaffari 001; Juho Hirvonen; Fabian Kuhn; Yannic Maus; Jukka Suomela; Jara Uitto (Distributed Comput., 2020)

Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma. - Yi-Jun Chang; Qizheng He; Wenzheng Li; Seth Pettie; Jara Uitto (ACM Trans. Algorithms, 2020)

A tight lower bound for the capture time of the Cops and Robbers game. - Sebastian Brandt 002; Yuval Emek; Jara Uitto; Roger Wattenhofer (Theor. Comput. Sci., 2020)

Dynamic networks of finite state machines. - Yuval Emek; Jara Uitto (Theor. Comput. Sci., 2020)

Efficient Load-Balancing through Distributed Token Dropping. - Sebastian Brandt 002; Barbara Keller; Joel Rybicki; Jukka Suomela; Jara Uitto (SPAA, 2021)

Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. - Sebastian Brandt 002; Rustam Latypov; Jara Uitto (DISC, 2021)

Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. - Mélanie Cambus; Davin Choo; Havu Miikonen; Jara Uitto (DISC, 2021)

Efficient CONGEST Algorithms for the Lovász Local Lemma. - Yannic Maus; Jara Uitto (DISC, 2021)

Deterministic 3-Coloring of Trees in the Sublinear MPC model. - Rustam Latypov; Jara Uitto (CoRR, 2021)

Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model. - Manuela Fischer; Slobodan Mitrovic; Jara Uitto (CoRR, 2021)

Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. - Sebastian Brandt 002; Rustam Latypov; Jara Uitto (CoRR, 2021)

Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (Theor. Comput. Sci., 2021)

Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond. - Manuela Fischer; Slobodan Mitrovic; Jara Uitto (STOC, 2022)

Exponential Speedup over Locality in MPC with Optimal Memory. - Alkida Balliu; Sebastian Brandt 002; Manuela Fischer; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto (DISC, 2022)

Optimal Deterministic Massively Parallel Connectivity on Forests. - Alkida Balliu; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto (SODA, 2023)

Sinkless Orientation Made Simple. - Alkida Balliu; Janne H. Korhonen; Fabian Kuhn; Henrik Lievonen; Dennis Olivetti; Shreyas Pai; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jan Studený; Jukka Suomela; Jara Uitto (SOSA, 2023)

Fast Dynamic Programming in Trees in the MPC Model. - Chetan Gupta 002; Rustam Latypov; Yannic Maus; Shreyas Pai; Simo Särkkä; Jan Studený; Jukka Suomela; Jara Uitto; Hossein Vahidi 001 (SPAA, 2023)

Adaptive Massively Parallel Connectivity in Optimal Space. - Rustam Latypov; Jakub Lacki; Yannic Maus; Jara Uitto (SPAA, 2023)

Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. - Mélanie Cambus; Fabian Kuhn; Shreyas Pai; Jara Uitto (DISC, 2023)

Conditionally Optimal Parallel Coloring of Forests. - Christoph Grunau; Rustam Latypov; Yannic Maus; Shreyas Pai; Jara Uitto (DISC, 2023)

Adaptive Massively Parallel Coloring in Sparse Graphs. - Rustam Latypov; Yannic Maus; Shreyas Pai; Jara Uitto (PODC, 2024)

A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams. - Mélanie Cambus; Fabian Kuhn; Etna Lindy; Shreyas Pai; Jara Uitto (SODA, 2024)

Shared Randomness Helps with Local Distributed Problems. - Alkida Balliu; Mohsen Ghaffari 001; Fabian Kuhn; Augusto Modanese; Dennis Olivetti; Mikaël Rabie; Jukka Suomela; Jara Uitto (ICALP, 2025)

Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs. - Malte Baumecker; Yannic Maus; Jara Uitto (PODC, 2025)

On the Locality of Hall's Theorem. - Sebastian Brandt 002; Yannic Maus; Ananth Narayanan; Florian Schager; Jara Uitto (SODA, 2025)

A (3+ε)-Approximate Correlation Clustering Algorithm in Dynamic Streams. - Mélanie Cambus; Fabian Kuhn; Etna Lindy; Shreyas Pai; Jara Uitto (TheoretiCS, 2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs. - Malte Baumecker; Yannic Maus; Jara Uitto (CoRR, 2025)

Distributed symmetry breaking on power graphs via sparsification. - Yannic Maus; Saku Peltonen; Jara Uitto (Distributed Comput., 2025)