Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

176 Publications


2009 | Conference Paper | LibreCat-ID: 1932
R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 1938
B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol for single-hop wireless networks,” in Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, 2008, pp. 45--54.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 1940
M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems,” in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 2008, pp. 1135--1144.
LibreCat | Files available
 

2008 | Conference Paper | LibreCat-ID: 1941
T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing Deterministic Skip List,” in Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, 2008, vol. 5340, pp. 124--140.
LibreCat | DOI
 

2008 | Book Chapter | LibreCat-ID: 1942
C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,” in Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236.
LibreCat | DOI
 

2008 | Journal Article | LibreCat-ID: 1937
C. Scheideler, “Algorithms for Overlay Networks,” Bulletin of the EATCS, pp. 130--152, 2008.
LibreCat
 

2007 | Conference Paper | LibreCat-ID: 2020
M. Onus, A. W. Richa, and C. Scheideler, “Linearization: Locally Self-Stabilizing Sorting in Graphs,” in Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.
LibreCat | DOI
 

2007 | Journal Article | LibreCat-ID: 2209
V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate for improved performance?,” ACM Computer Commucation Review, 2007.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 2022
B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,” in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
LibreCat | Files available
 

2007 | Conference Paper | LibreCat-ID: 2023
B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007, pp. 370--371.
LibreCat | Files available | DOI
 

2007 | Book Chapter | LibreCat-ID: 2028
A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,” in Handbook of Approximation Algorithms and Metaheuristics., 2007.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 2214
A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” in IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
LibreCat | Files available
 

2007 | Journal Article | LibreCat-ID: 2017
A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks,” SIAM J. Discrete Math., no. 1, pp. 141--157, 2007.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 2024
B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 2007, vol. 4731, pp. 33--47.
LibreCat | DOI
 

2006 | Journal Article | LibreCat-ID: 2110
G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 2111
K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in IPDPS, 2006.
LibreCat | Files available
 

2006 | Conference Paper | LibreCat-ID: 2112
B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer Systems,” in OPODIS, 2006, pp. 275--289.
LibreCat | Files available
 

2006 | Conference Paper | LibreCat-ID: 2213
C. Scheideler, “Towards a paradigm for robust distributed algorithms and data structures,” in 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.
LibreCat | Files available
 

2006 | Journal Article | LibreCat-ID: 2029
P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006.
LibreCat | DOI
 

2006 | Journal Article | LibreCat-ID: 2043
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp. 903--928, 2006.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 2113
B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in SPAA, 2006, pp. 318--327.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2114
M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005, pp. 182--187.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2115
K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN, 2005, pp. 188--193.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2116
M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2212
C. Scheideler, “Overlay networks for wireless ad hoc networks,” in IMA Workshop on Wireless Communications, 2005.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2117
K. Kothapalli, C. Scheideler, M. Onus, and A. W. Richa, “Constant density spanners for wireless ad-hoc networks,” in SPAA, 2005, pp. 116--125.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2118
C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC, 2005, pp. 704--713.
LibreCat | Files available
 

2004 | Journal Article | LibreCat-ID: 2119
P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 2121
C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2126
A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2122
B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2127
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The effect of faults on network expansion,” in SPAA, 2004, pp. 286--293.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2123
G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in IWIA, 2004, pp. 33--47.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2124
B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2120
B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2125
B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in SPAA, 2004, pp. 44--53.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 2133
K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 2128
V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 2130
B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 2129
B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 2131
A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 2132
L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2138
C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49.
LibreCat | Files available
 

2002 | Journal Article | LibreCat-ID: 2134
U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 2135
P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2136
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2137
A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 2140
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.
LibreCat | Files available
 

2001 | Journal Article | LibreCat-ID: 2139
F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 2141
P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 2142
P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38--47.
LibreCat | Files available
 

2000 | Journal Article | LibreCat-ID: 2145
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2146
P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2211
A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2147
A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.
LibreCat | Files available
 

2000 | Journal Article | LibreCat-ID: 2143
M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 2148
A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.
LibreCat
 

2000 | Conference Paper | LibreCat-ID: 2150
A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2149
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2164
P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2210
P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2165
P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2166
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 2151
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 2169
M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
LibreCat | Files available
 

1998 | Journal Article | LibreCat-ID: 2168
C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 2170
U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 2179
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 2175
S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2183
F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2184
F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in SOFSEM, 1996, vol. 1175, pp. 16--33.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2186
R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996, pp. 356--365.
LibreCat | Files available
 

1996 | Journal Article | LibreCat-ID: 2182
F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput. Sci., no. 2, pp. 245--281, 1996.
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 2208
F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS, 1995, pp. 267--278.
LibreCat | Files available
 

1995 | Conference Paper | LibreCat-ID: 2207
F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146.
LibreCat | Files available
 

1995 | Conference Paper | LibreCat-ID: 2187
F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.
LibreCat | Files available | DOI
 

Filters and Search Terms

(author=20792) AND (type=conference_editor OR type=conference OR type=dissertation OR type=mastersthesis OR type=journal_article OR type=journal_editor OR type=preprint OR type=report OR type=working_paper OR type=book_chapter OR type=book_editor OR type=bachelorsthesis OR type=conference_abstract OR type=newspaper_article)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed