The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fabian Kuhn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger
    Interference in Cellular Networks: The Minimum Membership Set Cover Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:188-198 [Conf]
  2. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Unit disk graph approximation. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2004, pp:17-23 [Conf]
  3. Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer
    Local approximation schemes for ad hoc and sensor networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2005, pp:97-103 [Conf]
  4. Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
    Asymptotically optimal geometric mobile ad-hoc routing. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2002, pp:24-33 [Conf]
  5. Fabian Kuhn, Aaron Zollinger
    Ad-hoc networks beyond unit disk graphs. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2003, pp:69-78 [Conf]
  6. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Radio Network Clustering from Scratch. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:460-471 [Conf]
  7. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Fault-Tolerant Clustering in Ad Hoc and Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2006, pp:68- [Conf]
  8. Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
    A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2005, pp:13-23 [Conf]
  9. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Initializing newly deployed ad hoc and sensor networks. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2004, pp:260-274 [Conf]
  10. Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
    Worst-Case optimal and average-case efficient geometric ad-hoc routing. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2003, pp:267-278 [Conf]
  11. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    What cannot be computed locally! [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:300-309 [Conf]
  12. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Brief announcement: efficient clustering in unstructured radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:396- [Conf]
  13. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    On the locality of bounded growth. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:60-68 [Conf]
  14. Fabian Kuhn, Roger Wattenhofer
    Constant-time distributed dominating set approximation. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:25-32 [Conf]
  15. Fabian Kuhn, Roger Wattenhofer
    On the complexity of distributed graph coloring. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:7-15 [Conf]
  16. Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger
    Geometric ad-hoc routing: of theory and practice. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:63-72 [Conf]
  17. Fabian Kuhn, René Struik
    Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2001, pp:212-229 [Conf]
  18. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    The price of being near-sighted. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:980-989 [Conf]
  19. Fabian Kuhn, Roger Wattenhofer
    Dynamic analysis of the arrow distributed protocol. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:294-301 [Conf]
  20. Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer
    Efficient Adaptive Collect Using Randomization. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:159-173 [Conf]
  21. Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer
    Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:273-287 [Conf]
  22. Keno Albrecht, Fabian Kuhn, Roger Wattenhofer
    Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn. [Citation Graph (0, 0)][DBLP]
    Research Results of the DICS Program, 2006, pp:275-294 [Conf]
  23. Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer
    Efficient adaptive collect using randomization. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:179-188 [Journal]
  24. Fabian Kuhn, Roger Wattenhofer
    Constant-time distributed dominating set approximation. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:17, n:4, pp:303-310 [Journal]
  25. Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar
    Reconstructing approximate tree metrics. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:43-52 [Conf]
  26. Fabian Kuhn, Thomas Moscibroda
    Distributed approximation of capacitated dominating sets. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:161-170 [Conf]
  27. Fabian Kuhn, Thomas Locher, Roger Wattenhofer
    Tight bounds for distributed selection. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:145-153 [Conf]
  28. Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer
    Dynamic Analysis of the Arrow Distributed Protocol. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:6, pp:875-901 [Journal]
  29. Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal
    Improved approximation algorithms for connected sensor cover. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2007, v:13, n:2, pp:153-164 [Journal]

  30. Taming Dynamic and Selfish Peers. [Citation Graph (, )][DBLP]


  31. Decomposing broadcast algorithms using abstract MAC layers. [Citation Graph (, )][DBLP]


  32. A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves. [Citation Graph (, )][DBLP]


  33. Gradient Clock Synchronization Using Reference Broadcasts. [Citation Graph (, )][DBLP]


  34. Efficient distributed approximation algorithms via probabilistic tree embeddings. [Citation Graph (, )][DBLP]


  35. Distributed computation of the mode. [Citation Graph (, )][DBLP]


  36. Brief announcement: hardness of broadcasting in wireless networks with unreliable communication. [Citation Graph (, )][DBLP]


  37. The wireless synchronization problem. [Citation Graph (, )][DBLP]


  38. Optimal gradient clock synchronization in dynamic networks. [Citation Graph (, )][DBLP]


  39. Broadcasting in unreliable radio networks. [Citation Graph (, )][DBLP]


  40. On the treeness of internet latency and bandwidth. [Citation Graph (, )][DBLP]


  41. Synchrony and Asynchrony in Neural Networks. [Citation Graph (, )][DBLP]


  42. Weak graph colorings: distributed algorithms and applications. [Citation Graph (, )][DBLP]


  43. Gradient clock synchronization in dynamic networks. [Citation Graph (, )][DBLP]


  44. Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. [Citation Graph (, )][DBLP]


  45. Distributed computation in dynamic networks. [Citation Graph (, )][DBLP]


  46. Keeping Mobile Robot Swarms Connected. [Citation Graph (, )][DBLP]


  47. The Abstract MAC Layer. [Citation Graph (, )][DBLP]


  48. Deploying Wireless Networks with Beeps. [Citation Graph (, )][DBLP]


  49. Understanding Radio Irregularity in Wireless Networks. [Citation Graph (, )][DBLP]


  50. Distributed selection: a missing piece of data aggregation. [Citation Graph (, )][DBLP]


  51. Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time [Citation Graph (, )][DBLP]


  52. Gradient Clock Synchronization using Reference Broadcasts [Citation Graph (, )][DBLP]


  53. Deploying Wireless Networks with Beeps [Citation Graph (, )][DBLP]


  54. Optimal Gradient Clock Synchronization in Dynamic Networks [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002