Can ISPs and P2P users cooperate for improved performance? V Aggarwal, A Feldmann, C Scheideler ACM SIGCOMM Computer Communication Review 37 (3), 29-40, 2007 | 567 | 2007 |

A jamming-resistant MAC protocol for single-hop wireless networks B Awerbuch, A Richa, C Scheideler Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008 | 165 | 2008 |

Towards a scalable and robust DHT B Awerbuch, C Scheideler Theory of Computing Systems 45 (2), 234-260, 2009 | 156 | 2009 |

Efficient, distributed data placement strategies for storage area networks A Brinkmann, K Salzwedel, C Scheideler Proceedings of the twelfth annual ACM symposium on Parallel algorithms and …, 2000 | 134 | 2000 |

An O (log n) dominating set protocol for wireless ad-hoc networks under the physical interference model C Scheideler, A Richa, P Santi Proceedings of the 9th ACM international symposium on Mobile ad hoc …, 2008 | 120 | 2008 |

Compact, adaptive placement schemes for non-uniform requirements A Brinkmann, K Salzwedel, C Scheideler Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002 | 115 | 2002 |

Group spreading: A protocol for provably secure distributed name service B Awerbuch, C Scheideler International Colloquium on Automata, Languages, and Programming, 183-195, 2004 | 101 | 2004 |

Improved bounds for the unsplittable flow problem. P Kolman, C Scheideler SODA 2, 184-193, 2002 | 94 | 2002 |

How to spread adversarial nodes? Rotate! C Scheideler Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 93 | 2005 |

Universal routing strategies for interconnection networks C Scheideler Springer, 2006 | 92 | 2006 |

Stabilizing consensus with the power of two choices B Doerr, LA Goldberg, L Minder, T Sauerwald, C Scheideler Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011 | 88 | 2011 |

Simple routing strategies for adversarial systems B Awerbuch, P Berenbrink, A Brinkmann, C Scheideler Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 158-167, 2001 | 84 | 2001 |

Universal algorithms for store-and-forward and wormhole routing R Cypher, F Meyer auf der Heide, C Scheideler, B Vöcking Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 83 | 1996 |

Distributed coloring in O (√ log n)–bits K Kothapalli, M Onus, C Scheideler, C Schindelhauer Proc. of IEEE International Parallel and Distributed Processing Symposium …, 2006 | 81 | 2006 |

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs R Jacob, A Richa, C Scheideler, S Schmid, H Täubig Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 78 | 2009 |

Efficient communication strategies for ad hoc wireless networks M Adler, C Scheideler Theory of Computing Systems 33 (5-6), 337-391, 2000 | 75 | 2000 |

A jamming-resistant MAC protocol for multi-hop wireless networks A Richa, C Scheideler, S Schmid, J Zhang International Symposium on Distributed Computing, 179-193, 2010 | 74 | 2010 |

The hyperring: a low-congestion deterministic data structure for distributed environments B Awerbuch, C Scheideler SODA 4, 318-327, 2004 | 73 | 2004 |

Towards Scalable and Robust Overlay Networks. B Awerbuch, C Scheideler IPTPS 7, 139, 2007 | 71 | 2007 |

Exploiting storage redundancy to speed up randomized shared memory simulations FM auf der Heide, C Scheideler, V Stemann Theoretical Computer Science 162 (2), 245-281, 1996 | 66* | 1996 |