Christian Scheideler

christian.scheideler@uni-paderborn.de
ID
20792

234 Publications

Mark all

[234]
2002 | Conference Paper | LibreCat-ID: 2135 | OA
Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.
LibreCat | Files available
 
[233]
2002 | Conference Paper | LibreCat-ID: 2136 | OA
Compact, adaptive placement schemes for non-uniform requirements
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.
LibreCat | Files available
 
[232]
2002 | Conference Paper | LibreCat-ID: 2137 | OA
Algorithms for fault-tolerant routing in circuit switched networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.
LibreCat | Files available
 
[231]
2002 | Conference Paper | LibreCat-ID: 2138 | OA
Models and Techniques for Communication in Dynamic Networks
C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.
LibreCat | Files available
 
[230]
2001 | Journal Article | LibreCat-ID: 2139
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
LibreCat | DOI
 
[229]
2001 | Conference Paper | LibreCat-ID: 2140 | OA
Simple Routing Strategies for Adversarial Systems
B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.
LibreCat | Files available
 
[228]
2001 | Conference Paper | LibreCat-ID: 2141 | OA
SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat | Files available
 
[227]
2001 | Conference Paper | LibreCat-ID: 2142 | OA
Simple on-line algorithms for the maximum disjoint paths problem
P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.
LibreCat | Files available
 
[226]
2000 | Journal Article | LibreCat-ID: 2143
Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
LibreCat | DOI
 
[225]
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
 
[224]
2000 | Conference Paper | LibreCat-ID: 2146 | OA
Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat | Files available
 
[223]
2000 | Conference Paper | LibreCat-ID: 2147 | OA
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
 
[222]
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
 
[221]
2000 | Conference Paper | LibreCat-ID: 2149 | OA
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
 
[220]
2000 | Conference Paper | LibreCat-ID: 2150 | OA
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
 
[219]
2000 | Conference Paper | LibreCat-ID: 2211 | OA
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
 
[218]
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
 
[217]
1999 | Conference Paper | LibreCat-ID: 2164 | OA
Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
LibreCat | Files available
 
[216]
1999 | Conference Paper | LibreCat-ID: 2165 | OA
Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
LibreCat | Files available
 
[215]
1999 | Conference Paper | LibreCat-ID: 2210 | OA
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
 
[214]
1999 | Conference Paper | LibreCat-ID: 2166 | OA
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
 
[213]
1998 | Journal Article | LibreCat-ID: 2168
Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
LibreCat | DOI
 
[212]
1998 | Conference Paper | LibreCat-ID: 2169 | OA
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
LibreCat | Files available
 
[211]
1998 | Conference Paper | LibreCat-ID: 2170 | OA
Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
LibreCat | Files available
 
[210]
1998 | Book | LibreCat-ID: 2185
Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
LibreCat | DOI
 
[209]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
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
 
[208]
1997 | Conference Paper | LibreCat-ID: 2179 | OA
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
LibreCat | Files available
 
[207]
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
 
[206]
1996 | Conference Paper | LibreCat-ID: 2183 | OA
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
LibreCat | Files available
 
[205]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Communication in Parallel Systems
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
LibreCat | Files available
 
[204]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Universal Algorithms for Store-and-Forward and Wormhole Routing
R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.
LibreCat | Files available
 
[203]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.
LibreCat | Files available | DOI
 
[202]
1995 | Conference Paper | LibreCat-ID: 2207 | OA
Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
LibreCat | Files available
 
[201]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.
LibreCat | Files available
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

234 Publications

Mark all

[234]
2002 | Conference Paper | LibreCat-ID: 2135 | OA
Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.
LibreCat | Files available
 
[233]
2002 | Conference Paper | LibreCat-ID: 2136 | OA
Compact, adaptive placement schemes for non-uniform requirements
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.
LibreCat | Files available
 
[232]
2002 | Conference Paper | LibreCat-ID: 2137 | OA
Algorithms for fault-tolerant routing in circuit switched networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.
LibreCat | Files available
 
[231]
2002 | Conference Paper | LibreCat-ID: 2138 | OA
Models and Techniques for Communication in Dynamic Networks
C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.
LibreCat | Files available
 
[230]
2001 | Journal Article | LibreCat-ID: 2139
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
LibreCat | DOI
 
[229]
2001 | Conference Paper | LibreCat-ID: 2140 | OA
Simple Routing Strategies for Adversarial Systems
B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.
LibreCat | Files available
 
[228]
2001 | Conference Paper | LibreCat-ID: 2141 | OA
SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat | Files available
 
[227]
2001 | Conference Paper | LibreCat-ID: 2142 | OA
Simple on-line algorithms for the maximum disjoint paths problem
P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.
LibreCat | Files available
 
[226]
2000 | Journal Article | LibreCat-ID: 2143
Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
LibreCat | DOI
 
[225]
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
 
[224]
2000 | Conference Paper | LibreCat-ID: 2146 | OA
Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat | Files available
 
[223]
2000 | Conference Paper | LibreCat-ID: 2147 | OA
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
 
[222]
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
 
[221]
2000 | Conference Paper | LibreCat-ID: 2149 | OA
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
 
[220]
2000 | Conference Paper | LibreCat-ID: 2150 | OA
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
 
[219]
2000 | Conference Paper | LibreCat-ID: 2211 | OA
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
 
[218]
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
 
[217]
1999 | Conference Paper | LibreCat-ID: 2164 | OA
Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
LibreCat | Files available
 
[216]
1999 | Conference Paper | LibreCat-ID: 2165 | OA
Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
LibreCat | Files available
 
[215]
1999 | Conference Paper | LibreCat-ID: 2210 | OA
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
 
[214]
1999 | Conference Paper | LibreCat-ID: 2166 | OA
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
 
[213]
1998 | Journal Article | LibreCat-ID: 2168
Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
LibreCat | DOI
 
[212]
1998 | Conference Paper | LibreCat-ID: 2169 | OA
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
LibreCat | Files available
 
[211]
1998 | Conference Paper | LibreCat-ID: 2170 | OA
Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
LibreCat | Files available
 
[210]
1998 | Book | LibreCat-ID: 2185
Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
LibreCat | DOI
 
[209]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
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
 
[208]
1997 | Conference Paper | LibreCat-ID: 2179 | OA
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
LibreCat | Files available
 
[207]
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
 
[206]
1996 | Conference Paper | LibreCat-ID: 2183 | OA
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
LibreCat | Files available
 
[205]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Communication in Parallel Systems
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
LibreCat | Files available
 
[204]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Universal Algorithms for Store-and-Forward and Wormhole Routing
R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.
LibreCat | Files available
 
[203]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.
LibreCat | Files available | DOI
 
[202]
1995 | Conference Paper | LibreCat-ID: 2207 | OA
Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
LibreCat | Files available
 
[201]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.
LibreCat | Files available
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed