Jara Uitto

772 total citations
20 papers, 151 citations indexed

About

Jara Uitto is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Jara Uitto has authored 20 papers receiving a total of 151 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 9 papers in Artificial Intelligence. Recurrent topics in Jara Uitto's work include Complexity and Algorithms in Graphs (13 papers), Optimization and Search Problems (11 papers) and Modular Robots and Swarm Intelligence (4 papers). Jara Uitto is often cited by papers focused on Complexity and Algorithms in Graphs (13 papers), Optimization and Search Problems (11 papers) and Modular Robots and Swarm Intelligence (4 papers). Jara Uitto collaborates with scholars based in Switzerland, Finland and Germany. Jara Uitto's co-authors include Mohsen Ghaffari, Sebastian Brandt, Manuela Fischer, Fabian Kühn, Yuval Emek, Roger Wattenhofer, Juho Hirvonen, Jukka Suomela, Yi‐Jun Chang and Joel Rybicki and has published in prestigious journals such as Theoretical Computer Science, Distributed Computing and ACM Transactions on Algorithms.

In The Last Decade

Jara Uitto

18 papers receiving 150 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jara Uitto Switzerland 7 113 76 52 21 13 20 151
Eiji Miyano Japan 8 113 1.0× 97 1.3× 36 0.7× 8 0.4× 10 0.8× 47 184
Steffen Reith Germany 7 75 0.7× 90 1.2× 59 1.1× 7 0.3× 4 0.3× 20 167
Karol Suchan Chile 7 103 0.9× 44 0.6× 26 0.5× 5 0.2× 4 0.3× 28 141
Bart M. P. Jansen Netherlands 10 216 1.9× 54 0.7× 28 0.5× 10 0.5× 20 1.5× 45 254
Hamid Zarrabi-Zadeh Canada 6 42 0.4× 51 0.7× 28 0.5× 32 1.5× 46 3.5× 22 120
Tony Tan Belgium 6 44 0.4× 24 0.3× 42 0.8× 23 1.1× 29 2.2× 26 111
Panagiotis Kouvaros United Kingdom 9 87 0.8× 27 0.4× 154 3.0× 21 1.0× 18 190
Mehmet Hakan Karaata Kuwait 8 33 0.3× 232 3.1× 33 0.6× 5 0.2× 3 0.2× 43 252
Vinícius F. dos Santos Brazil 7 88 0.8× 15 0.2× 50 1.0× 6 0.3× 4 0.3× 39 148
Joseph L. Ganley United States 8 74 0.7× 71 0.9× 12 0.2× 11 0.5× 39 3.0× 25 239

Countries citing papers authored by Jara Uitto

Since Specialization
Citations

This map shows the geographic impact of Jara Uitto's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jara Uitto with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jara Uitto more than expected).

Fields of papers citing papers by Jara Uitto

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jara Uitto. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jara Uitto. The network helps show where Jara Uitto may publish in the future.

Co-authorship network of co-authors of Jara Uitto

This figure shows the co-authorship network connecting the top 25 collaborators of Jara Uitto. A scholar is included among the top collaborators of Jara Uitto based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jara Uitto. Jara Uitto is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Uitto, Jara, et al.. (2024). Adaptive Massively Parallel Coloring in Sparse Graphs. Aaltodoc (Aalto University). 508–518. 1 indexed citations
2.
Särkkä, Simo, et al.. (2023). Fast Dynamic Programming in Trees in the MPC Model. Aaltodoc (Aalto University). 443–453.
3.
Uitto, Jara, et al.. (2023). Distributed Symmetry Breaking on Power Graphs via Sparsification. Aaltodoc (Aalto University). 157–167. 1 indexed citations
4.
Fischer, Manuela, Slobodan Mitrović, & Jara Uitto. (2022). Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond. Repository for Publications and Research Data (ETH Zurich). 248–260. 10 indexed citations
5.
Brandt, Sebastian, Yuval Emek, Jara Uitto, & Roger Wattenhofer. (2020). A tight lower bound for the capture time of the Cops and Robbers game. Theoretical Computer Science. 839. 143–163. 2 indexed citations
6.
Brandt, Sebastian, Jara Uitto, & Roger Wattenhofer. (2020). A tight lower bound for semi-synchronous collaborative grid exploration. Distributed Computing. 33(6). 471–484.
7.
Behnezhad, Soheil, Sebastian Brandt, Mahsa Derakhshan, et al.. (2019). Massively Parallel Computation of Matching and MIS in Sparse Graphs. 481–490. 16 indexed citations
8.
Ghaffari, Mohsen, Fabian Kühn, & Jara Uitto. (2019). Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. Aaltodoc (Aalto University). 1650–1663. 18 indexed citations
10.
Chang, Yi‐Jun, et al.. (2019). Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma. ACM Transactions on Algorithms. 16(1). 1–51. 5 indexed citations
11.
Brandt, Sebastian, et al.. (2019). A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. 389–398. 2 indexed citations
12.
Brandt, Sebastian, Jara Uitto, & Roger Wattenhofer. (2018). A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 121. 13. 2 indexed citations
13.
Ghaffari, Mohsen, et al.. (2017). Improved Distributed Degree Splitting and Edge Coloring. arXiv (Cornell University). 3 indexed citations
14.
Emek, Yuval & Jara Uitto. (2017). Dynamic networks of finite state machines. Theoretical Computer Science. 810. 58–71. 6 indexed citations
15.
Ghaffari, Mohsen, et al.. (2017). Improved distributed degree splitting and edge coloring. Repository for Publications and Research Data (ETH Zurich). 2 indexed citations
16.
Brandt, Sebastian, Yuval Emek, Jara Uitto, & Roger Wattenhofer. (2017). A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 80. 13. 1 indexed citations
17.
Langner, Tobias, Barbara Keller, Jara Uitto, & Roger Wattenhofer. (2016). Overcoming Obstacles with Ants. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 46. 17. 1 indexed citations
18.
Brandt, Sebastian, et al.. (2016). A lower bound for the distributed Lovász local lemma. 479–488. 39 indexed citations
19.
Emek, Yuval, et al.. (2015). How many ants does it take to find the food?. Theoretical Computer Science. 608. 255–267. 10 indexed citations
20.
Foerster, Klaus-Tycho, et al.. (2014). SpareEye. 68–72. 14 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026