Jara Uitto

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 75

Top Topics

Memory Efficient

Finite State Machines

Massively Parallel

Top Venues

Theor. Comput. Sci.

ETH Zurich (PHD)

Education History

ETH Zurich

PHD

Publications

Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto
Conditionally Optimal Parallel Coloring of Forests. DISC (2023)
Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto
Adaptive Massively Parallel Connectivity in Optimal Space. SPAA (2023)
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
Fast Dynamic Programming in Trees in the MPC Model. CoRR (2023)
Yannic Maus, Saku Peltonen, Jara Uitto
Distributed Symmetry Breaking on Power Graphs via Sparsification. PODC (2023)
Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto
Sinkless Orientation Made Simple. SOSA (2023)
Yannic Maus, Saku Peltonen, Jara Uitto
Distributed Symmetry Breaking on Power Graphs via Sparsification. CoRR (2023)
Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto
Conditionally Optimal Parallel Coloring of Forests. CoRR (2023)
Mélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. CoRR (2023)
Jakub Lacki, Rustam Latypov, Yannic Maus, Jara Uitto
Adaptive Massively Parallel Connectivity in Optimal Space. CoRR (2023)
Mélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. DISC (2023)
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
Fast Dynamic Programming in Trees in the MPC Model. SPAA (2023)
Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
Optimal Deterministic Massively Parallel Connectivity on Forests. SODA (2023)
Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
Optimal Deterministic Massively Parallel Connectivity on Forests. CoRR (2022)
Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
Exponential Speedup Over Locality in MPC with Optimal Memory. CoRR (2022)
Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
Exponential Speedup over Locality in MPC with Optimal Memory. DISC (2022)
Manuela Fischer, Slobodan Mitrovic, Jara Uitto
) passes in the semi-streaming model and beyond. STOC (2022)
Yannic Maus, Jara Uitto
Efficient CONGEST Algorithms for the Lovasz Local Lemma. CoRR (2021)
Mélanie Cambus, Davin Choo, Havu Miikonen, Jara Uitto
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. DISC (2021)
Manuela Fischer, Slobodan Mitrovic, Jara Uitto
Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model. CoRR (2021)
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto
Efficient Load-Balancing through Distributed Token Dropping. SPAA (2021)
Yannic Maus, Jara Uitto
Efficient CONGEST Algorithms for the Lovász Local Lemma. DISC (2021)
Mélanie Cambus, Davin Choo, Havu Miikonen, Jara Uitto
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. CoRR (2021)
Sebastian Brandt, Manuela Fischer, Jara Uitto
Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory. Theor. Comput. Sci. 849 (2021)
Sebastian Brandt, Rustam Latypov, Jara Uitto
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. DISC (2021)
Sebastian Brandt, Rustam Latypov, Jara Uitto
Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. CoRR (2021)
Rustam Latypov, Jara Uitto
Deterministic 3-Coloring of Trees in the Sublinear MPC model. CoRR (2021)
Sebastian Brandt, Julian Portmann, Jara Uitto
Tight Bounds for Deterministic High-Dimensional Grid Exploration. DISC (2020)
Sebastian Brandt, Jara Uitto, Roger Wattenhofer
A tight lower bound for semi-synchronous collaborative grid exploration. Distributed Comput. 33 (6) (2020)
Yuval Emek, Jara Uitto
Dynamic networks of finite state machines. Theor. Comput. Sci. 810 (2020)
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto
Efficient Load-Balancing through Distributed Token Dropping. CoRR (2020)
Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer
A tight lower bound for the capture time of the Cops and Robbers game. Theor. Comput. Sci. 839 (2020)
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. DISC (2020)
Sebastian Brandt, Julian Portmann, Jara Uitto
Tight Bounds for Deterministic High-Dimensional Grid Exploration. CoRR (2020)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto
Improved distributed degree splitting and edge coloring. Distributed Comput. 33 (3-4) (2020)
Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma. ACM Trans. Algorithms 16 (1) (2020)
Anders Martinsson, Jara Uitto
Navigating an Infinite Space with Unreliable Movements. SODA (2020)
Mohsen Ghaffari, Jara Uitto
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. SODA (2019)
Mohsen Ghaffari, Fabian Kuhn, Jara Uitto
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. FOCS (2019)
Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
On the Complexity of Distributed Splitting Problems. PODC (2019)
Sebastian Brandt, Manuela Fischer, Jara Uitto
SIROCCO 2019 Review. SIGACT News 50 (4) (2019)
Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
On the Complexity of Distributed Splitting Problems. CoRR (2019)
Sebastian Brandt, Manuela Fischer, Jara Uitto
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory. SIROCCO (2019)
Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC (2019)
Sebastian Brandt, Yannic Maus, Jara Uitto
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. PODC (2019)
Sebastian Brandt, Yannic Maus, Jara Uitto
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. CoRR (2019)
Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, Yufan Zheng
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. PODC (2019)
Anders Martinsson, Jara Uitto
Navigating an Infinite Space with Unreliable Movements. CoRR (2019)
Mohsen Ghaffari, Jara Uitto
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. CoRR (2018)
Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto
Distributed Recoloring. DISC (2018)
Manuela Fischer, Mohsen Ghaffari, Jara Uitto
Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation. CoRR (2018)
Sebastian Brandt, Jara Uitto, Roger Wattenhofer
A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration. DISC (2018)
Sebastian Brandt, Manuela Fischer, Jara Uitto
Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model. CoRR (2018)
Manuela Fischer, Jara Uitto
Memory per Machine. CoRR (2018)
Sebastian Brandt, Seth Pettie, Jara Uitto
Fine-grained Lower Bounds on Cops and Robbers. ESA (2018)
Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto
The Complexity of Distributed Edge Coloring with Small Palettes. SODA (2018)
Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto
Distributed Recoloring. CoRR (2018)
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
Deterministic distributed edge-coloring with fewer colors. STOC (2018)
Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto
Exploring an Infinite Space with Finite Memory Scouts. CoRR (2017)
Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. ICALP (2017)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto
Improved Distributed Degree Splitting and Edge Coloring. CoRR (2017)
Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto
Exploring an Infinite Space with Finite Memory Scouts. SODA (2017)
Sebastian Brandt, Jara Uitto, Roger Wattenhofer
Tight Bounds for Asynchronous Collaborative Grid Exploration. CoRR (2017)
Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto
The Complexity of Distributed Edge Coloring with Small Palettes. CoRR (2017)
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
Deterministic Distributed Edge-Coloring with Fewer Colors. CoRR (2017)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto
Improved Distributed Degree Splitting and Edge Coloring. DISC (2017)
Yuval Emek, Jara Uitto
Dynamic Networks of Finite State Machines. CoRR (2017)
Yuval Emek, Jara Uitto
Dynamic Networks of Finite State Machines. SIROCCO (2016)
Jara Uitto, Roger Wattenhofer
On competitive recommendations. Theor. Comput. Sci. 620 (2016)
Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto
A lower bound for the distributed Lovász local lemma. STOC (2016)
Klaus-Tycho Förster, Rijad Nuridini, Jara Uitto, Roger Wattenhofer
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond. SIROCCO (2015)
Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto
A Lower Bound for the Distributed Lovász Local Lemma. CoRR (2015)
Jara Uitto, Roger Wattenhofer
Ignorant vs. Anonymous Recommendations. ESA (2015)
Tobias Langner, Barbara Keller, Jara Uitto, Roger Wattenhofer
Overcoming Obstacles with Ants. OPODIS (2015)
Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer
How many ants does it take to find the food? Theor. Comput. Sci. 608 (2015)
Jochen Seidel, Jara Uitto, Roger Wattenhofer
Randomness vs. Time in Anonymous Networks. DISC (2015)
Tobias Langner, Jara Uitto, David Stolz, Roger Wattenhofer
Fault-Tolerant ANTS. DISC (2014)
Klaus-Tycho Förster, Alex Gross, Nino Hail, Jara Uitto, Roger Wattenhofer
SpareEye: enhancing the safety of inattentionally blind smartphone users. MUM (2014)
Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer
Solving the ANTS Problem with Asynchronous Finite State Machines. ICALP (2) (2014)
Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer
How Many Ants Does It Take to Find the Food? SIROCCO (2014)
Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer
Ants: Mobile Finite State Machines. CoRR (2013)
Jara Uitto, Roger Wattenhofer
On Competitive Recommendations. ALT (2013)
Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto
Local algorithms in (weakly) coloured graphs CoRR (2010)
Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto
A Local 2-Approximation Algorithm for the Vertex Cover Problem. DISC (2009)