His scientific interests lie mostly in Combinatorics, Discrete mathematics, Distributed algorithm, Theoretical computer science and Distributed computing. His study in the field of Dominating set and Degree also crosses realms of Constant, Exponential function and Randomness. His Discrete mathematics study combines topics from a wide range of disciplines, such as Bounded function and Computation.
The various areas that he examines in his Distributed algorithm study include Hypergraph, Approximation algorithm, Network topology, Wireless network and Upper and lower bounds. The study incorporates disciplines such as Destination-Sequenced Distance Vector routing, Static routing, Geographic routing, Dynamic Source Routing and Topology in addition to Theoretical computer science. His Distributed computing research is multidisciplinary, incorporating elements of Adversary and Wireless sensor network, Computer network.
His primary areas of investigation include Combinatorics, Distributed algorithm, Discrete mathematics, Upper and lower bounds and Binary logarithm. His research combines Bounded function and Combinatorics. His Distributed algorithm study deals with Theoretical computer science intersecting with Topology.
His Discrete mathematics research incorporates elements of Node and Wireless network. His Upper and lower bounds research incorporates themes from Matching, Algorithm and Security token. His study in the field of Log-log plot is also linked to topics like Omega.
The scientist’s investigation covers issues in Combinatorics, Distributed algorithm, Binary logarithm, Time complexity and Upper and lower bounds. His Combinatorics study integrates concerns from other disciplines, such as Matching and Bounded function. His Distributed algorithm research includes elements of Discrete mathematics, Randomized algorithm, Graph, Maximal independent set and Arboricity.
Fabian Kuhn frequently studies issues relating to Approximation algorithm and Discrete mathematics. His research investigates the link between Time complexity and topics such as Dominating set that cross with problems in Theoretical computer science. He has included themes like Node, Security token, Complement and Integer in his Upper and lower bounds study.
His main research concerns Distributed algorithm, Combinatorics, Binary logarithm, Time complexity and Discrete mathematics. His study in Distributed algorithm is interdisciplinary in nature, drawing from both Arboricity, Overlay network, Theoretical computer science and Open problem. His work deals with themes such as Dominating set, Minimum spanning tree and Planar graph, which intersect with Theoretical computer science.
His research in Combinatorics intersects with topics in Matching and Upper and lower bounds. The Discrete mathematics study combines topics in areas such as Graph and Approximation algorithm. His work carried out in the field of Graph brings together such families of science as Vertex and Graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Geometric ad-hoc routing: of theory and practice
Fabian Kuhn;Rogert Wattenhofer;Yan Zhang;Aaron Zollinger.
principles of distributed computing (2003)
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Fabian Kuhn;Rogert Wattenhofer;Aaron Zollinger.
mobile ad hoc networking and computing (2003)
What cannot be computed locally
Fabian Kuhn;Thomas Moscibroda;Roger Wattenhofer.
principles of distributed computing (2004)
Asymptotically optimal geometric mobile ad-hoc routing
Fabian Kuhn;Rogert Wattenhofer;Aaron Zollinger.
international workshop on discrete algorithms and methods for mobile computing and communications (2002)
Distributed computation in dynamic networks
Fabian Kuhn;Nancy Lynch;Rotem Oshman.
symposium on the theory of computing (2010)
Constant-time distributed dominating set approximation
Fabian Kuhn;Rogert Wattenhofer.
principles of distributed computing (2003)
Ad-hoc networks beyond unit disk graphs
Fabian Kuhn;Roger Wattenhofer;Aaron Zollinger.
foundations of mobile computing (2003)
Initializing newly deployed ad hoc and sensor networks
Fabian Kuhn;Thomas Moscibroda;Rogert Wattenhofer.
acm/ieee international conference on mobile computing and networking (2004)
The price of being near-sighted
Fabian Kuhn;Thomas Moscibroda;Roger Wattenhofer.
symposium on discrete algorithms (2006)
On the complexity of distributed graph coloring
Fabian Kuhn;Rogert Wattenhofer.
principles of distributed computing (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
ETH Zurich
Microsoft (United States)
MIT
University of Paderborn
Reykjavík University
University of Vienna
Diem Association
Indian Institute of Technology Delhi
University of Houston
Augusta University
Southern Methodist University
University of Chicago
Huazhong University of Science and Technology
University of Innsbruck
Leibniz Association
University of Potsdam
Pennsylvania State University
University of Arizona
Rowan University
San Diego State University
University of Washington
The University of Texas MD Anderson Cancer Center
Microsoft (United States)
University of Minnesota
United States Naval Research Laboratory