The following pages link to Fabian Kuhn (Q613112):
Displaying 50 items.
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- The abstract MAC layer (Q661062) (← links)
- Gradient clock synchronization in dynamic networks (Q693764) (← links)
- Dynamic analysis of the arrow distributed protocol (Q863197) (← links)
- Forming tile shapes with simple robots (Q1621139) (← links)
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model (Q1660925) (← links)
- Tight bounds for MIS in multichannel radio networks (Q1664167) (← links)
- Deterministic distributed ruling sets of line graphs (Q1713911) (← links)
- Vertex cover in graphs with locally few colors (Q1951586) (← links)
- Efficient adaptive collect using randomization (Q1953647) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Contention resolution on a fading channel (Q2010610) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- The cost of global broadcast in dynamic radio networks (Q2285142) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← links)
- Towards worst-case churn resistant peer-to-peer systems (Q2377141) (← links)
- Beeping a maximal independent set (Q2441534) (← links)
- Near-Optimal Distributed Maximum Flow (Q2796244) (← links)
- Efficient Communication in Cognitive Radio Networks (Q2796249) (← links)
- Distributed computation in dynamic networks (Q2875179) (← links)
- Distributed Minimum Cut Approximation (Q2920962) (← links)
- Broadcast in the Ad Hoc SINR Model (Q2920966) (← links)
- The communication complexity of distributed task allocation (Q2933777) (← links)
- Leader election in shared spectrum radio networks (Q2933797) (← links)
- Distributed computation of the mode (Q2934328) (← links)
- Coordinated consensus in dynamic networks (Q2943377) (← links)
- Distributed connectivity decomposition (Q2943618) (← links)
- On the power of the congested clique model (Q2943637) (← links)
- Geometric ad-hoc routing (Q2943747) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- The Complexity of Data Aggregation in Directed Networks (Q3095346) (← links)
- Local Computation (Q3177774) (← links)
- Broadcasting in an Unreliable SINR Model. (Q3300801) (← links)
- Serving Online Requests with Mobile Servers (Q3459911) (← links)
- The price of being near-sighted (Q3581560) (← links)
- Deploying Wireless Networks with Beeps (Q3588301) (← links)
- The Abstract MAC Layer (Q3646216) (← links)
- Keeping Mobile Robot Swarms Connected (Q3646246) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- (Q4608062) (← links)
- (Q4736434) (← links)
- Lower Bounds on Information Dissemination in Dynamic Networks (Q4909409) (← links)
- Efficient Symmetry Breaking in Multi-Channel Radio Networks (Q4909415) (← links)
- Tight Bounds on Vertex Connectivity Under Sampling (Q4962652) (← links)
- On the complexity of local distributed graph problems (Q4978023) (← links)
- Shape recognition by a finite automaton robot (Q5005154) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
