Christian Scheideler
Christian Scheideler
Verified email at upb.de
Title
Cited by
Cited by
Year
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
5712007
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
1692008
Towards a scalable and robust DHT
B Awerbuch, C Scheideler
Theory of Computing Systems 45 (2), 234-260, 2009
1592009
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
1342000
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
1212008
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
1162002
Group spreading: A protocol for provably secure distributed name service
B Awerbuch, C Scheideler
International Colloquium on Automata, Languages, and Programming, 183-195, 2004
1032004
How to spread adversarial nodes? Rotate!
C Scheideler
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
952005
Improved bounds for the unsplittable flow problem.
P Kolman, C Scheideler
SODA 2, 184-193, 2002
952002
Universal routing strategies for interconnection networks
C Scheideler
Springer, 2006
922006
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
902011
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
842001
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
831996
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
812006
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
802009
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
752010
Efficient communication strategies for ad hoc wireless networks
M Adler, C Scheideler
Theory of Computing Systems 33 (5-6), 337-391, 2000
752000
The hyperring: a low-congestion deterministic data structure for distributed environments
B Awerbuch, C Scheideler
SODA 4, 318-327, 2004
742004
Towards Scalable and Robust Overlay Networks.
B Awerbuch, C Scheideler
IPTPS 7, 139, 2007
722007
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
67*1996
The system can't perform the operation now. Try again later.
Articles 1–20