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