Fabian Kuhn

Cited by

	All	Since 2017
Citations	9381	3180
h-index	45	32
i10-index	105	81

680

340

170

510

2003200420052006200720082009201020112012201320142015201620172018201920202021202232 186 281 374 360 543 532 529 511 553 551 521 521 540 481 538 535 634 668 316

Public access

View all

44 articles

1 article

available

not available

Based on funding mandates

Co-authors

Roger WattenhoferETH ZurichVerified email at ethz.ch
Mohsen GhaffariAssociate Professor, MITVerified email at mit.edu
Nancy LynchProfessor of EECS, MITVerified email at csail.mit.edu
Calvin NewportGeorgetown UniversityVerified email at cs.georgetown.edu
Seth GilbertNational University of SingaporeVerified email at comp.nus.edu.sg
Stefan SchmidProfessor, Computer Science, TU Berlin & University of ViennaVerified email at tu-berlin.de
Alejandro CornejoMassachusetts Institute of TechnologyVerified email at mit.edu
Dahlia malkhiNoviVerified email at fb.com
Thomas LocherETH ZurichVerified email at tik.ee.ethz.ch
Sebastian DaumUniversity of FreiburgVerified email at cs.uni-freiburg.de
Christian ScheidelerUniversität PaderbornVerified email at upb.de
Bernhard HaeuplerAssociate Professor, CMUVerified email at cs.cmu.edu
Mahesh BalakrishnanConfluentVerified email at confluent.io
Keren Censor-HillelDepartment of Computer Science, TechnionVerified email at cs.technion.ac.il
Robert GmyrMicrosoftVerified email at microsoft.com
Majid KhabbazianUniversity of AlbertaVerified email at ualberta.ca
Christoph LenzenSaarland Informatics CampusVerified email at mpi-inf.mpg.de
Mohamad AhmadiUniversity of FreiburgVerified email at cs.uni-freiburg.de
Tim NiebergJade University of Applied SciencesVerified email at jade-hs.de
Ittai AbrahamVMwareVerified email at cs.huji.ac.il

Fabian Kuhn

Professor of Computer Science, University of Freiburg

Verified email at informatik.uni-freiburg.de

distributed algorithms & complexity


Title Sort by citations Sort by year Sort by 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	955	2003
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	780	2003
Ad hoc networks beyond unit disk graphs F Kuhn, R Wattenhofer, A Zollinger Wireless Networks 14 (5), 715-729, 2008	455*	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	417	2010
Asymptotically optimal geometric mobile ad-hoc routing F Kuhn, R Wattenhofer, A Zollinger Proceedings of the 6th international workshop on Discrete algorithms and …, 2002	383	2002
What cannot be computed locally! F Kuhn, T Moscibroda, R Wattenhofer Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004	309	2004
Constant-time distributed dominating set approximation F Kuhn, R Wattenhofer Distributed Computing 17 (4), 303-310, 2005	304	2005
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	234	2004
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	225	2006
Dynamic networks: models and algorithms F Kuhn, R Oshman ACM SIGACT News 42 (1), 82-96, 2011	224	2011
On the complexity of distributed graph coloring F Kuhn, R Wattenhofer Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006	215	2006
Local computation: Lower and upper bounds F Kuhn, T Moscibroda, R Wattenhofer Journal of the ACM (JACM) 63 (2), 1-44, 2016	184*	2016
Unit disk graph approximation F Kuhn, T Moscibroda, R Wattenhofer Proceedings of the 2004 joint workshop on Foundations of mobile computing, 17-23, 2004	183	2004
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	167	2014
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	150	2008
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	147	2005
Weak graph colorings: distributed algorithms and applications F Kuhn Proceedings of the twenty-first annual symposium on Parallelism in …, 2009	133	2009
Deploying wireless networks with beeps A Cornejo, F Kuhn International Symposium on Distributed Computing, 148-162, 2010	124	2010
On the locality of bounded growth F Kuhn, T Moscibroda, R Wattenhofer Proceedings of the twenty-fourth annual ACM symposium on Principles of …, 2005	123	2005
Coordinated consensus in dynamic networks F Kuhn, Y Moses, R Oshman Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011	116	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors