受强制性开放获取政策约束的文章 - Mohsen Ghaffari了解详情
可在其他位置公开访问的文章：54 篇
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
V Rozhoň, M Ghaffari
ACM SIGACT Symposium on Theory of Computing (STOC) 2020, 2020
强制性开放获取政策： European Commission
On the complexity of local distributed graph problems
M Ghaffari, F Kuhn, Y Maus
ACM SIGACT Symposium on Theory of Computing (STOC) 2017, 784-797, 2017
强制性开放获取政策： European Commission
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
M Ghaffari, T Gouleakis, C Konrad, S Mitrović, R Rubinfeld
ACM Symposium on Principles of Distributed Computing (PODC) 2018, 129-138, 2018
强制性开放获取政策： US National Science Foundation, UK Engineering and Physical Sciences …
On derandomizing local distributed algorithms
M Ghaffari, DG Harris, F Kuhn
IEEE Symposium on Foundations of Computer Science (FOCS) 2018, 662-673, 2018
强制性开放获取政策： European Commission
Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
M Ghaffari, J Uitto
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019, 1636-1653, 2019
强制性开放获取政策： European Commission
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
ACM Symposium on Principles of Distributed Computing (PODC) 2019, 471-480, 2019
强制性开放获取政策： US National Science Foundation, 国家自然科学基金委员会
Distributed algorithms for planar networks II: Low-congestion shortcuts, mst, and min-cut
M Ghaffari, B Haeupler
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016, 202-219, 2016
强制性开放获取政策： US National Science Foundation
Distributed degree splitting, edge coloring, and orientations
M Ghaffari, HH Su
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2017, 2505-2523, 2017
强制性开放获取政策： US National Science Foundation
MST in log-star rounds of congested clique
M Ghaffari, M Parter
ACM Symposium on Principles of Distributed Computing (PODC) 2016, 19-28, 2016
强制性开放获取政策： US National Science Foundation
Improved deterministic network decomposition
M Ghaffari, C Grunau, V Rozhoň
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
强制性开放获取政策： European Commission
A polylogarithmic gossip algorithm for plurality consensus
M Ghaffari, M Parter
ACM Symposium on Principles of Distributed Computing (PODC) 2016, 117-126, 2016
强制性开放获取政策： US National Science Foundation
Faster algorithms for edge connectivity via random 2-out contractions
M Ghaffari, K Nowicki, M Thorup
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020, 1260-1279, 2020
强制性开放获取政策： Swiss National Science Foundation, Villum Foundation
Improved Parallel Algorithms for Density-Based Network Clustering
M Ghaffari, S Lattanzi, S Mitrović
International Conference on Machine Learning (ICML), 2201-2210, 2019
强制性开放获取政策： Swiss National Science Foundation
Deterministic distributed edge-coloring with fewer colors
M Ghaffari, F Kuhn, Y Maus, J Uitto
ACM SIGACT Symposium on Theory of Computing (STOC), 418-430, 2018
强制性开放获取政策： European Commission
Improved distributed -coloring
M Ghaffari, J Hirvonen, F Kuhn, Y Maus
Distributed Computing, 1-20, 2021
强制性开放获取政策： European Commission
Random contractions and sampling for hypergraph and hedge connectivity
M Ghaffari, DR Karger, D Panigrahi
ACM-SIAM Symposium on Discrete Algorithms (SODA), 1101-1114, 2017
强制性开放获取政策： US National Science Foundation
Distributed computation in node-capacitated networks
J Augustine, M Ghaffari, R Gmyr, K Hinnenthal, C Scheideler, F Kuhn, J Li
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 69-79, 2019
强制性开放获取政策： Swiss National Science Foundation, German Research Foundation, Department of …
Distributed algorithms for planar networks I: Planar embedding
M Ghaffari, B Haeupler
ACM Symposium on Principles of Distributed Computing (PODC), 29-38, 2016
强制性开放获取政策： US National Science Foundation
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality
B Haeupler, H Räcke, M Ghaffari
ACM SIGACT Symposium on Theory of Computing (STOC), 1325-1338, 2022
强制性开放获取政策： US National Science Foundation, Swiss National Science Foundation, German …
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
强制性开放获取政策： European Commission
出版信息和资助信息由计算机程序自动确定