| 2009 | ||
|---|---|---|
| 43 | Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan: Maximum Bipartite Flow in Networks with Adaptive Channel Width. ICALP (2) 2009: 351-362 | |
| 42 | Thomas Moscibroda, Onur Mutlu: A case for bufferless routing in on-chip networks. ISCA 2009: 196-207 | |
| 41 | Zhou Wang, Ranveer Chandra, Thomas Moscibroda, Alain Gefflaut, Alexandre de Baynast, Victor Bahl: An agile radio framework for unmanaged wireless environments. MobiHoc 2009: 333-334 | |
| 40 | John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi: Brief announcement: collaborative measurement of upload speeds in P2P systems. PODC 2009: 338-339 | |
| 39 | Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra: Buffer management for colored packets with deadlines. SPAA 2009: 319-327 | |
| 2008 | ||
| 38 | Olga Goussevskaia, Thomas Moscibroda, Roger Wattenhofer: Local broadcasting in the physical interference model. DIALM-POMC 2008: 35-44 | |
| 37 | Onur Mutlu, Thomas Moscibroda: Parallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems. ISCA 2008: 63-74 | |
| 36 | Thomas Moscibroda, Onur Mutlu: Distributed order scheduling and its application to multi-core dram controllers. PODC 2008: 365-374 | |
| 35 | Ranveer Chandra, Ratul Mahajan, Thomas Moscibroda, Ramya Raghavendra, Paramvir Bahl: A case for adapting channel width in wireless networks. SIGCOMM 2008: 135-146 | |
| 34 | Ashwin R. Bharambe, John R. Douceur, Jacob R. Lorch, Thomas Moscibroda, Jeffrey Pang, Srinivasan Seshan, Xinyu Zhuang: Donnybrook: enabling large-scale, high-speed, peer-to-peer games. SIGCOMM 2008: 389-400 | |
| 33 | Thomas Moscibroda: Local Computation in Unstructured Radio Networks. Encyclopedia of Algorithms 2008 | |
| 32 | Thomas Moscibroda, Roger Wattenhofer: Coloring unstructured radio networks. Distributed Computing 21(4): 271-284 (2008) | |
| 2007 | ||
| 31 | Thomas Moscibroda: Clustering. Algorithms for Sensor and Ad Hoc Networks 2007: 37-61 | |
| 30 | Thomas Moscibroda, Yvonne Anne Oswald, Roger Wattenhofer: How Optimal are Wireless Scheduling Protocols? INFOCOM 2007: 1433-1441 | |
| 29 | Thomas Moscibroda: The worst-case capacity of wireless sensor networks. IPSN 2007: 1-10 | |
| 28 | Onur Mutlu, Thomas Moscibroda: Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors. MICRO 2007: 146-160 | |
| 27 | Yuan Yuan, Paramvir Bahl, Ranveer Chandra, Thomas Moscibroda, Yunnan Wu: Allocating dynamic time-spectrum blocks in cognitive radio networks. MobiHoc 2007: 130-139 | |
| 26 | John R. Douceur, Thomas Moscibroda: Lottery trees: motivational deployment of networked systems. SIGCOMM 2007: 121-132 | |
| 25 | Fabian Kuhn, Thomas Moscibroda: Distributed approximation of capacitated dominating sets. SPAA 2007: 161-170 | |
| 24 | John R. Douceur, Jay R. Lorch, Thomas Moscibroda: Maximizing total upload in latency-sensitive P2P applications. SPAA 2007: 270-279 | |
| 2006 | ||
| 23 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Fault-Tolerant Clustering in Ad Hoc and Sensor Networks. ICDCS 2006: 68 | |
| 22 | Thomas Moscibroda, Pascal von Rickenbach, Roger Wattenhofer: Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks. INFOCOM 2006 | |
| 21 | Thomas Moscibroda, Roger Wattenhofer: The Complexity of Connectivity in Wireless Networks. INFOCOM 2006 | |
| 20 | Thomas Moscibroda, Roger Wattenhofer, Aaron Zollinger: Topology control meets SINR: : the scheduling complexity of arbitrary topologies. MobiHoc 2006: 310-321 | |
| 19 | Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer: On the topologies formed by selfish peers. PODC 2006: 133-142 | |
| 18 | Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer: When selfish meets evil: byzantine players in a virus inoculation game. PODC 2006: 35-44 | |
| 17 | Stefan Schmid, Thomas Moscibroda, Roger Wattenhofer: On the Topologies Formed by Selfish Peers. Peer-to-Peer-Systems and -Applications 2006 | |
| 16 | Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Taming Dynamic and Selfish Peers. Peer-to-Peer-Systems and -Applications 2006 | |
| 15 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: The price of being near-sighted. SODA 2006: 980-989 | |
| 2005 | ||
| 14 | Thomas Moscibroda, Roger Wattenhofer: Minimizing interference in ad hoc and sensor networks. DIALM-POMC 2005: 24-33 | |
| 13 | Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer: Local approximation schemes for ad hoc and sensor networks. DIALM-POMC 2005: 97-103 | |
| 12 | Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer: Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. DISC 2005: 273-287 | |
| 11 | Thomas Moscibroda, Roger Wattenhofer: Maximizing the Lifetime of Dominating Sets. IPDPS 2005 | |
| 10 | Thomas Moscibroda, Roger Wattenhofer: Facility location: distributed approximation. PODC 2005: 108-117 | |
| 9 | Thomas Moscibroda, Roger Wattenhofer: Maximal independent sets in radio networks. PODC 2005: 148-157 | |
| 8 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: On the locality of bounded growth. PODC 2005: 60-68 | |
| 7 | Thomas Moscibroda, Roger Wattenhofer: Coloring unstructured radio networks. SPAA 2005: 39-48 | |
| 2004 | ||
| 6 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Unit disk graph approximation. DIALM-POMC 2004: 17-23 | |
| 5 | Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhofer, Roger Wattenhofer: Virtual coordinates for ad hoc and sensor networks. DIALM-POMC 2004: 8-16 | |
| 4 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Radio Network Clustering from Scratch. ESA 2004: 460-471 | |
| 3 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Initializing newly deployed ad hoc and sensor networks. MOBICOM 2004: 260-274 | |
| 2 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: What cannot be computed locally! PODC 2004: 300-309 | |
| 1 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer: Brief announcement: efficient clustering in unstructured radio networks. PODC 2004: 396 | |