Christian Scheideler

christian.scheideler@uni-paderborn.de
ID
20792

226 Publications

Mark all

[226]
2000 | Journal Article | LibreCat-ID: 2143
Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006
LibreCat | DOI
 
[225]
2000 | Journal Article | LibreCat-ID: 2145
Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431
LibreCat | DOI
 
[224]
2000 | Conference Paper | LibreCat-ID: 2146 | OA
Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.
LibreCat | Files available
 
[223]
2000 | Conference Paper | LibreCat-ID: 2147 | OA
Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).
LibreCat | Files available
 
[222]
2000 | Journal Article | LibreCat-ID: 2148
Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.
LibreCat
 
[221]
2000 | Conference Paper | LibreCat-ID: 2149 | OA
Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).
LibreCat | Files available
 
[220]
2000 | Conference Paper | LibreCat-ID: 2150 | OA
Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.
LibreCat | Files available
 
[219]
2000 | Conference Paper | LibreCat-ID: 2211 | OA
Czumaj, A., & Scheideler, C. (2000). 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 (pp. 38–47).
LibreCat | Files available
 
[218]
1999 | Journal Article | LibreCat-ID: 2151
Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420. https://doi.org/10.1007/s002240000123
LibreCat | DOI
 
[217]
1999 | Conference Paper | LibreCat-ID: 2164 | OA
Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
LibreCat | Files available
 
[216]
1999 | Conference Paper | LibreCat-ID: 2165 | OA
Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).
LibreCat | Files available
 
[215]
1999 | Conference Paper | LibreCat-ID: 2210 | OA
Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
LibreCat | Files available
 
[214]
1999 | Conference Paper | LibreCat-ID: 2166 | OA
Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).
LibreCat | Files available
 
[213]
1998 | Journal Article | LibreCat-ID: 2168
Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096
LibreCat | DOI
 
[212]
1998 | Conference Paper | LibreCat-ID: 2169 | OA
Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).
LibreCat | Files available
 
[211]
1998 | Conference Paper | LibreCat-ID: 2170 | OA
Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).
LibreCat | Files available
 
[210]
1998 | Book | LibreCat-ID: 2185
Scheideler, C. (1998). Universal Routing Strategies for Interconnection Networks (Vol. 1390). https://doi.org/10.1007/BFb0052928
LibreCat | DOI
 
[209]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.
LibreCat | Files available
 
[208]
1997 | Conference Paper | LibreCat-ID: 2179 | OA
Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).
LibreCat | Files available
 
[207]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
LibreCat | DOI
 
[206]
1996 | Conference Paper | LibreCat-ID: 2183 | OA
Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).
LibreCat | Files available
 
[205]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.
LibreCat | Files available
 
[204]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.
LibreCat | Files available
 
[203]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354). https://doi.org/10.1007/3-540-60313-1_154
LibreCat | Files available | DOI
 
[202]
1995 | Conference Paper | LibreCat-ID: 2207 | OA
Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).
LibreCat | Files available
 
[201]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).
LibreCat | Files available
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

226 Publications

Mark all

[226]
2000 | Journal Article | LibreCat-ID: 2143
Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006
LibreCat | DOI
 
[225]
2000 | Journal Article | LibreCat-ID: 2145
Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431
LibreCat | DOI
 
[224]
2000 | Conference Paper | LibreCat-ID: 2146 | OA
Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.
LibreCat | Files available
 
[223]
2000 | Conference Paper | LibreCat-ID: 2147 | OA
Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).
LibreCat | Files available
 
[222]
2000 | Journal Article | LibreCat-ID: 2148
Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.
LibreCat
 
[221]
2000 | Conference Paper | LibreCat-ID: 2149 | OA
Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).
LibreCat | Files available
 
[220]
2000 | Conference Paper | LibreCat-ID: 2150 | OA
Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.
LibreCat | Files available
 
[219]
2000 | Conference Paper | LibreCat-ID: 2211 | OA
Czumaj, A., & Scheideler, C. (2000). 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 (pp. 38–47).
LibreCat | Files available
 
[218]
1999 | Journal Article | LibreCat-ID: 2151
Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420. https://doi.org/10.1007/s002240000123
LibreCat | DOI
 
[217]
1999 | Conference Paper | LibreCat-ID: 2164 | OA
Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
LibreCat | Files available
 
[216]
1999 | Conference Paper | LibreCat-ID: 2165 | OA
Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).
LibreCat | Files available
 
[215]
1999 | Conference Paper | LibreCat-ID: 2210 | OA
Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
LibreCat | Files available
 
[214]
1999 | Conference Paper | LibreCat-ID: 2166 | OA
Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).
LibreCat | Files available
 
[213]
1998 | Journal Article | LibreCat-ID: 2168
Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096
LibreCat | DOI
 
[212]
1998 | Conference Paper | LibreCat-ID: 2169 | OA
Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).
LibreCat | Files available
 
[211]
1998 | Conference Paper | LibreCat-ID: 2170 | OA
Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).
LibreCat | Files available
 
[210]
1998 | Book | LibreCat-ID: 2185
Scheideler, C. (1998). Universal Routing Strategies for Interconnection Networks (Vol. 1390). https://doi.org/10.1007/BFb0052928
LibreCat | DOI
 
[209]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.
LibreCat | Files available
 
[208]
1997 | Conference Paper | LibreCat-ID: 2179 | OA
Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).
LibreCat | Files available
 
[207]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
LibreCat | DOI
 
[206]
1996 | Conference Paper | LibreCat-ID: 2183 | OA
Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).
LibreCat | Files available
 
[205]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.
LibreCat | Files available
 
[204]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.
LibreCat | Files available
 
[203]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354). https://doi.org/10.1007/3-540-60313-1_154
LibreCat | Files available | DOI
 
[202]
1995 | Conference Paper | LibreCat-ID: 2207 | OA
Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).
LibreCat | Files available
 
[201]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).
LibreCat | Files available
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed