![]() | 2010 | |
---|---|---|
155 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Lenzen, Thomas Locher, Philipp Sommer, Roger Wattenhofer: Clock Synchronization: Open Problems in Theory and Practice. SOFSEM 2010: 61-70 |
154 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Lenzen, Thomas Locher, Roger Wattenhofer: Tight bounds for clock synchronization. J. ACM 57(2): (2010) |
2009 | ||
153 | ![]() ![]() ![]() ![]() ![]() ![]() | Vijay K. Garg, Roger Wattenhofer, Kishore Kothapalli: Distributed Computing and Networking, 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6, 2009. Proceedings Springer 2009 |
152 | ![]() ![]() ![]() ![]() ![]() ![]() | Lukas Bossard, Michael Kuhn, Roger Wattenhofer: Visually and Acoustically Exploring the High-Dimensional Space of Music. CSE (4) 2009: 58-65 |
151 | ![]() ![]() ![]() ![]() ![]() ![]() | Dominic Meier, Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer: Speed Dating Despite Jammers. DCOSS 2009: 1-14 |
150 | ![]() ![]() ![]() ![]() ![]() ![]() | Reto Grob, Michael Kuhn, Roger Wattenhofer, Martin Wirz: Cluestr: mobile social networking for enhanced group communication. GROUP 2009: 81-90 |
149 | ![]() ![]() ![]() ![]() ![]() ![]() | Magnús M. Halldórsson, Roger Wattenhofer: Wireless Communication Is in APX. ICALP (1) 2009: 525-536 |
148 | ![]() ![]() ![]() ![]() ![]() ![]() | Roland Flury, Sriram V. Pemmaraju, Roger Wattenhofer: Greedy Routing with Bounded Stretch. INFOCOM 2009: 1737-1745 |
147 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl: Capacity of Arbitrary Wireless Networks. INFOCOM 2009: 1872-1880 |
146 | ![]() ![]() ![]() ![]() ![]() ![]() | Raphael Eidenbenz, Roger Wattenhofer: Good Programming in Transactional Memory. ISAAC 2009: 503-513 |
145 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Locher, Remo Meier, Roger Wattenhofer, Stefan Schmid: Robust live media streaming in swarms. NOSSDAV 2009: 121-126 |
144 | ![]() ![]() ![]() ![]() ![]() ![]() | Johannes Schneider, Roger Wattenhofer: Coloring unstructured wireless multi-hop networks. PODC 2009: 210-219 |
143 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Lenzen, Thomas Locher, Roger Wattenhofer: Tight bounds for clock synchronization. PODC 2009: 46-55 |
142 | ![]() ![]() ![]() ![]() ![]() ![]() | Raphael Eidenbenz, Roger Wattenhofer: Brief announcement: selfishness in transactional memory. SPAA 2009: 41-42 |
141 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Lenzen, Jukka Suomela, Roger Wattenhofer: Local Algorithms: Self-stabilization on Speed. SSS 2009: 17-34 |
140 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Lenzen, Philipp Sommer, Roger Wattenhofer: Optimal clock synchronization in networks. SenSys 2009: 225-238 |
139 | ![]() ![]() ![]() ![]() ![]() ![]() | Nicolas Burri, Roland Flury, Silvan Nellen, Benjamin Sigg, Philipp Sommer, Roger Wattenhofer: YETI: an Eclipse plug-in for TinyOS 2.1. SenSys 2009: 295-296 |
138 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer: Special issue on PODC 2007. Distributed Computing 21(5): 315 (2009) |
137 | ![]() ![]() ![]() ![]() ![]() ![]() | Pascal von Rickenbach, Roger Wattenhofer, Aaron Zollinger: Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE/ACM Trans. Netw. 17(1): 172-185 (2009) |
2008 | ||
136 | ![]() ![]() ![]() ![]() ![]() ![]() | Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer: On the windfall of friendship: inoculation strategies on social networks. ACM Conference on Electronic Commerce 2008: 294-301 |
135 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer: Algorithms for Sensor Networks: What Is It Good for?. ALGOSENSORS 2008: 1 |
134 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Kuhn, Roger Wattenhofer: The Layered World of Scientific Conferences. APWeb 2008: 81-92 |
133 | ![]() ![]() ![]() ![]() ![]() ![]() | Pascal von Rickenbach, Roger Wattenhofer: Decoding Code on a Sensor Node. DCOSS 2008: 400-414 |
132 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer: Theory for sensor networks: what is it good for? DIALM-POMC 2008: 23-24 |
131 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Goussevskaia, Thomas Moscibroda, Roger Wattenhofer: Local broadcasting in the physical interference model. DIALM-POMC 2008: 35-44 |
130 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Lenzen, Roger Wattenhofer: Leveraging Linial's Locality Limit. DISC 2008: 394-407 |
129 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Lenzen, Thomas Locher, Roger Wattenhofer: Clock Synchronization with Bounded Global and Local Skew. FOCS 2008: 509-518 |
128 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Goussevskaia, Roger Wattenhofer: Complexity of scheduling with analog network coding. FOWANC 2008: 77-84 |
127 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Locher, Pascal von Rickenbach, Roger Wattenhofer: Sensor Networks Continue to Puzzle: Selected Open Problems. ICDCN 2008: 25-38 |
126 | ![]() ![]() ![]() ![]() ![]() ![]() | Roland Flury, Roger Wattenhofer: Randomized 3D Geographic Routing. INFOCOM 2008: 834-842 |
125 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Kuhn, Stefan Schmid, Roger Wattenhofer: Distributed asymmetric verification in computational grids. IPDPS 2008: 1-10 |
124 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Goussevskaia, Michael Kuhn, Roger Wattenhofer: Exploring music collections on mobile devices. Mobile HCI 2008: 359-362 |
123 | ![]() ![]() ![]() ![]() ![]() ![]() | Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer: Tight bounds for delay-sensitive aggregation. PODC 2008: 195-202 |
122 | ![]() ![]() ![]() ![]() ![]() ![]() | Johannes Schneider, Roger Wattenhofer: A log-star distributed maximal independent set algorithm for growth-bounded graphs. PODC 2008: 35-44 |
121 | ![]() ![]() ![]() ![]() ![]() ![]() | Jan Kostka, Yvonne Anne Oswald, Roger Wattenhofer: Word of Mouth: Rumor Dissemination in Social Networks. SIROCCO 2008: 185-196 |
120 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer: What can be approximated locally?: case study: dominating sets in planar graphs. SPAA 2008: 46-54 |
119 | ![]() ![]() ![]() ![]() ![]() ![]() | Remo Meier, Roger Wattenhofer: ALPS: Authenticating Live Peer-to-Peer Live Streams. SRDS 2008: 45-52 |
118 | ![]() ![]() ![]() ![]() ![]() ![]() | Bernard Mans, Stefan Schmid, Roger Wattenhofer: Distributed Disaster Disclosure. SWAT 2008: 246-257 |
117 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Goussevskaia, Michael Kuhn, Michael Lorenzi, Roger Wattenhofer: From Web to Map: Exploring the World of Music. Web Intelligence 2008: 242-248 |
116 | ![]() ![]() ![]() ![]() ![]() ![]() | Marco von Arb, Matthias Bader, Michael Kuhn, Roger Wattenhofer: VENETA: Serverless Friend-of-Friend Detection in Mobile Social Networking. WiMob 2008: 184-189 |
115 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Locher, Roger Wattenhofer: Distributed selection: a missing piece of data aggregation. Commun. ACM 51(9): 93-99 (2008) |
114 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Roger Wattenhofer: Coloring unstructured radio networks. Distributed Computing 21(4): 271-284 (2008) |
113 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger: An algorithmic approach to geographic routing in ad hoc and sensor networks. IEEE/ACM Trans. Netw. 16(1): 51-62 (2008) |
112 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger: Ad hoc networks beyond unit disk graphs. Wireless Networks 14(5): 715-729 (2008) |
2007 | ||
111 | ![]() ![]() ![]() ![]() ![]() ![]() | Indranil Gupta, Roger Wattenhofer: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 ACM 2007 |
110 | ![]() ![]() ![]() ![]() ![]() ![]() | Subhash Suri, Roger Wattenhofer, Peter Widmayer: Geometry in Sensor Networks, 09.04. - 13.04.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
109 | ![]() ![]() ![]() ![]() ![]() ![]() | Dorothea Wagner, Roger Wattenhofer: Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures [result from a Dagstuhl seminar]. Springer 2007 |
108 | ![]() ![]() ![]() ![]() ![]() ![]() | Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer: Mechanism Design by Creditability. COCOA 2007: 208-219 |
107 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Locher, Remo Meier, Stefan Schmid, Roger Wattenhofer: Push-to-Pull Peer-to-Peer Live Streaming. DISC 2007: 388-402 |
106 | ![]() ![]() ![]() ![]() ![]() ![]() | Subhash Suri, Roger Wattenhofer, Peter Widmayer: 07151 Abstracts Collection -- Geometry in Sensor Networks. Geometry in Sensor Networks 2007 |
105 | ![]() ![]() ![]() ![]() ![]() ![]() | Stephan Eidenbenz, Luzi Anderegg, Roger Wattenhofer: Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu. HICSS 2007: 293 |
104 | ![]() ![]() ![]() ![]() ![]() ![]() | Stefan Schmid, Roger Wattenhofer: Structuring Unstructured Peer-to-Peer Networks. HiPC 2007: 432-442 |
103 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Yvonne Anne Oswald, Roger Wattenhofer: How Optimal are Wireless Scheduling Protocols? INFOCOM 2007: 1433-1441 |
102 | ![]() ![]() ![]() ![]() ![]() ![]() | Roland Flury, Roger Wattenhofer: Routing, Anycast, and Multicast for Mesh and Sensor Networks. INFOCOM 2007: 946-954 |
101 | ![]() ![]() ![]() ![]() ![]() ![]() | Nicolas Burri, Pascal von Rickenbach, Roger Wattenhofer: Dozer: ultra-low power data gathering in sensor networks. IPSN 2007: 450-459 |
100 | ![]() ![]() ![]() ![]() ![]() ![]() | Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer: Manipulation in Games. ISAAC 2007: 365-376 |
99 | ![]() ![]() ![]() ![]() ![]() ![]() | Gabor Cselle, Keno Albrecht, Roger Wattenhofer: BuzzTrack: topic detection and tracking in email. IUI 2007: 190-197 |
98 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Goussevskaia, Yvonne Anne Oswald, Roger Wattenhofer: Complexity in geometric SINR. MobiHoc 2007: 100-109 |
97 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Locher, Stefan Schmid, Roger Wattenhofer: Rescuing Tit-for-Tat with Source Coding. Peer-to-Peer Computing 2007: 3-10 |
96 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Locher, Roger Wattenhofer: Tight bounds for distributed selection. SPAA 2007: 145-153 |
95 | ![]() ![]() ![]() ![]() ![]() ![]() | Olga Goussevskaia, Michael Kuhn, Roger Wattenhofer: Layers and Hierarchies in Real Virtual Networks. Web Intelligence 2007: 89-94 |
94 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Kuhn, Roger Wattenhofer: The theoretic center of computer science. SIGACT News 38(4): 54-63 (2007) |
2006 | ||
93 | ![]() ![]() ![]() ![]() ![]() ![]() | James H. Anderson, Giuseppe Prencipe, Roger Wattenhofer: Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers Springer 2006 |
92 | ![]() ![]() ![]() ![]() ![]() ![]() | Keno Albrecht, Roger Wattenhofer: The TROOTH Recommendation System. AICT/ICIW 2006: 110 |
91 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Locher, Roger Wattenhofer: Oblivious Gradient Clock Synchronization. DISC 2006: 520-533 |
90 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer: Algorithms for Wireless Sensor Networks. EWSN 2006: 2 |
89 | ![]() ![]() ![]() ![]() ![]() ![]() | Stefan Schmid, Roger Wattenhofer: Dynamic Internet Congestion with Bursts. HiPC 2006: 159-170 |
88 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Fault-Tolerant Clustering in Ad Hoc and Sensor Networks. ICDCS 2006: 68 |
87 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Pascal von Rickenbach, Roger Wattenhofer: Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks. INFOCOM 2006 |
86 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Roger Wattenhofer: The Complexity of Connectivity in Wireless Networks. INFOCOM 2006 |
85 | ![]() ![]() ![]() ![]() ![]() ![]() | Stefan Schmid, Roger Wattenhofer: Algorithmic models for sensor networks. IPDPS 2006 |
84 | ![]() ![]() ![]() ![]() ![]() ![]() | Stefan Schmid, Fabian Kuhn, Joest Smit, Roger Wattenhofer: A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves. IWQoS 2006: 12-19 |
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Nicolas Burri, Pascal von Rickenbach, Roger Wattenhofer, Yves Weber: Topology Control Made Practical: Increasing the Performance of Source Routing. MSN 2006: 1-12 |
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Kuhn, Roger Wattenhofer: Community-Aware Mobile Networking. MSPE 2006: 1-14 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Roland Flury, Roger Wattenhofer: MLS: : an efficient location service for mobile ad hoc networks. MobiHoc 2006: 226-237 |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Roger Wattenhofer, Aaron Zollinger: Topology control meets SINR: : the scheduling complexity of arbitrary topologies. MobiHoc 2006: 310-321 |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer: On the topologies formed by selfish peers. PODC 2006: 133-142 |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer: When selfish meets evil: byzantine players in a virus inoculation game. PODC 2006: 35-44 |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer: On the complexity of distributed graph coloring. PODC 2006: 7-15 |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Locher, Stefan Schmid, Roger Wattenhofer: eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System. Peer-to-Peer Computing 2006: 3-11 |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Stefan Schmid, Thomas Moscibroda, Roger Wattenhofer: On the Topologies Formed by Selfish Peers. Peer-to-Peer-Systems and -Applications 2006 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Taming Dynamic and Selfish Peers. Peer-to-Peer-Systems and -Applications 2006 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Keno Albrecht, Fabian Kuhn, Roger Wattenhofer: Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn. Research Results of the DICS Program 2006: 275-294 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer: Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?. SIROCCO 2006: 24-28 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: The price of being near-sighted. SODA 2006: 980-989 |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Dominik Grolimund, Luzius Meisser, Stefan Schmid, Roger Wattenhofer: Cryptree: A Folder Tree Structure for Cryptographic File Systems. SRDS 2006: 189-198 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer: Efficient adaptive collect using randomization. Distributed Computing 18(3): 179-188 (2006) |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Razvan Cristescu, Baltasar Beferull-Lozano, Martin Vetterli, Roger Wattenhofer: Network correlated data gathering with explicit communication: NP-completeness and algorithms. IEEE/ACM Trans. Netw. 14(1): 41-54 (2006) |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer: Dynamic Analysis of the Arrow Distributed Protocol. Theory Comput. Syst. 39(6): 875-901 (2006) |
2005 | ||
66 | ![]() ![]() ![]() ![]() ![]() ![]() | P. R. Kumar, Andrew T. Campbell, Roger Wattenhofer: Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2005, Urbana-Champaign, IL, USA, May 25-27, 2005 ACM 2005 |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Keno Albrecht, Nicolas Burri, Roger Wattenhofer: Spamato - An Extendable Spam Filter System. CEAS 2005 |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger: Interference in Cellular Networks: The Minimum Membership Set Cover Problem. COCOON 2005: 188-198 |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Regina O'Dell, Roger Wattenhofer: Information dissemination in highly dynamic graphs. DIALM-POMC 2005: 104-110 |
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Roger Wattenhofer: Minimizing interference in ad hoc and sensor networks. DIALM-POMC 2005: 24-33 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer: Local approximation schemes for ad hoc and sensor networks. DIALM-POMC 2005: 97-103 |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer: Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. DISC 2005: 273-287 |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Pascal von Rickenbach, Stefan Schmid, Roger Wattenhofer, Aaron Zollinger: A Robust Interference Model for Wireless Ad-Hoc Networks. IPDPS 2005 |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Roger Wattenhofer: Maximizing the Lifetime of Dominating Sets. IPDPS 2005 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Stefan Schmid, Roger Wattenhofer: A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. IPTPS 2005: 13-23 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Roger Wattenhofer: Facility location: distributed approximation. PODC 2005: 108-117 |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Roger Wattenhofer: Maximal independent sets in radio networks. PODC 2005: 148-157 |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Phuong Hoai Ha, Philippas Tsigas, Mirjam Wattenhofer, Roger Wattenhofer: Efficient multi-word locking using randomization. PODC 2005: 249-257 |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: On the locality of bounded growth. PODC 2005: 60-68 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer: Geometric Routing Without Geometry. SIROCCO 2005: 307-322 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Locher, Roger Wattenhofer, Aaron Zollinger: Received-Signal-Strength-Based Logical Positioning Resilient to Signal Fluctuation. SNPD 2005: 396-402 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Roger Wattenhofer: Coloring unstructured radio networks. SPAA 2005: 39-48 |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer: Algorithms for ad hoc and sensor networks. Computer Communications 28(13): 1498-1504 (2005) |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer: Constant-time distributed dominating set approximation. Distributed Computing 17(4): 303-310 (2005) |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer: A cone-based distributed topology-control algorithm for wireless multi-hop networks. IEEE/ACM Trans. Netw. 13(1): 147-159 (2005) |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Regina O'Dell, Roger Wattenhofer: Theoretical aspects of connectivity-based multi-hop positioning. Theor. Comput. Sci. 344(1): 47-68 (2005) |
2004 | ||
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Unit disk graph approximation. DIALM-POMC 2004: 17-23 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Pascal von Rickenbach, Roger Wattenhofer: Gathering correlated data in sensor networks. DIALM-POMC 2004: 60-66 |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhofer, Roger Wattenhofer: Virtual coordinates for ad hoc and sensor networks. DIALM-POMC 2004: 8-16 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer: Efficient Adaptive Collect Using Randomization. DISC 2004: 159-173 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Mirjam Wattenhofer, Roger Wattenhofer: Distributed Weighted Matching. DISC 2004: 335-348 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Radio Network Clustering from Scratch. ESA 2004: 460-471 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer: Near-Optimal Hot-Potato Routing on Trees. Euro-Par 2004: 820-827 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer: Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS 2004: 167-180 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer, Aaron Zollinger: XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks. IPDPS 2004 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Initializing newly deployed ad hoc and sensor networks. MOBICOM 2004: 260-274 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Burkhart, Pascal von Rickenbach, Roger Wattenhofer, Aaron Zollinger: Does topology control reduce interference? MobiHoc 2004: 9-19 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: What cannot be computed locally! PODC 2004: 300-309 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Brief announcement: efficient clustering in unstructured radio networks. PODC 2004: 396 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Keno Albrecht, Ruedi Arnold, Michael Gähwiler, Roger Wattenhofer: Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave. Peer-to-Peer Computing 2004: 227-234 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Regina Bischoff, Roger Wattenhofer: Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning. PerCom 2004: 165-176 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer: Dynamic analysis of the arrow distributed protocol. SPAA 2004: 294-301 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer: Wireless Networking: Graph Theory Unplugged. WG 2004: 20-32 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Mirjam Wattenhofer, Roger Wattenhofer: Fast and Simple Algorithms for Weighted Perfect Matching. Electronic Notes in Discrete Mathematics 17: 285-291 (2004) |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer, Peter Widmayer: The counting pyramid: an adaptive distributed counting scheme. J. Parallel Distrib. Comput. 64(4): 449-460 (2004) |
2003 | ||
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Gustavo Alonso, Evangelos Kranakis, Cindy Sawchuk, Roger Wattenhofer, Peter Widmayer: Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. ADHOC-NOW 2003: 104-115 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Gustavo Alonso, Evangelos Kranakis, Roger Wattenhofer, Peter Widmayer: Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. IPDPS 2003: 218 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger: Worst-Case optimal and average-case efficient geometric ad-hoc routing. MobiHoc 2003: 267-278 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer: Constant-time distributed dominating set approximation. PODC 2003: 25-32 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger: Geometric ad-hoc routing: of theory and practice. PODC 2003: 63-72 |
2002 | ||
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger: Asymptotically optimal geometric mobile ad-hoc routing. DIAL-M 2002: 24-33 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | 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. OSDI 2002 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Joachim Giesen, Roger Wattenhofer, Aaron Zollinger: Towards a Theory of Peer-to-Peer Computability. SIROCCO 2002: 115-132 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 CoRR cs.NI/0209012: (2002) |
2001 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | John R. Douceur, Roger Wattenhofer: Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. DISC 2001: 48-62 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | John R. Douceur, Roger Wattenhofer: Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation. ESA 2001: 356-367 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer, Erran L. Li, Paramvir Bahl, Yi-Min Wang: Distributed Topology Control for Wireless Multihop Ad-hoc Networks. INFOCOM 2001: 1388-1397 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Craig Labovitz, Abha Ahuja, Roger Wattenhofer, Venkatachary Srinivasan: The Impact of Internet Policy and Topology on Delayed Routing Convergence. INFOCOM 2001: 537-546 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | John R. Douceur, Roger Wattenhofer: Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System. MASCOTS 2001: 311- |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer: Competitive concurrent distributed queuing. PODC 2001: 127-133 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | 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. PODC 2001: 264-273 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Costas Busch, Maurice Herlihy, Roger Wattenhofer: Routing without flow control. SPAA 2001: 11-20 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | John R. Douceur, Roger Wattenhofer: Optimizing File Availability in a Secure Serverless Distributed File System. SRDS 2001: 4-13 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer: Ordered Multicast and Distributed Swap. Operating Systems Review 35(1): 85-96 (2001) |
2000 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Costas Busch, Maurice Herlihy, Roger Wattenhofer: Randomized greedy hot-potato routing. SODA 2000: 458-466 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Costas Busch, Maurice Herlihy, Roger Wattenhofer: Hard-Potato routing. STOC 2000: 278-285 |
1998 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer, Peter Widmayer: The counting pyramid: an adaptive distributed counting scheme. SIROCCO 1998: 145-157 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer, Peter Widmayer: A Unified Analysis of Distributed Counting with Queueing Theory. WDAS 1998: 84-97 |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer, Peter Widmayer: An Inherent Bottleneck in Distributed Counting. J. Parallel Distrib. Comput. 49(1): 135-145 (1998) |
1997 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Roger Wattenhofer, Peter Widmayer: An Inherent Bottleneck in Distributed Counting. PODC 1997: 159-167 |
1996 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Edouard Bugnion, Thomas Roos, Roger Wattenhofer, Peter Widmayer: Space Filling Curves versus Random Walks. Algorithmic Foundations of Geographic Information Systems 1996: 199-211 |