Peer-to-peer systems for prefix search
B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.
LibreCat: /record/2130

Perfectly Balanced Allocation
A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.
LibreCat: /record/2131

On local algorithms for topology control and routing in ad hoc networks
L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.
LibreCat: /record/2132

Information gathering in adversarial systems: lines and cycles
K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.
LibreCat: /record/2133

Improved Bounds for Acyclic Job Shop Scheduling
U. Feige, C. Scheideler, Combinatorica (2002) 361--399.
LibreCat: /record/2134
DOI: 10.1007/s004930200018

Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.
LibreCat: /record/2135

Compact, adaptive placement schemes for non-uniform requirements
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.
LibreCat: /record/2136

Algorithms for fault-tolerant routing in circuit switched networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.
LibreCat: /record/2137

Models and Techniques for Communication in Dynamic Networks
C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.
LibreCat: /record/2138

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
LibreCat: /record/2139
DOI: 10.1007/s004930170007

Simple Routing Strategies for Adversarial Systems
B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.
LibreCat: /record/2140

SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat: /record/2141

Simple on-line algorithms for the maximum disjoint paths problem
P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.
LibreCat: /record/2142

Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
LibreCat: /record/2143
DOI: 10.1007/s002240010006

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: /record/2145
DOI: 10.1137/S0097539799353431

Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat: /record/2146

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: /record/2147

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: /record/2148

Efficient, distributed data placement strategies for storage area networks (extended abstract)
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
LibreCat: /record/2149

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: /record/2150

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: /record/2211

Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
LibreCat: /record/2164

Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
LibreCat: /record/2165

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: /record/2210

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
LibreCat: /record/2166

Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
LibreCat: /record/2168
DOI: 10.1007/s002240000096

Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
LibreCat: /record/2169

Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
LibreCat: /record/2170

Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
LibreCat: /record/2185
DOI: 10.1007/BFb0052928

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: /record/2175

Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
LibreCat: /record/2179

Universal routing strategies
C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.
LibreCat: /record/2181

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: /record/2182
DOI: 10.1016/0304-3975(96)00032-1

Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
LibreCat: /record/2183

Communication in Parallel Systems
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
LibreCat: /record/2184

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: /record/2186

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: /record/2187
DOI: 10.1007/3-540-60313-1_154

Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
LibreCat: /record/2207

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: /record/2208

Radargrammetric aspects of SAR data evaluation
J. Raggam, G. Triebnig, M. Buchroithner, G. Domik, F. Leberl, Thematic Applications of SAR Data (1985) 57.
LibreCat: /record/21607