Follow
Christian Scheideler
Christian Scheideler
Verified email at upb.de - Homepage
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
5912007
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
1912008
Towards a scalable and robust DHT
B Awerbuch, C Scheideler
Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006
1822006
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
1402000
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
1322008
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
1252002
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
1202011
Group spreading: A protocol for provably secure distributed name service
B Awerbuch, C Scheideler
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
1182004
Universal routing strategies for interconnection networks
C Scheideler
Springer Science & Business Media, 1998
1091998
Amoebot-a new model for programmable matter
Z Derakhshandeh, S Dolev, R Gmyr, AW Richa, C Scheideler, ...
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and …, 2014
1032014
Improved bounds for the unsplittable flow problem
P Kolman, C Scheideler
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
1002002
How to spread adversarial nodes? Rotate!
C Scheideler
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
992005
Distributed Coloring with O (√ logn) Bits
K Kothapalli, C Scheideler, M Onus, C Schindelhauer
92*2006
A jamming-resistant mac protocol for multi-hop wireless networks
A Richa, C Scheideler, S Schmid, J Zhang
Distributed Computing: 24th International Symposium, DISC 2010, Cambridge …, 2010
892010
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
871996
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
862001
Universal shape formation for programmable matter
Z Derakhshandeh, R Gmyr, AW Richa, C Scheideler, T Strothmann
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
832016
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
822009
The hyperring: a low-congestion deterministic data structure for distributed environments
B Awerbuch, C Scheideler
SODA 4, 318-327, 2004
812004
Efficient communication strategies for ad-hoc wireless networks
M Adler, C Scheideler
Proceedings of the tenth annual ACM symposium on Parallel algorithms and …, 1998
811998
The system can't perform the operation now. Try again later.
Articles 1–20