default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabian Kuhn
Fabian Daniel Kuhn
Person information
- affiliation: University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c145]Alkida Balliu
, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela:
Brief Announcement: Local Advice and Local Decompression. PODC 2024: 117-120- [c144]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
Completing the Node-Averaged Complexity Landscape of LCLs on Trees. PODC 2024: 369-379 - [c143]Marc Fuchs, Fabian Kuhn:
Brief Announcement: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms. PODC 2024: 425-428 - [c142]Mélanie Cambus, Fabian Kuhn, Etna Lindy, Shreyas Pai, Jara Uitto:
A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams. SODA 2024: 2861-2880 - [c141]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. SODA 2024: 4083-4123 - [c140]Xavier Coiteux-Roy, Francesco D'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela:
No Distributed Quantum Advantage for Approximate Graph Coloring. STOC 2024: 1901-1910 - [e4]Arnaud Casteigts, Fabian Kuhn:
3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece. LIPIcs 292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-315-7 [contents] - [i73]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
Completing the Node-Averaged Complexity Landscape of LCLs on Trees. CoRR abs/2405.01366 (2024) - [i72]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela:
Local Advice and Local Decompression. CoRR abs/2405.04519 (2024) - [i71]Marc Fuchs, Fabian Kuhn:
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms. CoRR abs/2405.04648 (2024) - [i70]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Shared Randomness Helps with Local Distributed Problems. CoRR abs/2407.05445 (2024) - 2023
- [j34]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
Node and edge averaged complexities of local graph problems. Distributed Comput. 36(4): 451-473 (2023) - [j33]Abdolhamid Ghodselahi, Fabian Kuhn:
Toward Online Mobile Facility Location on General Metrics. Theory Comput. Syst. 67(6): 1268-1306 (2023) - [c139]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. SODA 2023: 2632-2676 - [c138]Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon:
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. SODA 2023: 4409-4447 - [c137]Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto:
Sinkless Orientation Made Simple. SOSA 2023: 175-191 - [c136]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. SPAA 2023: 455-465 - [c135]Marc Fuchs, Fabian Kuhn:
Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications. SPAA 2023: 489-492 - [c134]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. DISC 2023: 7:1-7:21 - [c133]Mélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto:
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. DISC 2023: 11:1-11:12 - [c132]Marc Fuchs, Fabian Kuhn:
List Defective Colorings: Distributed Algorithms and Applications. DISC 2023: 22:1-22:23 - [i69]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. CoRR abs/2301.06457 (2023) - [i68]Marc Fuchs, Fabian Kuhn:
List Defective Colorings: Distributed Algorithms and Applications. CoRR abs/2304.09666 (2023) - [i67]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. CoRR abs/2304.09844 (2023) - [i66]Mélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto:
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. CoRR abs/2306.00432 (2023) - [i65]Xavier Coiteux-Roy, Francesco D'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela:
No distributed quantum advantage for approximate graph coloring. CoRR abs/2307.09444 (2023) - [i64]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. CoRR abs/2308.04251 (2023) - [i63]Martin Farach-Colton, Fabian Daniel Kuhn, Ronitt Rubinfeld, Przemyslaw Uznanski:
From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071). Dagstuhl Reports 13(2): 33-46 (2023) - 2022
- [j32]Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Comput. 35(3): 207-234 (2022) - [j31]John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav:
Latency, capacity, and distributed minimum spanning trees. J. Comput. Syst. Sci. 126: 1-20 (2022) - [c131]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
Node and Edge Averaged Complexities of Local Graph Problems. PODC 2022: 4-14 - [c130]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Edge Coloring in Time Polylogarithmic in Δ. PODC 2022: 15-25 - [c129]Michael A. Bender, Seth Gilbert, Fabian Kuhn, John Kuszmaul, Muriel Médard:
Contention Resolution for Coded Radio Networks. SPAA 2022: 119-130 - [c128]Fabian Kuhn:
Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk). STACS 2022: 3:1-3:1 - [c127]Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan:
Near-optimal distributed degree+1 coloring. STOC 2022: 450-463 - [c126]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed ∆-coloring plays hide-and-seek. STOC 2022: 464-477 - [c125]Fabian Kuhn, Philipp Schneider:
Routing Schemes and Distance Oracles in the Hybrid Model. DISC 2022: 28:1-28:22 - [i62]Fabian Kuhn, Philipp Schneider:
Routing Schemes and Distance Oracles in the Hybrid Model. CoRR abs/2202.06624 (2022) - [i61]Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs:
Near-Shortest Path Routing in Hybrid Communication Networks. CoRR abs/2202.08008 (2022) - [i60]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Edge Coloring in Time Polylogarithmic in Δ. CoRR abs/2206.00976 (2022) - [i59]Michael A. Bender, Seth Gilbert, Fabian Kuhn, John Kuszmaul, Muriel Médard:
Contention Resolution for Coded Radio Networks. CoRR abs/2207.11824 (2022) - [i58]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
Node and Edge Averaged Complexities of Local Graph Problems. CoRR abs/2208.08213 (2022) - [i57]Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon:
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. CoRR abs/2209.11651 (2022) - [i56]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. CoRR abs/2211.01945 (2022) - 2021
- [j30]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved distributed Δ-coloring. Distributed Comput. 34(4): 239-258 (2021) - [c124]Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. FOCS 2021: 1009-1020 - [c123]Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs:
Near-Shortest Path Routing in Hybrid Communication Networks. OPODIS 2021: 11:1-11:23 - [c122]Salwa Faour, Marc Fuchs, Fabian Kuhn:
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings. OPODIS 2021: 17:1-17:20 - [c121]Alkida Balliu, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Fractional Coloring Algorithms. OPODIS 2021: 18:1-18:23 - [c120]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. PODC 2021: 283-293 - [c119]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan:
Efficient randomized distributed coloring in CONGEST. STOC 2021: 1180-1193 - [i55]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. CoRR abs/2106.02440 (2021) - [i54]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Δ-Coloring Plays Hide-and-Seek. CoRR abs/2110.00643 (2021) - [i53]Salwa Faour, Marc Fuchs, Fabian Kuhn:
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings. CoRR abs/2111.10577 (2021) - [i52]Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan:
Near-Optimal Distributed Degree+1 Coloring. CoRR abs/2112.00604 (2021) - [i51]Alkida Balliu, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Fractional Coloring Algorithms. CoRR abs/2112.04405 (2021) - 2020
- [j29]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved distributed degree splitting and edge coloring. Distributed Comput. 33(3-4): 293-310 (2020) - [j28]Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, Thim Strothmann:
Forming tile shapes with simple robots. Nat. Comput. 19(2): 375-390 (2020) - [j27]Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The cost of global broadcast in dynamic radio networks. Theor. Comput. Sci. 806: 363-387 (2020) - [j26]Sebastian Daum, Fabian Kuhn, Yannic Maus:
Rumor spreading with bounded in-degree. Theor. Comput. Sci. 810: 43-57 (2020) - [c118]John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav:
Latency, Capacity, and Distributed Minimum Spanning Tree†. ICDCS 2020: 157-167 - [c117]Salwa Faour, Fabian Kuhn:
Approximating Bipartite Minimum Vertex Cover in the CONGEST Model. OPODIS 2020: 29:1-29:16 - [c116]Fabian Kuhn, Philipp Schneider:
Computing Shortest Paths and Diameter in the Hybrid Network Model. PODC 2020: 109-118 - [c115]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus:
Distance-2 Coloring in the CONGEST Model. PODC 2020: 233-242 - [c114]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Efficient Deterministic Distributed Coloring with Small Bandwidth. PODC 2020: 243-252 - [c113]Alkida Balliu, Fabian Kuhn, Dennis Olivetti:
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. PODC 2020: 289-298 - [c112]Fabian Kuhn:
Faster Deterministic Distributed Coloring Through Recursive List Coloring. SODA 2020: 1244-1259 - [c111]John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider:
Shortest Paths in a Hybrid Network Model. SODA 2020: 1280-1299 - [c110]Mohamad Ahmadi, Fabian Kuhn:
Distributed Maximum Matching Verification in CONGEST. DISC 2020: 37:1-37:18 - [c109]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin:
Coloring Fast Without Learning Your Neighbors' Colors. DISC 2020: 39:1-39:17 - [i50]Mohamad Ahmadi, Fabian Kuhn:
Distributed Maximum Matching Verification in CONGEST. CoRR abs/2002.07649 (2020) - [i49]Alkida Balliu, Fabian Kuhn, Dennis Olivetti:
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. CoRR abs/2002.10780 (2020) - [i48]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus:
Distance-2 Coloring in the CONGEST Model. CoRR abs/2005.06528 (2020) - [i47]Fabian Kuhn, Philipp Schneider:
Computing Shortest Paths and Diameter in the Hybrid Network Model. CoRR abs/2006.08408 (2020) - [i46]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin:
Coloring Fast Without Learning Your Neighbors' Colors. CoRR abs/2008.04303 (2020) - [i45]Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. CoRR abs/2011.04511 (2020) - [i44]Salwa Faour, Fabian Kuhn:
Approximate Bipartite Vertex Cover in the CONGEST Model. CoRR abs/2011.10014 (2020) - [i43]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan:
Efficient Randomized Distributed Coloring in CONGEST. CoRR abs/2012.14169 (2020)
2010 – 2019
- 2019
- [j25]Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin Newport:
Contention resolution on a fading channel. Distributed Comput. 32(6): 517-533 (2019) - [j24]Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela:
Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations. Bull. EATCS 127 (2019) - [c108]Mohsen Ghaffari, Fabian Kuhn, Jara Uitto:
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. FOCS 2019: 1650-1663 - [c107]Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister:
Optimal Strategies for Patrolling Fences. ICALP 2019: 144:1-144:13 - [c106]Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan:
The Communication Cost of Information Spreading in Dynamic Networks. ICDCS 2019: 368-378 - [c105]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Local Distributed Algorithms in Highly Dynamic Networks. IPDPS 2019: 33-42 - [c104]Abdolhamid Ghodselahi, Fabian Kuhn, Volker Turau:
Concurrent Distributed Serving with Mobile Servers. ISAAC 2019: 53:1-53:18 - [c103]Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela:
2019 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2019: 1 - [c102]Janosch Deurer, Fabian Kuhn, Yannic Maus:
Deterministic Distributed Dominating Set Approximation in the CONGEST Model. PODC 2019: 94-103 - [c101]Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
On the Complexity of Distributed Splitting Problems. PODC 2019: 280-289 - [c100]Mohsen Ghaffari, Fabian Kuhn:
On the Use of Randomness in Local Distributed Graph Algorithms. PODC 2019: 290-299 - [c99]John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Fabian Kuhn, Jason Li:
Distributed Computation in Node-Capacitated Networks. SPAA 2019: 69-79 - [c98]Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. DISC 2019: 15:1-15:16 - [i42]Abdolhamid Ghodselahi, Fabian Kuhn, Volker Turau:
Competitive Concurrent Distributed Scheduling. CoRR abs/1902.07354 (2019) - [i41]John Augustine, Seth Gilbert, Fabian Kuhn, Peter Robinson, Suman Sourav:
Latency, Capacity, and Distributed MST. CoRR abs/1902.08979 (2019) - [i40]Janosch Deurer, Fabian Kuhn, Yannic Maus:
Deterministic Distributed Dominating Set Approximation in the CONGEST Model. CoRR abs/1905.10775 (2019) - [i39]Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
On the Complexity of Distributed Splitting Problems. CoRR abs/1905.11573 (2019) - [i38]Mohsen Ghaffari, Fabian Kuhn:
On the Use of Randomness in Local Distributed Graph Algorithms. CoRR abs/1906.00482 (2019) - [i37]Fabian Kuhn:
Faster Deterministic Distributed Coloring Through Recursive List Coloring. CoRR abs/1907.03797 (2019) - [i36]John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider:
Shortest Paths in a Hybrid Network Model. CoRR abs/1909.01597 (2019) - [i35]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Efficient Deterministic Distributed Coloring with Small Bandwidth. CoRR abs/1912.02814 (2019) - 2018
- [j23]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow. SIAM J. Comput. 47(6): 2078-2117 (2018) - [c97]Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, Thim Strothmann:
Forming Tile Shapes with Simple Robots. DNA 2018: 122-138 - [c96]Mohsen Ghaffari, David G. Harris, Fabian Kuhn:
On Derandomizing Local Distributed Algorithms. FOCS 2018: 662-673 - [c95]Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler:
Shape Recognition by a Finite Automaton Robot. MFCS 2018: 52:1-52:15 - [c94]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved Distributed Delta-Coloring. PODC 2018: 427-436 - [c93]Fabian Kuhn, Yannic Maus, Simon Weidner:
Deterministic Distributed Ruling Sets of Line Graphs. SIROCCO 2018: 193-208 - [c92]Pawel Gawrychowski, Fabian Kuhn, Jakub Lopuszanski, Konstantinos Panagiotou, Pascal Su:
Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. SODA 2018: 2604-2619 - [c91]Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman:
Possibilities and Impossibilities for Distributed Subgraph Detection. SPAA 2018: 153-162 - [c90]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
Deterministic distributed edge-coloring with fewer colors. STOC 2018: 418-430 - [c89]Mohamad Ahmadi, Fabian Kuhn, Rotem Oshman:
Distributed Approximate Maximum Matching in the CONGEST Model. DISC 2018: 6:1-6:17 - [c88]Mohsen Ghaffari, Fabian Kuhn:
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set. DISC 2018: 29:1-29:17 - [c87]Mohsen Ghaffari, Fabian Kuhn:
Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. DISC 2018: 30:1-30:12 - [c86]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks. DISC 2018: 42:1-42:4 - [i34]Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Local Distributed Algorithms in Highly Dynamic Networks. CoRR abs/1802.10199 (2018) - [i33]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved Distributed Δ-Coloring. CoRR abs/1803.03248 (2018) - [i32]Fabian Kuhn, Chaodong Zheng:
Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs. CoRR abs/1805.03357 (2018) - [i31]Fabian Kuhn, Yannic Maus, Simon Weidner:
Deterministic Distributed Ruling Sets of Line Graphs. CoRR abs/1805.07209 (2018) - [i30]John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, Christian Scheideler:
Distributed Computation in the Node-Congested Clique. CoRR abs/1805.07294 (2018) - [i29]Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan:
The Communication Cost of Information Spreading in Dynamic Networks. CoRR abs/1806.09847 (2018) - [i28]Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister:
Optimal strategies for patrolling fences. CoRR abs/1809.06727 (2018) - 2017
- [j22]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Sampling. ACM Trans. Algorithms 13(2): 19:1-19:26 (2017) - [c85]Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. FOCS 2017: 180-191 - [c84]Fabian Kuhn, Philipp Schneider:
Broadcasting in an Unreliable SINR Model. OPODIS 2017: 3:1-3:21 - [c83]Seth Gilbert, Fabian Kuhn, Chaodong Zheng:
Communication Primitives in Cognitive Radio Networks. PODC 2017: 23-32 - [c82]Mohsen Ghaffari, Fabian Kuhn, Hsin-Hao Su:
Distributed MST and Routing in Almost Mixing Time. PODC 2017: 131-140 - [c81]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus:
On the complexity of local distributed graph problems. STOC 2017: 784-797 - [c80]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. DISC 2017: 19:1-19:15 - [c79]Abdolhamid Ghodselahi, Fabian Kuhn:
Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks. DISC 2017: 22:1-22:16 - [c78]Magnús M. Halldórsson, Fabian Kuhn, Nancy A. Lynch, Calvin Newport:
An Efficient Communication Abstraction for Dense Wireless Networks. DISC 2017: 25:1-25:16 - [e3]Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl:
44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. LIPIcs 80, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-041-5 [contents] - [i27]Seth Gilbert, Fabian Kuhn, Chaodong Zheng:
Communication Primitives in Cognitive Radio Networks. CoRR abs/1703.06130 (2017) - [i26]Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. CoRR abs/1704.02767 (2017) - [i25]Abdolhamid Ghodselahi, Fabian Kuhn:
Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks. CoRR abs/1705.07327 (2017) - [i24]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. CoRR abs/1706.04746 (2017) - [i23]Fabian Kuhn, Konstantinos Panagiotou, Pascal Su:
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes. CoRR abs/1707.08807 (2017) - [i22]Mohsen Ghaffari, David G. Harris, Fabian Kuhn:
On Derandomizing Local Distributed Algorithms. CoRR abs/1711.02194 (2017) - [i21]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
Deterministic Distributed Edge-Coloring with Fewer Colors. CoRR abs/1711.05469 (2017) - 2016
- [j21]Piotr Indyk, Anca Muscholl, Fabian Kuhn:
ICALP 2017 - Call for Papers. Bull. EATCS 120 (2016) - [j20]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Local Computation: Lower and Upper Bounds. J. ACM 63(2): 17:1-17:44 (2016) - [c77]Mohamad Ahmadi, Fabian Kuhn:
Multi-message Broadcast in Dynamic Radio Networks. ALGOSENSORS 2016: 1-15 - [c76]Marijke H. L. Bodlaender, Magnús M. Halldórsson, Christian Konrad, Fabian Kuhn:
Brief Announcement: Local Independent Set Approximation. PODC 2016: 93-95 - [c75]Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Contention Resolution on a Fading Channel. PODC 2016: 155-164 - [c74]Sebastian Daum, Fabian Kuhn, Yannic Maus:
Rumor Spreading with Bounded In-Degree. SIROCCO 2016: 323-339 - [c73]Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger:
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. DISC 2016: 99-113 - [r2]Fabian Kuhn:
Local Approximation of Covering and Packing Problems. Encyclopedia of Algorithms 2016: 1129-1132 - [i20]Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The Cost of Global Broadcast in Dynamic Radio Networks. CoRR abs/1601.01912 (2016) - [i19]Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger:
A Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. CoRR abs/1607.05212 (2016) - [i18]Mohamad Ahmadi, Fabian Kuhn:
Multi-Message Broadcast in Dynamic Radio Networks. CoRR abs/1610.02931 (2016) - [i17]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus:
On the Complexity of Local Distributed Graph Problems. CoRR abs/1611.02663 (2016) - 2015
- [j19]Majid Khabbazian, Stephane Durocher, Alireza Haghnegahdar, Fabian Kuhn:
Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position. IEEE/ACM Trans. Netw. 23(4): 1078-1091 (2015) - [c72]Abdolhamid Ghodselahi, Fabian Kuhn:
Serving Online Requests with Mobile Servers. ISAAC 2015: 740-751 - [c71]Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The Cost of Global Broadcast in Dynamic Radio Networks. OPODIS 2015: 7:1-7:17 - [c70]Fabian Kuhn, Anisur Rahaman Molla:
Distributed Sparse Cut Approximation. OPODIS 2015: 10:1-10:14 - [c69]Lennart Elsen, Fabian Kuhn, Christian Decker, Roger Wattenhofer:
goProbe: a scalable distributed network monitoring solution. P2P 2015: 1-10 - [c68]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow: Extended Abstract. PODC 2015: 81-90 - [c67]Seth Gilbert, Fabian Kuhn, Calvin Newport, Chaodong Zheng:
Efficient Communication in Cognitive Radio Networks. PODC 2015: 119-128 - [c66]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Vertex Sampling. SODA 2015: 2006-2018 - [c65]Sebastian Daum, Fabian Kuhn:
Tight Bounds for MIS in Multichannel Radio Networks. DISC 2015: 573-587 - [i16]Sebastian Daum, Fabian Kuhn, Yannic Maus:
Rumor Spreading with Bounded In-Degree. CoRR abs/1506.00828 (2015) - [i15]Sebastian Daum, Fabian Kuhn:
Tight Bounds for MIS in Multichannel Radio Networks. CoRR abs/1508.04390 (2015) - [i14]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow. CoRR abs/1508.04747 (2015) - 2014
- [j18]Majid Khabbazian, Dariusz R. Kowalski, Fabian Kuhn, Nancy A. Lynch:
Decomposing broadcast algorithms using abstract MAC layers. Ad Hoc Networks 12: 219-242 (2014) - [j17]Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Structuring unreliable radio networks. Distributed Comput. 27(1): 1-19 (2014) - [j16]Leonid Barenboim, Michael Elkin, Fabian Kuhn:
Distributed (Delta+1)-Coloring in Linear (in Delta) Time. SIAM J. Comput. 43(1): 72-95 (2014) - [c64]Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas:
Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). ICALP (1) 2014: 247-258 - [c63]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
Distributed connectivity decomposition. PODC 2014: 156-165 - [c62]Andrew Drucker, Fabian Kuhn, Rotem Oshman:
On the power of the congested clique model. PODC 2014: 367-376 - [c61]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
A New Perspective on Vertex Connectivity. SODA 2014: 546-561 - [c60]Fabian Kuhn:
A distributed perspective on graph connectivity and cuts. SPAA 2014: 1 - [e2]Fabian Kuhn:
Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings. Lecture Notes in Computer Science 8784, Springer 2014, ISBN 978-3-662-45173-1 [contents] - [i13]Abdolhamid Ghodselahi, Fabian Kuhn:
Serving Online Demands with Movable Centers. CoRR abs/1404.5510 (2014) - 2013
- [j15]Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a maximal independent set. Distributed Comput. 26(4): 195-208 (2013) - [j14]Fabian Kuhn, Monaldo Mastrolilli:
Vertex cover in graphs with locally few colors. Inf. Comput. 222: 265-277 (2013) - [c59]Sebastian Daum, Mohsen Ghaffari, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Maximal independent sets in multichannel radio networks. PODC 2013: 335-344 - [c58]Mohsen Ghaffari, Fabian Kuhn:
Distributed Minimum Cut Approximation. DISC 2013: 1-15 - [c57]Sebastian Daum, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Broadcast in the Ad Hoc SINR Model. DISC 2013: 358-372 - [i12]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
A New Perspective on Vertex Connectivity. CoRR abs/1304.4553 (2013) - [i11]Mohsen Ghaffari, Fabian Kuhn:
Distributed Minimum Cut Approximation. CoRR abs/1305.5520 (2013) - [i10]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
Distributed Connectivity Decomposition. CoRR abs/1311.5317 (2013) - 2012
- [j13]Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar:
Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Comput. 25(3): 189-205 (2012) - [c56]Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn:
Oblivious low-congestion multicast routing in wireless networks. MobiHoc 2012: 155-164 - [c55]Andrew Drucker, Fabian Kuhn, Rotem Oshman:
The communication complexity of distributed task allocation. PODC 2012: 67-76 - [c54]Sebastian Daum, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Leader election in shared spectrum radio networks. PODC 2012: 215-224 - [c53]Bernhard Haeupler, Fabian Kuhn:
Lower Bounds on Information Dissemination in Dynamic Networks. DISC 2012: 166-180 - [c52]Sebastian Daum, Fabian Kuhn, Calvin C. Newport:
Efficient Symmetry Breaking in Multi-Channel Radio Networks. DISC 2012: 238-252 - [e1]Fabian Kuhn, Calvin C. Newport:
FOMC'12, The Eighth ACM International Workshop on Foundations of Mobile Computing (part of PODC 2012), Funchal, Portugal, July 19, 2012, Proceedings. ACM 2012, ISBN 978-1-4503-1537-1 [contents] - [i9]Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a Maximal Independent Set. CoRR abs/1206.0150 (2012) - [i8]Bernhard Haeupler, Fabian Kuhn:
Lower Bounds on Information Dissemination in Dynamic Networks. CoRR abs/1208.6051 (2012) - 2011
- [j12]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
The abstract MAC layer. Distributed Comput. 24(3-4): 187-206 (2011) - [j11]Fabian Kuhn, Thomas Locher, Rotem Oshman:
Gradient Clock Synchronization in Dynamic Networks. Theory Comput. Syst. 49(4): 781-816 (2011) - [j10]Fabian Kuhn, Rotem Oshman:
Dynamic networks: models and algorithms. SIGACT News 42(1): 82-96 (2011) - [c51]Majid Khabbazian, Fabian Kuhn, Nancy A. Lynch, Muriel Médard, Ali ParandehGheibi:
MAC design for analog network coding. FOMC 2011: 42-51 - [c50]Fabian Kuhn, Monaldo Mastrolilli:
Vertex Cover in Graphs with Locally Few Colors. ICALP (1) 2011: 498-509 - [c49]Fabian Kuhn, Yoram Moses, Rotem Oshman:
Coordinated consensus in dynamic networks. PODC 2011: 1-10 - [c48]Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Structuring unreliable radio networks. PODC 2011: 79-88 - [c47]Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a Maximal Independent Set. DISC 2011: 32-50 - [c46]Fabian Kuhn, Rotem Oshman:
The Complexity of Data Aggregation in Directed Networks. DISC 2011: 416-431 - [i7]Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Computing a Maximal Independent Set Using Beeps. CoRR abs/1108.1926 (2011) - 2010
- [j9]Fabian Kuhn, Stefan Schmid, Roger Wattenhofer:
Towards worst-case churn resistant peer-to-peer systems. Distributed Comput. 22(4): 249-267 (2010) - [j8]Fabian Kuhn, Thomas Moscibroda:
Distributed Approximation of Capacitated Dominating Sets. Theory Comput. Syst. 47(4): 811-836 (2010) - [c45]Majid Khabbazian, Fabian Kuhn, Dariusz R. Kowalski, Nancy A. Lynch:
Decomposing broadcast algorithms using abstract MAC layers. DIALM-PODC 2010: 13-22 - [c44]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, Andréa W. Richa:
Broadcasting in unreliable radio networks. PODC 2010: 336-345 - [c43]Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman:
Optimal gradient clock synchronization in dynamic networks. PODC 2010: 430-439 - [c42]Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger:
Synchrony and Asynchrony in Neural Networks. SODA 2010: 949-964 - [c41]Fabian Kuhn, Nancy A. Lynch, Rotem Oshman:
Distributed computation in dynamic networks. STOC 2010: 513-522 - [c40]Alejandro Cornejo, Fabian Kuhn:
Deploying Wireless Networks with Beeps. DISC 2010: 148-162 - [i6]Alejandro Cornejo, Fabian Kuhn:
Deploying Wireless Networks with Beeps. CoRR abs/1005.2567 (2010) - [i5]Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman:
Optimal Gradient Clock Synchronization in Dynamic Networks. CoRR abs/1005.2894 (2010) - [i4]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Local Computation: Lower and Upper Bounds. CoRR abs/1011.5470 (2010)
2000 – 2009
- 2009
- [c39]Fabian Kuhn, Rotem Oshman:
Gradient Clock Synchronization Using Reference Broadcasts. OPODIS 2009: 204-218 - [c38]Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Fabian Kuhn, Calvin C. Newport:
The wireless synchronization problem. PODC 2009: 190-199 - [c37]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Brief announcement: hardness of broadcasting in wireless networks with unreliable communication. PODC 2009: 330-331 - [c36]Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski, Calvin Newport, Fabian Kuhn, Nancy A. Lynch:
Reliable distributed computing on unreliable radio channels. S³@MobiHoc 2009: 1-4 - [c35]Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian Kuhn, Mahesh Balakrishnan, Archit Gupta, Aditya Akella:
On the treeness of internet latency and bandwidth. SIGMETRICS/Performance 2009: 61-72 - [c34]Fabian Kuhn:
Weak graph colorings: distributed algorithms and applications. SPAA 2009: 138-144 - [c33]Fabian Kuhn, Thomas Locher, Rotem Oshman:
Gradient clock synchronization in dynamic networks. SPAA 2009: 270-279 - [c32]Fabian Kuhn:
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. STACS 2009: 613-624 - [c31]Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
The Abstract MAC Layer. DISC 2009: 48-62 - [c30]Alejandro Cornejo, Fabian Kuhn, Ruy Ley-Wild, Nancy A. Lynch:
Keeping Mobile Robot Swarms Connected. DISC 2009: 496-511 - [i3]Fabian Kuhn:
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. CoRR abs/0902.1868 (2009) - [i2]Fabian Kuhn, Rotem Oshman:
Gradient Clock Synchronization using Reference Broadcasts. CoRR abs/0905.3454 (2009) - 2008
- [j7]Fabian Kuhn, Thomas Locher, Roger Wattenhofer:
Distributed selection: a missing piece of data aggregation. Commun. ACM 51(9): 93-99 (2008) - [j6]Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger:
An algorithmic approach to geographic routing in ad hoc and sensor networks. IEEE/ACM Trans. Netw. 16(1): 51-62 (2008) - [j5]Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger:
Ad hoc networks beyond unit disk graphs. Wirel. Networks 14(5): 715-729 (2008) - [c29]Fabian Kuhn, Thomas Locher, Stefan Schmid:
Distributed computation of the mode. PODC 2008: 15-24 - [c28]Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar:
Efficient distributed approximation algorithms via probabilistic tree embeddings. PODC 2008: 263-272 - [c27]Torsten Muetze, Patrick Stuedi, Fabian Kuhn, Gustavo Alonso:
Understanding Radio Irregularity in Wireless Networks. SECON 2008: 82-90 - [r1]Fabian Kuhn:
Local Approximation of Covering and Packing Problems. Encyclopedia of Algorithms 2008 - 2007
- [j4]Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal:
Improved approximation algorithms for connected sensor cover. Wirel. Networks 13(2): 153-164 (2007) - [c26]Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar:
Reconstructing approximate tree metrics. PODC 2007: 43-52 - [c25]Fabian Kuhn, Thomas Locher, Roger Wattenhofer:
Tight bounds for distributed selection. SPAA 2007: 145-153 - [c24]Fabian Kuhn, Thomas Moscibroda:
Distributed approximation of capacitated dominating sets. SPAA 2007: 161-170 - 2006
- [j3]Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer:
Efficient adaptive collect using randomization. Distributed Comput. 18(3): 179-188 (2006) - [j2]Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer:
Dynamic Analysis of the Arrow Distributed Protocol. Theory Comput. Syst. 39(6): 875-901 (2006) - [c23]Keno Albrecht, Fabian Kuhn, Roger Wattenhofer:
Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn. Research Results of the DICS Program 2006: 275-294 - [c22]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks. ICDCS 2006: 68 - [c21]Stefan Schmid, Fabian Kuhn, Joest Smit, Roger Wattenhofer:
A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves. IWQoS 2006: 12-19 - [c20]Fabian Kuhn, Roger Wattenhofer:
On the complexity of distributed graph coloring. PODC 2006: 7-15 - [c19]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
The price of being near-sighted. SODA 2006: 980-989 - [i1]Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Taming Dynamic and Selfish Peers. Peer-to-Peer-Systems and -Applications 2006 - 2005
- [b1]Fabian Kuhn:
The price of locality: exploring the complexity of distributed coordination primitives. ETH Zurich, 2005, ISBN 3-86628-041-6, pp. 1-169 - [j1]Fabian Kuhn, Roger Wattenhofer:
Constant-time distributed dominating set approximation. Distributed Comput. 17(4): 303-310 (2005) - [c18]Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger:
Interference in Cellular Networks: The Minimum Membership Set Cover Problem. COCOON 2005: 188-198 - [c17]Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer:
Local approximation schemes for ad hoc and sensor networks. DIALM-POMC 2005: 97-103 - [c16]Fabian Kuhn, Stefan Schmid, Roger Wattenhofer:
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. IPTPS 2005: 13-23 - [c15]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
On the locality of bounded growth. PODC 2005: 60-68 - [c14]Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer:
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. DISC 2005: 273-287 - 2004
- [c13]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Unit disk graph approximation. DIALM-POMC 2004: 17-23 - [c12]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Radio Network Clustering from Scratch. ESA 2004: 460-471 - [c11]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Initializing newly deployed ad hoc and sensor networks. MobiCom 2004: 260-274 - [c10]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
What cannot be computed locally! PODC 2004: 300-309 - [c9]Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
Brief announcement: efficient clustering in unstructured radio networks. PODC 2004: 396 - [c8]Fabian Kuhn, Roger Wattenhofer:
Dynamic analysis of the arrow distributed protocol. SPAA 2004: 294-301 - [c7]Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer:
Efficient Adaptive Collect Using Randomization. DISC 2004: 159-173 - 2003
- [c6]Fabian Kuhn, Aaron Zollinger:
Ad-hoc networks beyond unit disk graphs. DIALM-POMC 2003: 69-78 - [c5]Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger:
Worst-Case optimal and average-case efficient geometric ad-hoc routing. MobiHoc 2003: 267-278 - [c4]Fabian Kuhn, Roger Wattenhofer:
Constant-time distributed dominating set approximation. PODC 2003: 25-32 - [c3]Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger:
Geometric ad-hoc routing: of theory and practice. PODC 2003: 63-72 - 2002
- [c2]Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger:
Asymptotically optimal geometric mobile ad-hoc routing. DIAL-M 2002: 24-33 - 2001
- [c1]Fabian Kuhn, René Struik:
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms. Selected Areas in Cryptography 2001: 212-229
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
