| 2009 | ||
|---|---|---|
| 48 | Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport: The Abstract MAC Layer. DISC 2009: 48-62 | |
| 47 | Alejandro Cornejo, Fabian Kuhn, Ruy Ley-Wild, Nancy A. Lynch: Keeping Mobile Robot Swarms Connected. DISC 2009: 496-511 | |
| 46 | Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Fabian Kuhn, Calvin C. Newport: The wireless synchronization problem. PODC 2009: 190-199 | |
| 45 | Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport: Brief announcement: hardness of broadcasting in wireless networks with unreliable communication. PODC 2009: 330-331 | |
| 44 | 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 | |
| 43 | Fabian Kuhn: Weak graph colorings: distributed algorithms and applications. SPAA 2009: 138-144 | |
| 42 | Fabian Kuhn, Thomas Locher, Rotem Oshman: Gradient clock synchronization in dynamic networks. SPAA 2009: 270-279 | |
| 41 | Fabian Kuhn: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. STACS 2009: 613-624 | |
| 40 | Fabian Kuhn: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time CoRR abs/0902.1868: (2009) | |
| 39 | Fabian Kuhn, Rotem Oshman: Gradient Clock Synchronization using Reference Broadcasts CoRR abs/0905.3454: (2009) | |
| 2008 | ||
| 38 | Fabian Kuhn, Thomas Locher, Stefan Schmid: Distributed computation of the mode. PODC 2008: 15-24 | |
| 37 | Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar: Efficient distributed approximation algorithms via probabilistic tree embeddings. PODC 2008: 263-272 | |
| 36 | Torsten Muetze, Patrick Stuedi, Fabian Kuhn, Gustavo Alonso: Understanding Radio Irregularity in Wireless Networks. SECON 2008: 82-90 | |
| 35 | Fabian Kuhn: Local Approximation of Covering and Packing Problems. Encyclopedia of Algorithms 2008 | |
| 34 | Fabian Kuhn, Thomas Locher, Roger Wattenhofer: Distributed selection: a missing piece of data aggregation. Commun. ACM 51(9): 93-99 (2008) | |
| 33 | 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) | |
| 32 | Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger: Ad hoc networks beyond unit disk graphs. Wireless Networks 14(5): 715-729 (2008) | |
| 2007 | ||
| 31 | Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar: Reconstructing approximate tree metrics. PODC 2007: 43-52 | |
| 30 | Fabian Kuhn, Thomas Locher, Roger Wattenhofer: Tight bounds for distributed selection. SPAA 2007: 145-153 | |
| 29 | Fabian Kuhn, Thomas Moscibroda: Distributed approximation of capacitated dominating sets. SPAA 2007: 161-170 | |
| 28 | Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal: Improved approximation algorithms for connected sensor cover. Wireless Networks 13(2): 153-164 (2007) | |
| 2006 | ||
| 27 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Fault-Tolerant Clustering in Ad Hoc and Sensor Networks. ICDCS 2006: 68 | |
| 26 | 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 | |
| 25 | Fabian Kuhn, Roger Wattenhofer: On the complexity of distributed graph coloring. PODC 2006: 7-15 | |
| 24 | Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Taming Dynamic and Selfish Peers. Peer-to-Peer-Systems and -Applications 2006 | |
| 23 | Keno Albrecht, Fabian Kuhn, Roger Wattenhofer: Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn. Research Results of the DICS Program 2006: 275-294 | |
| 22 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: The price of being near-sighted. SODA 2006: 980-989 | |
| 21 | Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer: Efficient adaptive collect using randomization. Distributed Computing 18(3): 179-188 (2006) | |
| 20 | Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer: Dynamic Analysis of the Arrow Distributed Protocol. Theory Comput. Syst. 39(6): 875-901 (2006) | |
| 2005 | ||
| 19 | 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 | |
| 18 | Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer: Local approximation schemes for ad hoc and sensor networks. DIALM-POMC 2005: 97-103 | |
| 17 | Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer: Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. DISC 2005: 273-287 | |
| 16 | Fabian Kuhn, Stefan Schmid, Roger Wattenhofer: A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. IPTPS 2005: 13-23 | |
| 15 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: On the locality of bounded growth. PODC 2005: 60-68 | |
| 14 | Fabian Kuhn, Roger Wattenhofer: Constant-time distributed dominating set approximation. Distributed Computing 17(4): 303-310 (2005) | |
| 2004 | ||
| 13 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Unit disk graph approximation. DIALM-POMC 2004: 17-23 | |
| 12 | Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer: Efficient Adaptive Collect Using Randomization. DISC 2004: 159-173 | |
| 11 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Radio Network Clustering from Scratch. ESA 2004: 460-471 | |
| 10 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Initializing newly deployed ad hoc and sensor networks. MOBICOM 2004: 260-274 | |
| 9 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: What cannot be computed locally! PODC 2004: 300-309 | |
| 8 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Brief announcement: efficient clustering in unstructured radio networks. PODC 2004: 396 | |
| 7 | Fabian Kuhn, Roger Wattenhofer: Dynamic analysis of the arrow distributed protocol. SPAA 2004: 294-301 | |
| 2003 | ||
| 6 | Fabian Kuhn, Aaron Zollinger: Ad-hoc networks beyond unit disk graphs. DIALM-POMC 2003: 69-78 | |
| 5 | Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger: Worst-Case optimal and average-case efficient geometric ad-hoc routing. MobiHoc 2003: 267-278 | |
| 4 | Fabian Kuhn, Roger Wattenhofer: Constant-time distributed dominating set approximation. PODC 2003: 25-32 | |
| 3 | Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger: Geometric ad-hoc routing: of theory and practice. PODC 2003: 63-72 | |
| 2002 | ||
| 2 | Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger: Asymptotically optimal geometric mobile ad-hoc routing. DIAL-M 2002: 24-33 | |
| 2001 | ||
| 1 | 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 | |