Fabian Kuhn
Fabian Kuhn
Professor of Computer Science, University of Freiburg
Verified email at informatik.uni-freiburg.de
TitleCited byYear
Geometric ad-hoc routing: Of theory and practice
F Kuhn, R Wattenhofer, Y Zhang, A Zollinger
Proceedings of the twenty-second annual symposium on Principles of …, 2003
9062003
Worst-case optimal and average-case efficient geometric ad-hoc routing
F Kuhn, R Wattenhofer, A Zollinger
Proceedings of the 4th ACM international symposium on Mobile ad hoc …, 2003
7372003
Ad hoc networks beyond unit disk graphs
F Kuhn, R Wattenhofer, A Zollinger
Wireless Networks 14 (5), 715-729, 2008
420*2008
Asymptotically optimal geometric mobile ad-hoc routing
F Kuhn, R Wattenhofer, A Zollinger
Proceedings of the 6th international workshop on Discrete algorithms and …, 2002
3672002
Distributed computation in dynamic networks
F Kuhn, N Lynch, R Oshman
Proceedings of the forty-second ACM symposium on Theory of computing, 513-522, 2010
3292010
Constant-time distributed dominating set approximation
F Kuhn, R Wattenhofer
Distributed Computing 17 (4), 303-310, 2005
2882005
What cannot be computed locally!
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
2792004
Initializing newly deployed ad hoc and sensor networks
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the 10th annual international conference on Mobile computing …, 2004
2172004
The price of being near-sighted
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
1932006
On the complexity of distributed graph coloring
F Kuhn, R Wattenhofer
Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006
1822006
Unit disk graph approximation
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the 2004 joint workshop on Foundations of mobile computing, 17-23, 2004
1662004
Dynamic networks: models and algorithms
F Kuhn, R Oshman
ACM SIGACT News 42 (1), 82-96, 2011
1582011
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
F Kuhn, T Moscibroda, T Nieberg, R Wattenhofer
International Symposium on Distributed Computing, 273-287, 2005
1422005
An algorithmic approach to geographic routing in ad hoc and sensor networks
F Kuhn, R Wattenhofer, A Zollinger
IEEE/ACM Transactions On Networking 16 (1), 51-62, 2008
1312008
Local computation: Lower and upper bounds
F Kuhn, T Moscibroda, R Wattenhofer
Journal of the ACM (JACM) 63 (2), 17, 2016
122*2016
On the power of the congested clique model
A Drucker, F Kuhn, R Oshman
Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014
1182014
On the locality of bounded growth
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the twenty-fourth annual ACM symposium on Principles of …, 2005
1182005
Weak graph colorings: distributed algorithms and applications
F Kuhn
Proceedings of the twenty-first annual symposium on Parallelism in …, 2009
1082009
A self-repairing peer-to-peer system resilient to dynamic adversarial churn
F Kuhn, S Schmid, R Wattenhofer
International Workshop on Peer-to-Peer Systems, 13-23, 2005
1032005
On the treeness of internet latency and bandwidth
V Ramasubramanian, D Malkhi, F Kuhn, M Balakrishnan, A Gupta, ...
ACM SIGMETRICS Performance Evaluation Review 37 (1), 61-72, 2009
972009
The system can't perform the operation now. Try again later.
Articles 1–20