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.
307 Publications
2000 | Journal Article | LibreCat-ID: 2145
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
LibreCat
| DOI
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
2000 | Conference Paper | LibreCat-ID: 2146 | 
Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat
| Files available
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
2000 | Conference Paper | LibreCat-ID: 2147 |
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.
LibreCat
| Files available
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.
2000 | Journal Article | LibreCat-ID: 2148
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
LibreCat
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
2000 | Conference Paper | LibreCat-ID: 2149 |
Efficient, distributed data placement strategies for storage area networks (extended abstract)
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
LibreCat
| Files available
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
2000 | Conference Paper | LibreCat-ID: 2150 |
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.
LibreCat
| Files available
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.
2000 | Conference Paper | LibreCat-ID: 2211 |
A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat
| Files available
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
1999 | Journal Article | LibreCat-ID: 2151
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
LibreCat
| DOI
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
1999 | Conference Paper | LibreCat-ID: 2164 |
Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
LibreCat
| Files available
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
1999 | Conference Paper | LibreCat-ID: 2165 |
Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
LibreCat
| Files available
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
1999 | Conference Paper | LibreCat-ID: 2210 |
Design of the PRESTO Multimedia Storage Network (Extended Abstract)
P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat
| Files available
P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
1999 | Conference Paper | LibreCat-ID: 2166 |
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
LibreCat
| Files available
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
1998 | Journal Article | LibreCat-ID: 2168
Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
LibreCat
| DOI
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
1998 | Conference Paper | LibreCat-ID: 2169 |
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
LibreCat
| Files available
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
1998 | Conference Paper | LibreCat-ID: 2170 |
Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
LibreCat
| Files available
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
1998 | Book | LibreCat-ID: 2185
Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
LibreCat
| DOI
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
1997 | Conference Paper | LibreCat-ID: 2175 |
Optimal Wormhole Routing in the (n, d)-Torus
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat
| Files available
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
1997 | Conference Paper | LibreCat-ID: 2179 |
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
LibreCat
| Files available
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
1996 | Dissertation | LibreCat-ID: 2181
Universal routing strategies
C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.
LibreCat
C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.
1996 | Journal Article | LibreCat-ID: 2182
Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.
LibreCat
| DOI
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.