The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Moscibroda: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Moscibroda, Roger Wattenhofer
    Minimizing interference in ad hoc and sensor networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2005, pp:24-33 [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. 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]
  5. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
    Radio Network Clustering from Scratch. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:460-471 [Conf]
  6. 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]
  7. Thomas Moscibroda, Roger Wattenhofer
    Maximizing the Lifetime of Dominating Sets. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  8. Thomas Moscibroda
    The worst-case capacity of wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2007, pp:1-10 [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. 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]
  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. 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]
  15. Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
    On the topologies formed by selfish peers. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:133-142 [Conf]
  16. Thomas Moscibroda, Roger Wattenhofer
    Facility location: distributed approximation. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:108-117 [Conf]
  17. Thomas Moscibroda, Roger Wattenhofer
    Maximal independent sets in radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:148-157 [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. Thomas Moscibroda, Roger Wattenhofer
    Coloring unstructured radio networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:39-48 [Conf]
  20. 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]
  21. Thomas Moscibroda
    Clustering. [Citation Graph (0, 0)][DBLP]
    Algorithms for Sensor and Ad Hoc Networks, 2007, pp:37-61 [Conf]
  22. Thomas Moscibroda, Yvonne Anne Oswald, Roger Wattenhofer
    How Optimal are Wireless Scheduling Protocols? [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1433-1441 [Conf]
  23. Thomas Moscibroda, Roger Wattenhofer
    The Complexity of Connectivity in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  24. 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]
  25. John R. Douceur, Thomas Moscibroda
    Lottery trees: motivational deployment of networked systems. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2007, pp:121-132 [Conf]
  26. John R. Douceur, Jay R. Lorch, Thomas Moscibroda
    Maximizing total upload in latency-sensitive P2P applications. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:270-279 [Conf]
  27. Fabian Kuhn, Thomas Moscibroda
    Distributed approximation of capacitated dominating sets. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:161-170 [Conf]

  28. Dynamically replicated memory: building reliable systems from nanoscale resistive memories. [Citation Graph (, )][DBLP]


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


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


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


  32. Maximum Bipartite Flow in Networks with Adaptive Channel Width. [Citation Graph (, )][DBLP]


  33. DirCast: A Practical and Efficient Wi-Fi Multicast System. [Citation Graph (, )][DBLP]


  34. On Mechanism Design without Payments for Throughput Maximization. [Citation Graph (, )][DBLP]


  35. Collaborative Measurements of Upload Speeds in P2P Systems. [Citation Graph (, )][DBLP]


  36. Parallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems. [Citation Graph (, )][DBLP]


  37. A case for bufferless routing in on-chip networks. [Citation Graph (, )][DBLP]


  38. Aérgia: exploiting packet latency slack in on-chip networks. [Citation Graph (, )][DBLP]


  39. Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors. [Citation Graph (, )][DBLP]


  40. Application-aware prioritization mechanisms for on-chip networks. [Citation Graph (, )][DBLP]


  41. Allocating dynamic time-spectrum blocks in cognitive radio networks. [Citation Graph (, )][DBLP]


  42. An agile radio framework for unmanaged wireless environments. [Citation Graph (, )][DBLP]


  43. TrInc: Small Trusted Hardware for Large Distributed Systems. [Citation Graph (, )][DBLP]


  44. Brief announcement: collaborative measurement of upload speeds in P2P systems. [Citation Graph (, )][DBLP]


  45. Distributed order scheduling and its application to multi-core dram controllers. [Citation Graph (, )][DBLP]


  46. Donnybrook: enabling large-scale, high-speed, peer-to-peer games. [Citation Graph (, )][DBLP]


  47. A case for adapting channel width in wireless networks. [Citation Graph (, )][DBLP]


  48. White space networking with wi-fi like connectivity. [Citation Graph (, )][DBLP]


  49. Buffer management for colored packets with deadlines. [Citation Graph (, )][DBLP]


  50. ThunderDome: discovering upload constraints using decentralized bandwidth tournaments. [Citation Graph (, )][DBLP]


  51. Optimal whitespace synchronization strategies [Citation Graph (, )][DBLP]


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


Search in 0.003secs, Finished in 0.004secs
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