The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Roger Wattenhofer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roger Wattenhofer, Peter Widmayer
    An Inherent Bottleneck in Distributed Counting. [Citation Graph (1, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:135-145 [Journal]
  2. Gustavo Alonso, Evangelos Kranakis, Cindy Sawchuk, Roger Wattenhofer, Peter Widmayer
    Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2003, pp:104-115 [Conf]
  3. Keno Albrecht, Roger Wattenhofer
    The TROOTH Recommendation System. [Citation Graph (0, 0)][DBLP]
    AICT/ICIW, 2006, pp:110- [Conf]
  4. Keno Albrecht, Nicolas Burri, Roger Wattenhofer
    Spamato - An Extendable Spam Filter System. [Citation Graph (0, 0)][DBLP]
    CEAS, 2005, pp:- [Conf]
  5. Edouard Bugnion, Thomas Roos, Roger Wattenhofer, Peter Widmayer
    Space Filling Curves versus Random Walks. [Citation Graph (0, 0)][DBLP]
    Algorithmic Foundations of Geographic Information Systems, 1996, pp:199-211 [Conf]
  6. 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]
  7. Thomas Moscibroda, Roger Wattenhofer
    Minimizing interference in ad hoc and sensor networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2005, pp:24-33 [Conf]
  8. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Unit disk graph approximation. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2004, pp:17-23 [Conf]
  9. 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]
  10. 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]
  11. Regina O'Dell, Roger Wattenhofer
    Information dissemination in highly dynamic graphs. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2005, pp:104-110 [Conf]
  12. Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhofer, Roger Wattenhofer
    Virtual coordinates for ad hoc and sensor networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2004, pp:8-16 [Conf]
  13. Pascal von Rickenbach, Roger Wattenhofer
    Gathering correlated data in sensor networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2004, pp:60-66 [Conf]
  14. John R. Douceur, Roger Wattenhofer
    Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:356-367 [Conf]
  15. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Radio Network Clustering from Scratch. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:460-471 [Conf]
  16. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer
    Near-Optimal Hot-Potato Routing on Trees. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:820-827 [Conf]
  17. Roger Wattenhofer
    Algorithms for Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    EWSN, 2006, pp:2- [Conf]
  18. Stephan Eidenbenz, Luzi Anderegg, Roger Wattenhofer
    Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu. [Citation Graph (0, 0)][DBLP]
    HICSS, 2007, pp:293- [Conf]
  19. Stefan Schmid, Roger Wattenhofer
    Dynamic Internet Congestion with Bursts. [Citation Graph (0, 0)][DBLP]
    HiPC, 2006, pp:159-170 [Conf]
  20. 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]
  21. Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer
    Truthful Mechanisms for Generalized Utilitarian Problems. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:167-180 [Conf]
  22. Craig Labovitz, Abha Ahuja, Roger Wattenhofer, Venkatachary Srinivasan
    The Impact of Internet Policy and Topology on Delayed Routing Convergence. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:537-546 [Conf]
  23. Roger Wattenhofer, Erran L. Li, Paramvir Bahl, Yi-Min Wang
    Distributed Topology Control for Wireless Multihop Ad-hoc Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1388-1397 [Conf]
  24. Gustavo Alonso, Evangelos Kranakis, Roger Wattenhofer, Peter Widmayer
    Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:218- [Conf]
  25. Thomas Moscibroda, Roger Wattenhofer
    Maximizing the Lifetime of Dominating Sets. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  26. Pascal von Rickenbach, Stefan Schmid, Roger Wattenhofer, Aaron Zollinger
    A Robust Interference Model for Wireless Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  27. Roger Wattenhofer, Aaron Zollinger
    XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  28. Stefan Schmid, Roger Wattenhofer
    Algorithmic models for sensor networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  29. Nicolas Burri, Pascal von Rickenbach, Roger Wattenhofer
    Dozer: ultra-low power data gathering in sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2007, pp:450-459 [Conf]
  30. 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]
  31. Gabor Cselle, Keno Albrecht, Roger Wattenhofer
    BuzzTrack: topic detection and tracking in email. [Citation Graph (0, 0)][DBLP]
    Intelligent User Interfaces, 2007, pp:190-197 [Conf]
  32. John R. Douceur, Roger Wattenhofer
    Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2001, pp:311-0 [Conf]
  33. 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]
  34. 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]
  35. Martin Burkhart, Pascal von Rickenbach, Roger Wattenhofer, Aaron Zollinger
    Does topology control reduce interference? [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2004, pp:9-19 [Conf]
  36. Roland Flury, Roger Wattenhofer
    MLS: : an efficient location service for mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2006, pp:226-237 [Conf]
  37. Thomas Moscibroda, Roger Wattenhofer, Aaron Zollinger
    Topology control meets SINR: : the scheduling complexity of arbitrary topologies. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2006, pp:310-321 [Conf]
  38. Nicolas Burri, Pascal von Rickenbach, Roger Wattenhofer, Yves Weber
    Topology Control Made Practical: Increasing the Performance of Source Routing. [Citation Graph (0, 0)][DBLP]
    MSN, 2006, pp:1-12 [Conf]
  39. Atul Adya, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin Theimer, Roger Wattenhofer
    FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. [Citation Graph (0, 0)][DBLP]
    OSDI, 2002, pp:- [Conf]
  40. Keno Albrecht, Ruedi Arnold, Michael Gähwiler, Roger Wattenhofer
    Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave. [Citation Graph (0, 0)][DBLP]
    Peer-to-Peer Computing, 2004, pp:227-234 [Conf]
  41. Thomas Locher, Stefan Schmid, Roger Wattenhofer
    eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System. [Citation Graph (0, 0)][DBLP]
    Peer-to-Peer Computing, 2006, pp:3-11 [Conf]
  42. Regina Bischoff, Roger Wattenhofer
    Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning. [Citation Graph (0, 0)][DBLP]
    PerCom, 2004, pp:165-176 [Conf]
  43. Phuong Hoai Ha, Philippas Tsigas, Mirjam Wattenhofer, Roger Wattenhofer
    Efficient multi-word locking using randomization. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:249-257 [Conf]
  44. Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
    Competitive concurrent distributed queuing. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:127-133 [Conf]
  45. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    What cannot be computed locally! [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:300-309 [Conf]
  46. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Brief announcement: efficient clustering in unstructured radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:396- [Conf]
  47. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    On the locality of bounded growth. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:60-68 [Conf]
  48. Fabian Kuhn, Roger Wattenhofer
    Constant-time distributed dominating set approximation. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:25-32 [Conf]
  49. Fabian Kuhn, Roger Wattenhofer
    On the complexity of distributed graph coloring. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:7-15 [Conf]
  50. 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]
  51. Erran L. Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer
    Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:264-273 [Conf]
  52. Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
    When selfish meets evil: byzantine players in a virus inoculation game. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:35-44 [Conf]
  53. Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
    On the topologies formed by selfish peers. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:133-142 [Conf]
  54. Thomas Moscibroda, Roger Wattenhofer
    Facility location: distributed approximation. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:108-117 [Conf]
  55. Thomas Moscibroda, Roger Wattenhofer
    Maximal independent sets in radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:148-157 [Conf]
  56. Roger Wattenhofer, Peter Widmayer
    An Inherent Bottleneck in Distributed Counting. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:159-167 [Conf]
  57. Joachim Giesen, Roger Wattenhofer, Aaron Zollinger
    Towards a Theory of Peer-to-Peer Computability. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:115-132 [Conf]
  58. Roger Wattenhofer
    Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:24-28 [Conf]
  59. Roger Wattenhofer, Peter Widmayer
    The counting pyramid: an adaptive distributed counting scheme. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:145-157 [Conf]
  60. Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer
    Geometric Routing Without Geometry. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:307-322 [Conf]
  61. Thomas Locher, Roger Wattenhofer, Aaron Zollinger
    Received-Signal-Strength-Based Logical Positioning Resilient to Signal Fluctuation. [Citation Graph (0, 0)][DBLP]
    SNPD, 2005, pp:396-402 [Conf]
  62. Costas Busch, Maurice Herlihy, Roger Wattenhofer
    Randomized greedy hot-potato routing. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:458-466 [Conf]
  63. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    The price of being near-sighted. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:980-989 [Conf]
  64. Costas Busch, Maurice Herlihy, Roger Wattenhofer
    Routing without flow control. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:11-20 [Conf]
  65. Fabian Kuhn, Roger Wattenhofer
    Dynamic analysis of the arrow distributed protocol. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:294-301 [Conf]
  66. Thomas Moscibroda, Roger Wattenhofer
    Coloring unstructured radio networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:39-48 [Conf]
  67. John R. Douceur, Roger Wattenhofer
    Optimizing File Availability in a Secure Serverless Distributed File System. [Citation Graph (0, 0)][DBLP]
    SRDS, 2001, pp:4-13 [Conf]
  68. Dominik Grolimund, Luzius Meisser, Stefan Schmid, Roger Wattenhofer
    Cryptree: A Folder Tree Structure for Cryptographic File Systems. [Citation Graph (0, 0)][DBLP]
    SRDS, 2006, pp:189-198 [Conf]
  69. Costas Busch, Maurice Herlihy, Roger Wattenhofer
    Hard-Potato routing. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:278-285 [Conf]
  70. Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer
    Efficient Adaptive Collect Using Randomization. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:159-173 [Conf]
  71. John R. Douceur, Roger Wattenhofer
    Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:48-62 [Conf]
  72. 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]
  73. Mirjam Wattenhofer, Roger Wattenhofer
    Distributed Weighted Matching. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:335-348 [Conf]
  74. Thomas Locher, Roger Wattenhofer
    Oblivious Gradient Clock Synchronization. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:520-533 [Conf]
  75. Roger Wattenhofer, Peter Widmayer
    A Unified Analysis of Distributed Counting with Queueing Theory. [Citation Graph (0, 0)][DBLP]
    WDAS, 1998, pp:84-97 [Conf]
  76. Roger Wattenhofer
    Wireless Networking: Graph Theory Unplugged. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:20-32 [Conf]
  77. 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]
  78. Roger Wattenhofer
    Algorithms for ad hoc and sensor networks. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2005, v:28, n:13, pp:1498-1504 [Journal]
  79. Erran L. Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer
    Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-hop Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  80. 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]
  81. 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]
  82. Roger Wattenhofer, Peter Widmayer
    The counting pyramid: an adaptive distributed counting scheme. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:4, pp:449-460 [Journal]
  83. Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
    Ordered Multicast and Distributed Swap. [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 2001, v:35, n:1, pp:85-96 [Journal]
  84. Regina O'Dell, Roger Wattenhofer
    Theoretical aspects of connectivity-based multi-hop positioning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:344, n:1, pp:47-68 [Journal]
  85. Razvan Cristescu, Baltasar Beferull-Lozano, Martin Vetterli, Roger Wattenhofer
    Network correlated data gathering with explicit communication: NP-completeness and algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:14, n:1, pp:41-54 [Journal]
  86. Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer
    A cone-based distributed topology-control algorithm for wireless multi-hop networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:1, pp:147-159 [Journal]
  87. Thomas Moscibroda, Yvonne Anne Oswald, Roger Wattenhofer
    How Optimal are Wireless Scheduling Protocols? [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1433-1441 [Conf]
  88. Roland Flury, Roger Wattenhofer
    Routing, Anycast, and Multicast for Mesh and Sensor Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:946-954 [Conf]
  89. Thomas Moscibroda, Roger Wattenhofer
    The Complexity of Connectivity in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  90. Thomas Moscibroda, Pascal von Rickenbach, Roger Wattenhofer
    Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  91. Fabian Kuhn, Thomas Locher, Roger Wattenhofer
    Tight bounds for distributed selection. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:145-153 [Conf]
  92. Thomas Locher, Remo Meier, Stefan Schmid, Roger Wattenhofer
    Push-to-Pull Peer-to-Peer Live Streaming. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:388-402 [Conf]
  93. Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer
    Mechanism Design by Creditability. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:208-219 [Conf]
  94. 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]

  95. Algorithms for Sensor Networks: What Is It Good for?. [Citation Graph (, )][DBLP]


  96. The Layered World of Scientific Conferences. [Citation Graph (, )][DBLP]


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


  98. On the Topologies Formed by Selfish Peers. [Citation Graph (, )][DBLP]


  99. 07151 Abstracts Collection -- Geometry in Sensor Networks. [Citation Graph (, )][DBLP]


  100. Decoding Code on a Sensor Node. [Citation Graph (, )][DBLP]


  101. Speed Dating Despite Jammers. [Citation Graph (, )][DBLP]


  102. Theory for sensor networks: what is it good for? [Citation Graph (, )][DBLP]


  103. Local broadcasting in the physical interference model. [Citation Graph (, )][DBLP]


  104. Clock Synchronization with Bounded Global and Local Skew. [Citation Graph (, )][DBLP]


  105. Cluestr: mobile social networking for enhanced group communication. [Citation Graph (, )][DBLP]


  106. Structuring Unstructured Peer-to-Peer Networks. [Citation Graph (, )][DBLP]


  107. Wireless Communication Is in APX. [Citation Graph (, )][DBLP]


  108. Physical Algorithms. [Citation Graph (, )][DBLP]


  109. Randomized 3D Geographic Routing. [Citation Graph (, )][DBLP]


  110. Capacity of Arbitrary Wireless Networks. [Citation Graph (, )][DBLP]


  111. Greedy Routing with Bounded Stretch. [Citation Graph (, )][DBLP]


  112. Distributed asymmetric verification in computational grids. [Citation Graph (, )][DBLP]


  113. Gradient clock synchronization in wireless sensor networks. [Citation Graph (, )][DBLP]


  114. Slotted programming for sensor networks. [Citation Graph (, )][DBLP]


  115. Manipulation in Games. [Citation Graph (, )][DBLP]


  116. Good Programming in Transactional Memory. [Citation Graph (, )][DBLP]


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


  118. Exploring music collections on mobile devices. [Citation Graph (, )][DBLP]


  119. Complexity in geometric SINR. [Citation Graph (, )][DBLP]


  120. Complexity of scheduling with analog network coding. [Citation Graph (, )][DBLP]


  121. Robust live media streaming in swarms. [Citation Graph (, )][DBLP]


  122. Rescuing Tit-for-Tat with Source Coding. [Citation Graph (, )][DBLP]


  123. Tight bounds for delay-sensitive aggregation. [Citation Graph (, )][DBLP]


  124. A log-star distributed maximal independent set algorithm for growth-bounded graphs. [Citation Graph (, )][DBLP]


  125. Coloring unstructured wireless multi-hop networks. [Citation Graph (, )][DBLP]


  126. Tight bounds for clock synchronization. [Citation Graph (, )][DBLP]


  127. Brief announcement: tree decomposition for faster concurrent data structures. [Citation Graph (, )][DBLP]


  128. Brief announcement: self-monitoring in dynamic wireless networks. [Citation Graph (, )][DBLP]


  129. A new technique for distributed symmetry breaking. [Citation Graph (, )][DBLP]


  130. Brief announcement: exponential speed-up of local algorithms using non-local communication. [Citation Graph (, )][DBLP]


  131. Brief announcement: efficient graph algorithms without synchronization. [Citation Graph (, )][DBLP]


  132. Optimal clock synchronization in networks. [Citation Graph (, )][DBLP]


  133. YETI: an Eclipse plug-in for TinyOS 2.1. [Citation Graph (, )][DBLP]


  134. On the windfall of friendship: inoculation strategies on social networks. [Citation Graph (, )][DBLP]


  135. Word of Mouth: Rumor Dissemination in Social Networks. [Citation Graph (, )][DBLP]


  136. Clock Synchronization: Open Problems in Theory and Practice. [Citation Graph (, )][DBLP]


  137. What can be approximated locally?: case study: dominating sets in planar graphs. [Citation Graph (, )][DBLP]


  138. Brief announcement: selfishness in transactional memory. [Citation Graph (, )][DBLP]


  139. ALPS: Authenticating Live Peer-to-Peer Live Streams. [Citation Graph (, )][DBLP]


  140. Local Algorithms: Self-stabilization on Speed. [Citation Graph (, )][DBLP]


  141. Distributed Disaster Disclosure. [Citation Graph (, )][DBLP]


  142. Leveraging Linial's Locality Limit. [Citation Graph (, )][DBLP]


  143. What Is the Use of Collision Detection (in Wireless Networks)? [Citation Graph (, )][DBLP]


  144. Minimum Dominating Set Approximation in Graphs of Bounded Arboricity. [Citation Graph (, )][DBLP]


  145. Layers and Hierarchies in Real Virtual Networks. [Citation Graph (, )][DBLP]


  146. From Web to Map: Exploring the World of Music. [Citation Graph (, )][DBLP]


  147. Sensor Networks Continue to Puzzle: Selected Open Problems. [Citation Graph (, )][DBLP]


  148. Poisoning the Kad Network. [Citation Graph (, )][DBLP]


  149. Visually and Acoustically Exploring the High-Dimensional Space of Music. [Citation Graph (, )][DBLP]


  150. VENETA: Serverless Friend-of-Friend Detection in Mobile Social Networking. [Citation Graph (, )][DBLP]


  151. Community-Aware Mobile Networking. [Citation Graph (, )][DBLP]


  152. Transactional Memory: How to perform load adaption in a simple and distributed manner. [Citation Graph (, )][DBLP]


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


  154. Coloring unstructured radio networks. [Citation Graph (, )][DBLP]


  155. Special issue on PODC 2007. [Citation Graph (, )][DBLP]


Search in 0.290secs, Finished in 0.298secs
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