default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJara Uitto
Person information
- affiliation: Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c45]Rustam Latypov
, Yannic Maus, Shreyas Pai, Jara Uitto:
Adaptive Massively Parallel Coloring in Sparse Graphs. PODC 2024: 508-518- [c44]Mélanie Cambus, Fabian Kuhn, Etna Lindy, Shreyas Pai, Jara Uitto:
A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams. SODA 2024: 2861-2880 - [i33]Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Adaptive Massively Parallel Coloring in Sparse Graphs. CoRR abs/2402.13755 (2024) - [i32]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Shared Randomness Helps with Local Distributed Problems. CoRR abs/2407.05445 (2024) - 2023
- [c43]Yannic Maus, Saku Peltonen, Jara Uitto:
Distributed Symmetry Breaking on Power Graphs via Sparsification. PODC 2023: 157-167 - [c42]Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Optimal Deterministic Massively Parallel Connectivity on Forests. SODA 2023: 2589-2631 - [c41]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: 175-191 - [c40]Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. SPAA 2023: 431-441 - [c39]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: 443-453 - [c38]Mélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto:
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. DISC 2023: 11:1-11:12 - [c37]Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Conditionally Optimal Parallel Coloring of Forests. DISC 2023: 23:1-23:20 - [i31]Jakub Lacki, Rustam Latypov, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. CoRR abs/2302.04033 (2023) - [i30]Yannic Maus, Saku Peltonen, Jara Uitto:
Distributed Symmetry Breaking on Power Graphs via Sparsification. CoRR abs/2302.06878 (2023) - [i29]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 abs/2305.03693 (2023) - [i28]Mélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto:
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. CoRR abs/2306.00432 (2023) - [i27]Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Conditionally Optimal Parallel Coloring of Forests. CoRR abs/2308.00355 (2023) - 2022
- [c36]Manuela Fischer, Slobodan Mitrovic, Jara Uitto:
Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond. STOC 2022: 248-260 - [c35]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: 9:1-9:21 - [i26]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup Over Locality in MPC with Optimal Memory. CoRR abs/2208.09453 (2022) - [i25]Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Optimal Deterministic Massively Parallel Connectivity on Forests. CoRR abs/2211.03530 (2022) - 2021
- [j9]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: 22-34 (2021) - [c34]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Efficient Load-Balancing through Distributed Token Dropping. SPAA 2021: 129-139 - [c33]Mélanie Cambus, Davin Choo, Havu Miikonen, Jara Uitto:
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. DISC 2021: 15:1-15:18 - [c32]Yannic Maus, Jara Uitto:
Efficient CONGEST Algorithms for the Lovász Local Lemma. DISC 2021: 31:1-31:19 - [c31]Sebastian Brandt, Rustam Latypov, Jara Uitto:
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. DISC 2021: 50:1-50:4 - [i24]Mélanie Cambus, Davin Choo, Havu Miikonen, Jara Uitto:
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. CoRR abs/2102.11660 (2021) - [i23]Rustam Latypov, Jara Uitto:
Deterministic 3-Coloring of Trees in the Sublinear MPC model. CoRR abs/2105.13980 (2021) - [i22]Manuela Fischer, Slobodan Mitrovic, Jara Uitto:
Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model. CoRR abs/2106.04179 (2021) - [i21]Yannic Maus, Jara Uitto:
Efficient CONGEST Algorithms for the Lovasz Local Lemma. CoRR abs/2108.02638 (2021) - [i20]Sebastian Brandt, Rustam Latypov, Jara Uitto:
Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. CoRR abs/2112.09479 (2021) - 2020
- [j8]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved distributed degree splitting and edge coloring. Distributed Comput. 33(3-4): 293-310 (2020) - [j7]Sebastian Brandt, Jara Uitto, Roger Wattenhofer:
A tight lower bound for semi-synchronous collaborative grid exploration. Distributed Comput. 33(6): 471-484 (2020) - [j6]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): 8:1-8:51 (2020) - [j5]Yuval Emek, Jara Uitto:
Dynamic networks of finite state machines. Theor. Comput. Sci. 810: 58-71 (2020) - [j4]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: 143-163 (2020) - [c30]Anders Martinsson, Jara Uitto:
Navigating an Infinite Space with Unreliable Movements. SODA 2020: 1170-1179 - [c29]Sebastian Brandt, Julian Portmann, Jara Uitto:
Tight Bounds for Deterministic High-Dimensional Grid Exploration. DISC 2020: 13:1-13:16 - [c28]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. DISC 2020: 40:1-40:3 - [i19]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Efficient Load-Balancing through Distributed Token Dropping. CoRR abs/2005.07761 (2020) - [i18]Sebastian Brandt, Julian Portmann, Jara Uitto:
Tight Bounds for Deterministic High-Dimensional Grid Exploration. CoRR abs/2005.12623 (2020)
2010 – 2019
- 2019
- [j3]Sebastian Brandt, Manuela Fischer, Jara Uitto:
SIROCCO 2019 Review. SIGACT News 50(4): 46-47 (2019) - [c27]Mohsen Ghaffari, Fabian Kuhn, Jara Uitto:
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. FOCS 2019: 1650-1663 - [c26]Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
On the Complexity of Distributed Splitting Problems. PODC 2019: 280-289 - [c25]Sebastian Brandt, Yannic Maus, Jara Uitto:
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. PODC 2019: 389-398 - [c24]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: 471-480 - [c23]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: 481-490 - [c22]Sebastian Brandt, Manuela Fischer, Jara Uitto:
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory. SIROCCO 2019: 124-138 - [c21]Mohsen Ghaffari, Jara Uitto:
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. SODA 2019: 1636-1653 - [i17]Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
On the Complexity of Distributed Splitting Problems. CoRR abs/1905.11573 (2019) - [i16]Anders Martinsson, Jara Uitto:
Navigating an Infinite Space with Unreliable Movements. CoRR abs/1907.05935 (2019) - [i15]Sebastian Brandt, Yannic Maus, Jara Uitto:
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. CoRR abs/1908.06270 (2019) - 2018
- [c20]Sebastian Brandt, Seth Pettie, Jara Uitto:
Fine-grained Lower Bounds on Cops and Robbers. ESA 2018: 9:1-9:12 - [c19]Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto:
The Complexity of Distributed Edge Coloring with Small Palettes. SODA 2018: 2633-2652 - [c18]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
Deterministic distributed edge-coloring with fewer colors. STOC 2018: 418-430 - [c17]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. DISC 2018: 12:1-12:17 - [c16]Sebastian Brandt, Jara Uitto, Roger Wattenhofer:
A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration. DISC 2018: 13:1-13:17 - [i14]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. CoRR abs/1802.06742 (2018) - [i13]Manuela Fischer, Jara Uitto:
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with nε Memory per Machine. CoRR abs/1802.06748 (2018) - [i12]Sebastian Brandt, Manuela Fischer, Jara Uitto:
Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model. CoRR abs/1807.05374 (2018) - [i11]Mohsen Ghaffari, Jara Uitto:
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. CoRR abs/1807.06251 (2018) - [i10]Manuela Fischer, Mohsen Ghaffari, Jara Uitto:
Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation. CoRR abs/1808.08419 (2018) - 2017
- [c15]Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer:
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. ICALP 2017: 82:1-82:13 - [c14]Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto:
Exploring an Infinite Space with Finite Memory Scouts. SODA 2017: 207-224 - [c13]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. DISC 2017: 19:1-19:15 - [i9]Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto:
Exploring an Infinite Space with Finite Memory Scouts. CoRR abs/1704.02380 (2017) - [i8]Sebastian Brandt, Jara Uitto, Roger Wattenhofer:
Tight Bounds for Asynchronous Collaborative Grid Exploration. CoRR abs/1705.03834 (2017) - [i7]Yuval Emek, Jara Uitto:
Dynamic Networks of Finite State Machines. CoRR abs/1706.03721 (2017) - [i6]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. CoRR abs/1706.04746 (2017) - [i5]Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto:
The Complexity of Distributed Edge Coloring with Small Palettes. CoRR abs/1708.04290 (2017) - [i4]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
Deterministic Distributed Edge-Coloring with Fewer Colors. CoRR abs/1711.05469 (2017) - 2016
- [j2]Jara Uitto, Roger Wattenhofer:
On competitive recommendations. Theor. Comput. Sci. 620: 4-14 (2016) - [c12]Yuval Emek, Jara Uitto:
Dynamic Networks of Finite State Machines. SIROCCO 2016: 19-34 - [c11]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: 479-488 - 2015
- [b1]Jara Uitto:
Collaboration in Multi-Agent Systems: Adaptivity and Active Learning. ETH Zurich, 2015, pp. 1-136 - [j1]Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer:
How many ants does it take to find the food? Theor. Comput. Sci. 608: 255-267 (2015) - [c10]Jara Uitto, Roger Wattenhofer:
Ignorant vs. Anonymous Recommendations. ESA 2015: 1001-1012 - [c9]Tobias Langner, Barbara Keller, Jara Uitto, Roger Wattenhofer:
Overcoming Obstacles with Ants. OPODIS 2015: 9:1-9:17 - [c8]Klaus-Tycho Förster, Rijad Nuridini, Jara Uitto, Roger Wattenhofer:
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond. SIROCCO 2015: 342-356 - [c7]Jochen Seidel, Jara Uitto, Roger Wattenhofer:
Randomness vs. Time in Anonymous Networks. DISC 2015: 263-275 - [i3]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 abs/1511.00900 (2015) - 2014
- [c6]Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer:
Solving the ANTS Problem with Asynchronous Finite State Machines. ICALP (2) 2014: 471-482 - [c5]Klaus-Tycho Förster, Alex Gross, Nino Hail, Jara Uitto, Roger Wattenhofer:
SpareEye: enhancing the safety of inattentionally blind smartphone users. MUM 2014: 68-72 - [c4]Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer:
How Many Ants Does It Take to Find the Food? SIROCCO 2014: 263-278 - [c3]Tobias Langner, Jara Uitto, David Stolz, Roger Wattenhofer:
Fault-Tolerant ANTS. DISC 2014: 31-45 - 2013
- [c2]Jara Uitto, Roger Wattenhofer:
On Competitive Recommendations. ALT 2013: 83-97 - [i2]Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer:
Ants: Mobile Finite State Machines. CoRR abs/1311.3062 (2013) - 2010
- [i1]Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto:
Local algorithms in (weakly) coloured graphs. CoRR abs/1002.0125 (2010)
2000 – 2009
- 2009
- [c1]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: 191-205
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
