Fabian Kuhn

Cited by

	All	Since 2016
Citations	8617	2960
h-index	43	28
i10-index	100	77

700

350

175

525

200320042005200620072008200920102011201220132014201520162017201820192020202136 180 269 372 360 547 550 520 514 559 555 519 518 529 476 552 546 689 161

Public access

View all

25 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Roger WattenhoferETH ZurichVerified email at ethz.ch
Mohsen GhaffariAssistant Professor, ETH ZurichVerified email at inf.ethz.ch
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, University of ViennaVerified email at univie.ac.at
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
Bernhard HaeuplerAssistant Professor, CMUVerified email at cs.cmu.edu
Mahesh BalakrishnanFacebookVerified email at fb.com
Keren Censor-HillelDepartment of Computer Science, TechnionVerified email at cs.technion.ac.il
Christian ScheidelerUniversität PaderbornVerified email at upb.de
Majid KhabbazianUniversity of AlbertaVerified email at ualberta.ca
Robert GmyrMicrosoftVerified email at microsoft.com
Christoph LenzenSaarland Informatics CampusVerified email at mpi-inf.mpg.de
Tim NiebergJade University of Applied SciencesVerified email at jade-hs.de
Aditya AkellaProfessor, Computer Science, UW-MadisonVerified email at cs.wisc.edu
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	940	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	752	2003
Ad hoc networks beyond unit disk graphs F Kuhn, R Wattenhofer, A Zollinger Wireless Networks 14 (5), 715-729, 2008	445*	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	388	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	375	2002
Constant-time distributed dominating set approximation F Kuhn, R Wattenhofer Distributed Computing 17 (4), 303-310, 2005	300	2005
What cannot be computed locally! F Kuhn, T Moscibroda, R Wattenhofer Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004	297	2004
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	224	2004
The price of being near-sighted F Kuhn, T Moscibroda, R Wattenhofer SODA 6 (10.1145), 1109557.1109666, 2006	210	2006
On the complexity of distributed graph coloring F Kuhn, R Wattenhofer Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006	200	2006
Dynamic networks: models and algorithms F Kuhn, R Oshman ACM SIGACT News 42 (1), 82-96, 2011	193	2011
Unit disk graph approximation F Kuhn, T Moscibroda, R Wattenhofer Proceedings of the 2004 joint workshop on Foundations of mobile computing, 17-23, 2004	175	2004
Local computation: Lower and upper bounds F Kuhn, T Moscibroda, R Wattenhofer Journal of the ACM (JACM) 63 (2), 1-44, 2016	159*	2016
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	149	2005
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	145	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	143	2008
On the locality of bounded growth F Kuhn, T Moscibroda, R Wattenhofer Proceedings of the twenty-fourth annual ACM symposium on Principles of …, 2005	122	2005
Weak graph colorings: distributed algorithms and applications F Kuhn Proceedings of the twenty-first annual symposium on Parallelism in …, 2009	119	2009
Deploying wireless networks with beeps A Cornejo, F Kuhn International Symposium on Distributed Computing, 148-162, 2010	111	2010
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	109	2005

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

Upload PDF

Follow this author

Cited by

Co-authors