Christian Scheideler

christian.scheideler@uni-paderborn.de
ID
20792

226 Publications

Mark all

[226]
2000 | Journal Article | LibreCat-ID: 2143
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000): 337--391. https://doi.org/10.1007/s002240010006.
LibreCat | DOI
 
[225]
2000 | Journal Article | LibreCat-ID: 2145
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.
LibreCat | DOI
 
[224]
2000 | Conference Paper | LibreCat-ID: 2146 | OA
Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.
LibreCat | Files available
 
[223]
2000 | Conference Paper | LibreCat-ID: 2147 | OA
Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.
LibreCat | Files available
 
[222]
2000 | Journal Article | LibreCat-ID: 2148
Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.
LibreCat
 
[221]
2000 | Conference Paper | LibreCat-ID: 2149 | OA
Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.
LibreCat | Files available
 
[220]
2000 | Conference Paper | LibreCat-ID: 2150 | OA
Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.
LibreCat | Files available
 
[219]
2000 | Conference Paper | LibreCat-ID: 2211 | OA
Czumaj, Artur, and Christian 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, 38–47, 2000.
LibreCat | Files available
 
[218]
1999 | Journal Article | LibreCat-ID: 2151
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999): 387--420. https://doi.org/10.1007/s002240000123.
LibreCat | DOI
 
[217]
1999 | Conference Paper | LibreCat-ID: 2164 | OA
Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
LibreCat | Files available
 
[216]
1999 | Conference Paper | LibreCat-ID: 2165 | OA
Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.
LibreCat | Files available
 
[215]
1999 | Conference Paper | LibreCat-ID: 2210 | OA
Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
LibreCat | Files available
 
[214]
1999 | Conference Paper | LibreCat-ID: 2166 | OA
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.
LibreCat | Files available
 
[213]
1998 | Journal Article | LibreCat-ID: 2168
Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.
LibreCat | DOI
 
[212]
1998 | Conference Paper | LibreCat-ID: 2169 | OA
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
LibreCat | Files available
 
[211]
1998 | Conference Paper | LibreCat-ID: 2170 | OA
Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
LibreCat | Files available
 
[210]
1998 | Book | LibreCat-ID: 2185
Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998. https://doi.org/10.1007/BFb0052928.
LibreCat | DOI
 
[209]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.
LibreCat | Files available
 
[208]
1997 | Conference Paper | LibreCat-ID: 2179 | OA
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.
LibreCat | Files available
 
[207]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2 (1996): 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, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.
LibreCat | Files available
 
[205]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.
LibreCat | Files available
 
[204]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996.
LibreCat | Files available
 
[203]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In ESA, 341--354. Lecture Notes in Computer Science, 1995. 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, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.
LibreCat | Files available
 
[201]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.
LibreCat | Files available
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

226 Publications

Mark all

[226]
2000 | Journal Article | LibreCat-ID: 2143
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000): 337--391. https://doi.org/10.1007/s002240010006.
LibreCat | DOI
 
[225]
2000 | Journal Article | LibreCat-ID: 2145
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.
LibreCat | DOI
 
[224]
2000 | Conference Paper | LibreCat-ID: 2146 | OA
Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.
LibreCat | Files available
 
[223]
2000 | Conference Paper | LibreCat-ID: 2147 | OA
Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.
LibreCat | Files available
 
[222]
2000 | Journal Article | LibreCat-ID: 2148
Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.
LibreCat
 
[221]
2000 | Conference Paper | LibreCat-ID: 2149 | OA
Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.
LibreCat | Files available
 
[220]
2000 | Conference Paper | LibreCat-ID: 2150 | OA
Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.
LibreCat | Files available
 
[219]
2000 | Conference Paper | LibreCat-ID: 2211 | OA
Czumaj, Artur, and Christian 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, 38–47, 2000.
LibreCat | Files available
 
[218]
1999 | Journal Article | LibreCat-ID: 2151
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999): 387--420. https://doi.org/10.1007/s002240000123.
LibreCat | DOI
 
[217]
1999 | Conference Paper | LibreCat-ID: 2164 | OA
Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
LibreCat | Files available
 
[216]
1999 | Conference Paper | LibreCat-ID: 2165 | OA
Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.
LibreCat | Files available
 
[215]
1999 | Conference Paper | LibreCat-ID: 2210 | OA
Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
LibreCat | Files available
 
[214]
1999 | Conference Paper | LibreCat-ID: 2166 | OA
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.
LibreCat | Files available
 
[213]
1998 | Journal Article | LibreCat-ID: 2168
Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.
LibreCat | DOI
 
[212]
1998 | Conference Paper | LibreCat-ID: 2169 | OA
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
LibreCat | Files available
 
[211]
1998 | Conference Paper | LibreCat-ID: 2170 | OA
Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
LibreCat | Files available
 
[210]
1998 | Book | LibreCat-ID: 2185
Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998. https://doi.org/10.1007/BFb0052928.
LibreCat | DOI
 
[209]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.
LibreCat | Files available
 
[208]
1997 | Conference Paper | LibreCat-ID: 2179 | OA
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.
LibreCat | Files available
 
[207]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2 (1996): 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, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.
LibreCat | Files available
 
[205]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.
LibreCat | Files available
 
[204]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996.
LibreCat | Files available
 
[203]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In ESA, 341--354. Lecture Notes in Computer Science, 1995. 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, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.
LibreCat | Files available
 
[201]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.
LibreCat | Files available
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed