Jara Uitto
Jara Uitto
Verified email at aalto.fi - Homepage
Title
Cited by
Cited by
Year
A lower bound for the distributed Lovász local lemma
S Brandt, O Fischer, J Hirvonen, B Keller, T Lempiäinen, J Rybicki, ...
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
652016
Solving the ANTS problem with asynchronous finite state machines
Y Emek, T Langner, J Uitto, R Wattenhofer
International Colloquium on Automata, Languages, and Programming, 471-482, 2014
58*2014
How many ants does it take to find the food?
Y Emek, T Langner, D Stolz, J Uitto, R Wattenhofer
Theoretical Computer Science 608, 255-267, 2015
522015
Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
M Ghaffari, J Uitto
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
462019
A local 2-approximation algorithm for the vertex cover problem
M Åstrand, P Floréen, V Polishchuk, J Rybicki, J Suomela, J Uitto
International symposium on distributed computing, 191-205, 2009
452009
Massively parallel computation of matching and MIS in sparse graphs
S Behnezhad, S Brandt, M Derakhshan, M Fischer, MT Hajiaghayi, ...
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
29*2019
The complexity of distributed edge coloring with small palettes
YJ Chang, Q He, W Li, S Pettie, J Uitto
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
292018
The complexity of (δ+ 1) coloring in congested clique, massively parallel computation, and centralized local computation
YJ Chang, M Fischer, M Ghaffari, J Uitto, Y Zheng
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
252019
Fault-tolerant ANTS
T Langner, J Uitto, D Stolz, R Wattenhofer
International Symposium on Distributed Computing, 31-45, 2014
222014
Deterministic distributed edge-coloring with fewer colors
M Ghaffari, F Kuhn, Y Maus, J Uitto
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
192018
Breaking the linear-memory barrier in mpc: Fast mis on trees with nϵ memory per machine
S Brandt, M Fischer, J Uitto
arXiv preprint arXiv:1802.06748, 2018
19*2018
Local algorithms in (weakly) coloured graphs, 2010
M Åstrand, V Polishchuk, J Rybicki, J Suomela, J Uitto
Manuscript, 0
19*
Conditional hardness results for massively parallel computation from distributed lower bounds
M Ghaffari, F Kuhn, J Uitto
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
182019
Exploring an infinite space with finite memory scouts
L Cohen, Y Emek, O Louidor, J Uitto
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
162017
Spareeye: enhancing the safety of inattentionally blind smartphone users
KT Foerster, A Gross, N Hail, J Uitto, R Wattenhofer
Proceedings of the 13th international conference on mobile and ubiquitous …, 2014
152014
Improved distributed degree splitting and edge coloring
M Ghaffari, J Hirvonen, F Kuhn, Y Maus, J Suomela, J Uitto
Distributed Computing 33 (3), 293-310, 2020
122020
A tight lower bound for semi-synchronous collaborative grid exploration
S Brandt, J Uitto, R Wattenhofer
Distributed Computing, 1-14, 2020
112020
Distributed recoloring
M Bonamy, P Ouvrard, M Rabie, J Suomela, J Uitto
arXiv preprint arXiv:1802.06742, 2018
82018
Overcoming obstacles with ants
B Keller, T Langner, J Uitto, R Wattenhofer
Proceedings of the 19th International Conference on Priniciples of …, 2015
8*2015
A tight lower bound for the capture time of the Cops and Robbers game
S Brandt, Y Emek, J Uitto, R Wattenhofer
Theoretical Computer Science, 2020
52020
The system can't perform the operation now. Try again later.
Articles 1–20