| 2013 | ||
|---|---|---|
| j14 | Fabian Kuhn, Monaldo Mastrolilli: Vertex cover in graphs with locally few colors. Inf. Comput. 222: 265-277 (2013) | |
| i9 | Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn: A New Perspective on Vertex Connectivity. CoRR abs/1304.4553 (2013) | |
| 2012 | ||
| j13 | Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar: Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Computing 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 (Eds.): 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 | |
| i8 | Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn: Beeping a Maximal Independent Set. CoRR abs/1206.0150 (2012) | |
| i7 | 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 Computing 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 | ||
| 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 | ||
| 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 | |
| i6 | 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 Computing 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 | ||
| i5 | ||
| i4 | Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman: Optimal Gradient Clock Synchronization in Dynamic Networks. CoRR abs/1005.2894 (2010) | |
| i3 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Local Computation: Lower and Upper Bounds. CoRR abs/1011.5470 (2010) | |
| 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 | 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 | |
| c35 | ||
| c34 | Fabian Kuhn, Thomas Locher, Rotem Oshman: Gradient clock synchronization in dynamic networks. SPAA 2009: 270-279 | |
| c33 | Fabian Kuhn: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. STACS 2009: 613-624 | |
| c32 | ||
| c31 | Alejandro Cornejo, Fabian Kuhn, Ruy Ley-Wild, Nancy A. Lynch: Keeping Mobile Robot Swarms Connected. DISC 2009: 496-511 | |
| i2 | Fabian Kuhn: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. CoRR abs/0902.1868 (2009) | |
| i1 | 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. Wireless Networks 14(5): 715-729 (2008) | |
| c30 | ||
| c29 | Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar: Efficient distributed approximation algorithms via probabilistic tree embeddings. PODC 2008: 263-272 | |
| c28 | Torsten Muetze, Patrick Stuedi, Fabian Kuhn, Gustavo Alonso: Understanding Radio Irregularity in Wireless Networks. SECON 2008: 82-90 | |
| r1 | ||
| 2007 | ||
| j4 | Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal: Improved approximation algorithms for connected sensor cover. Wireless Networks 13(2): 153-164 (2007) | |
| c27 | Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar: Reconstructing approximate tree metrics. PODC 2007: 43-52 | |
| c26 | Fabian Kuhn, Thomas Locher, Roger Wattenhofer: Tight bounds for distributed selection. SPAA 2007: 145-153 | |
| c25 | 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 Computing 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) | |
| c24 | Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Taming Dynamic and Selfish Peers. Peer-to-Peer-Systems and -Applications 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 | ||
| c19 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: The price of being near-sighted. SODA 2006: 980-989 | |
| 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 Computing 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 | ||
| 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 | |
Colors in the list of coauthors
Last update Thu May 23 19:49:45 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page