Yannic Maus
Yannic Maus
Verified email at campus.technion.ac.il - Homepage
Title
Cited by
Cited by
Year
On the complexity of local distributed graph problems
M Ghaffari, F Kuhn, Y Maus
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
802017
Greedy routing and the algorithmic small-world phenomenon
K Bringmann, R Keusch, J Lengler, Y Maus, AR Molla
Proceedings of the ACM Symposium on Principles of Distributed Computing, 371-380, 2017
282017
Rumor spreading with bounded in-degree
S Daum, F Kuhn, Y Maus
Theoretical Computer Science 810, 43-57, 2020
242020
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
Improved distributed delta-coloring
M Ghaffari, J Hirvonen, F Kuhn, Y Maus
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
182018
Classification of distributed binary labeling problems
A Balliu, S Brandt, Y Efron, J Hirvonen, Y Maus, D Olivetti, J Suomela
arXiv preprint arXiv:1911.13294, 2019
172019
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
162020
Deterministic distributed dominating set approximation in the CONGEST model
J Deurer, F Kuhn, Y Maus
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
132019
Efficient deterministic distributed coloring with small bandwidth
P Bamberger, F Kuhn, Y Maus
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
122020
Local distributed algorithms in highly dynamic networks
P Bamberger, F Kuhn, Y Maus
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019
122019
Deterministic distributed ruling sets of line graphs
F Kuhn, Y Maus, S Weidner
International Colloquium on Structural Information and Communication …, 2018
122018
Polynomial lower bound for distributed graph coloring in a weak local model
D Hefetz, F Kuhn, Y Maus, A Steger
International Symposium on Distributed Computing, 99-113, 2016
122016
A sharp threshold phenomenon for the distributed complexity of the lovász local lemma
S Brandt, Y Maus, J Uitto
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
52019
On the complexity of distributed splitting problems
P Bamberger, M Ghaffari, F Kuhn, Y Maus, J Uitto
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
52019
Distributed approximation on power graphs
R Bar-Yehuda, K Censor-Hillel, Y Maus, S Pai, SV Pemmaraju
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
32020
Local conflict coloring revisited: Linial for lists
Y Maus, T Tonoyan
arXiv preprint arXiv:2007.15251, 2020
32020
Efficient Randomized Distributed Coloring in CONGEST
MM Halldórsson, F Kuhn, Y Maus, T Tonoyan
arXiv preprint arXiv:2012.14169, 2020
22020
The power of locality: exploring the limits of randomness in distributed computing
Y Maus
it-Information Technology 62 (5-6), 271-278, 2020
22020
Coloring Fast Without Learning Your Neighbors' Colors
MM Halldórsson, F Kuhn, Y Maus, A Nolin
arXiv preprint arXiv:2008.04303, 2020
22020
Distance-2 coloring in the CONGEST model
MM Halldórsson, F Kuhn, Y Maus
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
22020
The system can't perform the operation now. Try again later.
Articles 1–20