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.
301 Publications
2001 | Conference Paper | LibreCat-ID: 2140 | 
Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 2141 |
Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 2142 |
Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2143
Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2145
Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 |
Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38--47.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2211 |
Czumaj A, Scheideler C. 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:38-47.
LibreCat
| Files available
1999 | Journal Article | LibreCat-ID: 2151
Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 2164 |
Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: SODA. ; 1999:112--121.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2165 |
Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: SPAA. ; 1999:33--42.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2210 |
Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage Network (Extended Abstract). In: International Workshop on Communication and Data Management in Large Networks (CDMLarge). ; 1999:2-12.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2166 |
Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In: STOC. ; 1999:215--224.
LibreCat
| Files available
1998 | Journal Article | LibreCat-ID: 2168
Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096
LibreCat
| DOI
1998 | Conference Paper | LibreCat-ID: 2169 |
Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.
LibreCat
| Files available
1998 | Conference Paper | LibreCat-ID: 2170 |
Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633.
LibreCat
| Files available
1998 | Book | LibreCat-ID: 2185
Scheideler C. Universal Routing Strategies for Interconnection Networks. Vol 1390.; 1998. doi:10.1007/BFb0052928
LibreCat
| DOI