Advanced search    

Search: authors:"Fabian Kuhn"

10 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set

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

Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping

, 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

Distributed Approximate Maximum Matching in the CONGEST Model

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...

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks

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

Shape Recognition by a Finite Automaton Robot

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

Broadcasting in an Unreliable SINR Model

/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

An Efficient Communication Abstraction for Dense Wireless Networks

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

Distributed Sparse Cut Approximation

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...

Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time

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

Body odour of monozygotic human twins: a common pattern of odorant carboxylic acids released by a bacterial aminoacylase from axilla secretions contributing to an inherited body odour type

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