distributed algorithm for maximal independent set. In Pro. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2016. Mohsen Ghaffari, David G Harris, and Fabian Kuhn. On derandomizing local distributed algorithms ... Schwartzman. Adapting local sequential algorithms to the distributed setting. arXiv preprint arXiv:1711.10155, 2017. Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Local computation: Lower and upper
, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, and Boaz PattShamir. Near-optimal distributed maximum flow . In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing , pages 81 ... - 90 . ACM, 2015 . Mohsen Ghaffari , Fabian Kuhn, and Hsin-Hao Su . Distributed mst and routing in almost mixing time . In the Proc. of the Int'l Symp. on Princ. of Dist. Comp. (PODC) , pages 131 - 140
We study distributed algorithms for the maximum matching problem in the CONGEST model, where each message must be bounded in size. We give new deterministic upper bounds, and a new lower bound on the problem. We begin by giving a distributed algorithm that computes an exact maximum (unweighted) matching in bipartite graphs, in O(n log n) rounds. Next, we give a distributed...
Kuhn University of Freiburg , Georges-Köhler-Allee 106, 79110 Freiburg , Germany 2 Philipp Bamberger University of Freiburg , Georges-Köhler-Allee 106, 79110 Freiburg , Germany We define a
/1400751 .1400759. Structuring unreliable radio networks . Distributed Computing , 27 ( 1 ): 1 - 19 , 2014 . doi: 10 .1007/s00446-013-0198-8. Sebastian Daum , Seth Gilbert, Fabian Kuhn, and Calvin C. Newport ... Sebasti?n , Spain, July 21 - 23 , 2015 , pages 129 - 138 . ACM, 2015 . doi: 10 .1145/ 2767386.2767432. In Fabian Kuhn and Calvin C. Newport, editors, FOMC'12 , The Eighth ACM International Workshop on
Paderborn University , Germany 2 by ERC Grant 336495, ACDC 3 Robert Gmyr Paderborn University , Germany 4 Fabian Kuhn University of Freiburg , Germany 5 Kristian Hinnenthal Paderborn University , Germany
. , pages 197 - 211 , 2014 . Abdolhamid Ghodselahi and Fabian Kuhn . Dynamic analysis of the arrow distributed directory protocol in general networks . arXiv preprint arXiv:1705.07327 , 2017 . David Ginat
Science and Artificial Intelligence Lab Massachusetts Institute of Technology USA Fabian Kuhn Institut f?r Informatik Albert-Ludwigs-Universit?t Germany Anca Muscholl LaBRI Universit? Bordeaux France ... . . . . . . . . . . . . . . . . . . . . . . . . . . 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Editors: Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl Leibniz International Proceedings in
Kuhn, and Calvin Newport . Broadcast in the ad hoc SINR model . In Proc. 27th Symposium on Distributed Computing (DISC) , pages 358 - 372 , 2013 . Jeremy T Fineman , Seth Gilbert, Fabian Kuhn, and Calvin ... International Conference on Theory and Applications of Models of Computation , pages 385 - 399 . Springer, 2012 . Fabian Kuhn , Nancy Lynch, and Calvin Newport . The abstract MAC layer . Distributed Computing
The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small additive discrepancy. We...
We study the problem of computing a sparse cut in an undirected network graph G=(V,E). We measure the sparsity of a cut (S,V\S) by its conductance phi(S), i.e., by the ratio of the number of edges crossing the cut and the sum of the degrees on the smaller of the two sides. We present an efficient distributed algorithm to compute a cut of low conductance. Specifically, given two...
. Keren Censor-Hillel, Mohsen Ghaffari, and Fabian Kuhn. Distributed connectivity decomposition. In Proc. 33rd Symp. on Principles of Distributed Computing (PODC), 2014. Keren Censor-Hillel, Mohsen Ghaffari ... , and Fabian Kuhn. A new perspective on vertex connectivity. In Proc. 25th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 546–561, 2014. Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy Lynch
omitted from this extended abstract; A full version can be received from the author's web site at http; //people; csail; mit; edu/fkuhn/publications/multicoloring; pdf FABIAN KUHN 1 1. Introduction In
Fabian Kuhn Andreas Natsch () of odorant carboxylic acids released by a bacterial aminoacylase from axilla secretions contributing to an Articles on similar topics can be found in the following