Fabian Kuhn
Fabian Kuhn
Professor of Computer Science, University of Freiburg
Verified email at informatik.uni-freiburg.de
Title
Cited by
Cited by
Year
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
9172003
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
7422003
Ad hoc networks beyond unit disk graphs
F Kuhn, R Wattenhofer, A Zollinger
Wireless Networks 14 (5), 715-729, 2008
440*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
3702002
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
3672010
Constant-time distributed dominating set approximation
F Kuhn, R Wattenhofer
Distributed Computing 17 (4), 303-310, 2005
2972005
What cannot be computed locally!
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the twenty-third annual ACM symposium on Principles of†…, 2004
2922004
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
2222004
The price of being near-sighted
F Kuhn, T Moscibroda, R Wattenhofer
SODA 6 (10.1145), 1109557.1109666, 2006
2042006
On the complexity of distributed graph coloring
F Kuhn, R Wattenhofer
Proceedings of the twenty-fifth annual ACM symposium on Principles of†…, 2006
1942006
Dynamic networks: models and algorithms
F Kuhn, R Oshman
ACM SIGACT News 42 (1), 82-96, 2011
1782011
Unit disk graph approximation
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the 2004 joint workshop on Foundations of mobile computing, 17-23, 2004
1702004
Local computation: Lower and upper bounds
F Kuhn, T Moscibroda, R Wattenhofer
Journal of the ACM (JACM) 63 (2), 1-44, 2016
144*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
1432014
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
1432005
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
1402008
On the locality of bounded growth
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the twenty-fourth annual ACM symposium on Principles of†…, 2005
1222005
Weak graph colorings: distributed algorithms and applications
F Kuhn
Proceedings of the twenty-first annual symposium on Parallelism in†…, 2009
1162009
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
1072005
Deploying wireless networks with beeps
A Cornejo, F Kuhn
International Symposium on Distributed Computing, 148-162, 2010
1042010
The system can't perform the operation now. Try again later.
Articles 1–20