| 2009 |
|---|
| 39 | EE | Fabian Kuhn:
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time.
STACS 2009: 613-624 |
| 38 | EE | Fabian Kuhn:
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
CoRR abs/0902.1868: (2009) |
| 2008 |
|---|
| 37 | EE | Fabian Kuhn,
Thomas Locher,
Stefan Schmid:
Distributed computation of the mode.
PODC 2008: 15-24 |
| 36 | EE | Maleq Khan,
Fabian Kuhn,
Dahlia Malkhi,
Gopal Pandurangan,
Kunal Talwar:
Efficient distributed approximation algorithms via probabilistic tree embeddings.
PODC 2008: 263-272 |
| 35 | EE | Torsten Muetze,
Patrick Stuedi,
Fabian Kuhn,
Gustavo Alonso:
Understanding Radio Irregularity in Wireless Networks.
SECON 2008: 82-90 |
| 34 | EE | Fabian Kuhn:
Local Approximation of Covering and Packing Problems.
Encyclopedia of Algorithms 2008 |
| 33 | EE | Fabian Kuhn,
Thomas Locher,
Roger Wattenhofer:
Distributed selection: a missing piece of data aggregation.
Commun. ACM 51(9): 93-99 (2008) |
| 32 | EE | 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) |
| 31 | EE | Fabian Kuhn,
Roger Wattenhofer,
Aaron Zollinger:
Ad hoc networks beyond unit disk graphs.
Wireless Networks 14(5): 715-729 (2008) |
| 2007 |
|---|
| 30 | EE | Ittai Abraham,
Mahesh Balakrishnan,
Fabian Kuhn,
Dahlia Malkhi,
Venugopalan Ramasubramanian,
Kunal Talwar:
Reconstructing approximate tree metrics.
PODC 2007: 43-52 |
| 29 | EE | Fabian Kuhn,
Thomas Locher,
Roger Wattenhofer:
Tight bounds for distributed selection.
SPAA 2007: 145-153 |
| 28 | EE | Fabian Kuhn,
Thomas Moscibroda:
Distributed approximation of capacitated dominating sets.
SPAA 2007: 161-170 |
| 27 | EE | 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 |
|---|
| 26 | EE | Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks.
ICDCS 2006: 68 |
| 25 | EE | Fabian Kuhn,
Roger Wattenhofer:
On the complexity of distributed graph coloring.
PODC 2006: 7-15 |
| 24 | EE | Stefan Schmid,
Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
Taming Dynamic and Selfish Peers.
Peer-to-Peer-Systems and -Applications 2006 |
| 23 | EE | 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 | EE | Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
The price of being near-sighted.
SODA 2006: 980-989 |
| 21 | EE | Hagit Attiya,
Fabian Kuhn,
C. Greg Plaxton,
Mirjam Wattenhofer,
Roger Wattenhofer:
Efficient adaptive collect using randomization.
Distributed Computing 18(3): 179-188 (2006) |
| 20 | EE | 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 | EE | 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 | EE | Fabian Kuhn,
Tim Nieberg,
Thomas Moscibroda,
Roger Wattenhofer:
Local approximation schemes for ad hoc and sensor networks.
DIALM-POMC 2005: 97-103 |
| 17 | EE | Fabian Kuhn,
Thomas Moscibroda,
Tim Nieberg,
Roger Wattenhofer:
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.
DISC 2005: 273-287 |
| 16 | EE | Fabian Kuhn,
Stefan Schmid,
Roger Wattenhofer:
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn.
IPTPS 2005: 13-23 |
| 15 | EE | Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
On the locality of bounded growth.
PODC 2005: 60-68 |
| 14 | EE | Fabian Kuhn,
Roger Wattenhofer:
Constant-time distributed dominating set approximation.
Distributed Computing 17(4): 303-310 (2005) |
| 2004 |
|---|
| 13 | EE | Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
Unit disk graph approximation.
DIALM-POMC 2004: 17-23 |
| 12 | EE | Hagit Attiya,
Fabian Kuhn,
Mirjam Wattenhofer,
Roger Wattenhofer:
Efficient Adaptive Collect Using Randomization.
DISC 2004: 159-173 |
| 11 | EE | Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
Radio Network Clustering from Scratch.
ESA 2004: 460-471 |
| 10 | EE | Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
Initializing newly deployed ad hoc and sensor networks.
MOBICOM 2004: 260-274 |
| 9 | EE | Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
What cannot be computed locally!
PODC 2004: 300-309 |
| 8 | EE | Fabian Kuhn,
Thomas Moscibroda,
Roger Wattenhofer:
Brief announcement: efficient clustering in unstructured radio networks.
PODC 2004: 396 |
| 7 | EE | Fabian Kuhn,
Roger Wattenhofer:
Dynamic analysis of the arrow distributed protocol.
SPAA 2004: 294-301 |
| 2003 |
|---|
| 6 | EE | Fabian Kuhn,
Aaron Zollinger:
Ad-hoc networks beyond unit disk graphs.
DIALM-POMC 2003: 69-78 |
| 5 | EE | Fabian Kuhn,
Roger Wattenhofer,
Aaron Zollinger:
Worst-Case optimal and average-case efficient geometric ad-hoc routing.
MobiHoc 2003: 267-278 |
| 4 | EE | Fabian Kuhn,
Roger Wattenhofer:
Constant-time distributed dominating set approximation.
PODC 2003: 25-32 |
| 3 | EE | Fabian Kuhn,
Roger Wattenhofer,
Yan Zhang,
Aaron Zollinger:
Geometric ad-hoc routing: of theory and practice.
PODC 2003: 63-72 |
| 2002 |
|---|
| 2 | EE | Fabian Kuhn,
Roger Wattenhofer,
Aaron Zollinger:
Asymptotically optimal geometric mobile ad-hoc routing.
DIAL-M 2002: 24-33 |
| 2001 |
|---|
| 1 | EE | 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 |
