Obserwuj
Fabian Kuhn
Fabian Kuhn
Professor of Computer Science, University of Freiburg
Zweryfikowany adres z informatik.uni-freiburg.de
Tytuł
Cytowane przez
Cytowane przez
Rok
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
9832003
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
7972003
Ad hoc networks beyond unit disk graphs
F Kuhn, R Wattenhofer, A Zollinger
Wireless Networks 14 (5), 715-729, 2008
469*2008
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
4632010
Asymptotically optimal geometric mobile ad-hoc routing
F Kuhn, R Wattenhofer, A Zollinger
Proceedings of the 6th international workshop on Discrete algorithms and …, 2002
3952002
What cannot be computed locally!
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
3312004
Constant-time distributed dominating set approximation
F Kuhn, R Wattenhofer
Proceedings of the twenty-second annual symposium on Principles of …, 2003
3232003
Dynamic networks: models and algorithms
F Kuhn, R Oshman
ACM SIGACT News 42 (1), 82-96, 2011
2572011
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
2402004
The price of being near-sighted
F Kuhn, T Moscibroda, R Wattenhofer
SODA 2006: 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, Florida, USA, 2006
2332006
On the complexity of distributed graph coloring
F Kuhn, R Wattenhofer
Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006
2202006
Local computation: Lower and upper bounds
F Kuhn, T Moscibroda, R Wattenhofer
Journal of the ACM (JACM) 63 (2), 1-44, 2016
208*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
1952014
Unit disk graph approximation
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the 2004 joint workshop on Foundations of mobile computing, 17-23, 2004
1902004
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
1532008
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
F Kuhn, T Moscibroda, T Nieberg, R Wattenhofer
Distributed Computing: 19th International Conference, DISC 2005, Cracow …, 2005
1502005
Weak graph colorings: distributed algorithms and applications
F Kuhn
Proceedings of the twenty-first annual symposium on Parallelism in …, 2009
1412009
Deploying wireless networks with beeps
A Cornejo, F Kuhn
International Symposium on Distributed Computing, 148-162, 2010
1362010
Coordinated consensus in dynamic networks
F Kuhn, Y Moses, R Oshman
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011
1322011
On the locality of bounded growth
F Kuhn, T Moscibroda, R Wattenhofer
Proceedings of the twenty-fourth annual ACM symposium on Principles of …, 2005
1282005
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20