„Distributed Graph Algorithms“

Suchergebnisse

148 Treffer

• Towards Optimal Distributed Edge Coloring with Fewer Colors
  Jakob, Manuel ; Maus, Yannic ; Schager, Florian 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Model-Agnostic Approximation of Constrained Forest Problems
  Coupette, Corinna ; Montaseri, Alipasha ; Lenzen, Christoph 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity Landscape for Local Certification
  Bousquet, Nicolas ; Feuilloley, Laurent ; Zeitoun, Sébastien 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Computation with Local Advice
  Balliu, Alkida ; Brandt, Sebastian ; Kuhn, Fabian ; Nowicki, Krzysztof ; Olivetti, Dennis ; Rotenberg, Eva ; Suomela, Jukka 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Shared Randomness in Locally Checkable Problems: The Role of Computational Assumptions
  Hadad, Adar ; Naor, Moni 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Topics in Theoretical Computer Science – The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers
  Hajiaghayi, Mohammed Taghi ; Mousavi, Mohammad Reza 2016 Springer International Publishing
• Solving Large Scale Learning Tasks. Challenges and Algorithms – Essays Dedicated to Katharina Morik on the Occasion of Her 60th Birthday
  Michaelis, Stefan ; Piatkowski, Nico ; Stolpe, Marco 2016 Springer International Publishing
• Guide to Graph Algorithms – Sequential, Parallel and Distributed
  Erciyes, Kayhan 2018 Springer International Publishing
• The power of locality: Exploring the limits of randomness in distributed computing
  Maus, Yannic
• DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI
  Liu, Yongchao ; Schmidt, Bertil ; Maskell, Douglas L.
• Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks
  Bamberger, Philipp ; Kuhn, Fabian ; Maus, Yannic 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Recoloring
  Bonamy, Marthe ; Ouvrard, Paul ; Rabie, Mikaël ; Suomela, Jukka ; Uitto, Jara 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Topology of Local Computing in Networks
  Fraigniaud, Pierre ; Paz, Ami 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Maximum Label Propagation Algorithm on Sparse Random Graphs
  Knierim, Charlotte ; Lengler, Johannes ; Pfister, Pascal ; Schaller, Ulysse ; Steger, Angelika 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Distributed Degree Splitting and Edge Coloring
  Ghaffari, Mohsen ; Hirvonen, Juho ; Kuhn, Fabian ; Maus, Yannic ; Suomela, Jukka ; Uitto, Jara 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Transactions on Computational Science XXIX
  Gavrilova, Marina L. ; Tan, C. J. Kenneth 2017 Springer Berlin Heidelberg
• Brief Announcement: Agent-Based Leader Election, MST, and Beyond
  Kshemkalyani, Ajay D. ; Kumar, Manish ; Molla, Anisur Rahaman ; Sharma, Gokarna 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Massively Parallel Ruling Set Made Deterministic
  Giliberti, Jeff ; Parsaeian, Zahra 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs
  Flin, Maxime ; Halldórsson, Magnús M. ; Nolin, Alexandre 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
  Barenboim, Leonid ; Goldenberg, Uri 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik