Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Maus, Yannic
100  Ergebnisse:
Personensuche X
?
1

Adaptive Massively Parallel Coloring in Sparse Graphs:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,
Latypov, Rustam ; Maus, Yannic ; Pai, Shreyas. - p. 508-518 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Fast Dynamic Programming in Trees in the MPC Model:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
Gupta, Chetan ; Latypov, Rustam ; Maus, Yannic... - p. 443-453 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Distributed Symmetry Breaking on Power Graphs via Sparsific..:

, In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing,
Maus, Yannic ; Peltonen, Saku ; Uitto, Jara - p. 157-167 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

Distributed Graph Coloring Made Easy:

Maus, Yannic
ACM Transactions on Parallel Computing.  10 (2023)  4 - p. 1-21 , 2023
Link: https://doi.org/10.1145/..
 
?
5

Adaptive Massively Parallel Connectivity in Optimal Space:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
Latypov, Rustam ; Łącki, Jakub ; Maus, Yannic. - p. 431-441 , 2023
Link: https://dl.acm.org/doi/1..
 
?
6

Linial for lists:

Maus, Yannic ; Tonoyan, Tigran
Distributed Computing.  35 (2022)  6 - p. 533-546 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Greedy routing and the algorithmic small-world phenomenon:

Bringmann, Karl ; Keusch, Ralph ; Lengler, Johannes..
Journal of Computer and System Sciences.  125 (2022)  - p. 59-105 , 2022
Link: https://doi.org/10.1016/..
 
?
8

Improved distributed $$\Delta $$-coloring:

Ghaffari, Mohsen ; Hirvonen, Juho ; Kuhn, Fabian.
Distributed Computing.  34 (2021)  4 - p. 239-258 , 2021
Link: https://doi.org/10.1007/..
 
?
9

Near-Optimal Scheduling in the Congested Clique:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,
Censor-Hillel, Keren ; Maus, Yannic ; Polosukhin, Volodymyr - p. 50-67 , 2021
Link: https://doi.org/10.1007/..
 
?
10

Efficient randomized distributed coloring in CONGEST:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Halldórsson, Magnús M. ; Kuhn, Fabian ; Maus, Yannic. - p. 1180-1193 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Distributed Graph Coloring Made Easy:

, In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
Maus, Yannic - p. 362-372 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Distributed Approximation on Power Graphs:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Bar-Yehuda, Reuven ; Censor-Hillel, Keren ; Maus, Yannic.. - p. 501-510 , 2020
Link: https://dl.acm.org/doi/1..
 
?
13

Efficient Deterministic Distributed Coloring with Small Ban..:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Bamberger, Philipp ; Kuhn, Fabian ; Maus, Yannic - p. 243-252 , 2020
Link: https://dl.acm.org/doi/1..
 
?
14

Brief Announcement: Classification of Distributed Binary La..:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Balliu, Alkida ; Brandt, Sebastian ; Efron, Yuval... - p. 349-351 , 2020
Link: https://dl.acm.org/doi/1..
 
?
15

Distance-2 Coloring in the CONGEST Model:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Halldórsson, Magnús M. ; Kuhn, Fabian ; Maus, Yannic - p. 233-242 , 2020
Link: https://dl.acm.org/doi/1..
 
1-15