Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

301 Publications


2003 | Conference Paper | LibreCat-ID: 2130 | OA
Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 2131 | OA
Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 2132 | OA
Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 2133 | OA
Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.
LibreCat | Files available
 

2002 | Journal Article | LibreCat-ID: 2134
Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 2135 | OA
Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2136 | OA
Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2137 | OA
Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2138 | OA
Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.
LibreCat | Files available
 

2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 2140 | OA
Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 2141 | OA
Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 2142 | OA
Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).
LibreCat | Files available
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

Filters and Search Terms

department=79

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed