TY - JOUR AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2139 IS - 1 JF - Combinatorica TI - Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols VL - 21 ER - TY - CONF AU - Awerbuch, Baruch AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2140 T2 - FOCS TI - Simple Routing Strategies for Adversarial Systems ER - TY - CONF AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2141 T2 - PDP TI - SIMLAB-A Simulation Environment for Storage Area Networks ER - TY - CONF AU - Kolman, Petr AU - Scheideler, Christian ID - 2142 T2 - SPAA TI - Simple on-line algorithms for the maximum disjoint paths problem ER - TY - JOUR AU - Adler, Micah AU - Scheideler, Christian ID - 2143 IS - 5/6 JF - Theory Comput. Syst. TI - Efficient Communication Strategies for Ad Hoc Wireless Networks VL - 33 ER - TY - JOUR AU - Scheideler, Christian AU - Vöcking, Berthold ID - 2145 IS - 4 JF - SIAM J. Comput. TI - From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols VL - 30 ER - TY - CONF AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2146 T2 - PDPTA TI - Distributed Path Selection for Storage Networks ER - TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2147 T2 - SODA TI - Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma ER - TY - JOUR AU - Czumaj, Artur AU - Scheideler, Christian ID - 2148 IS - 3-4 JF - Random Struct. Algorithms TI - Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma VL - 17 ER - TY - CONF AU - Brinkmann, André AU - Salzwedel, Kay AU - Scheideler, Christian ID - 2149 T2 - SPAA TI - Efficient, distributed data placement strategies for storage area networks (extended abstract) ER - TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2150 T2 - STOC TI - A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) ER - TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2211 T2 - 32nd ACM Symposium on Theory of Computing TI - A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ER - TY - JOUR AU - Flammini, Michele AU - Scheideler, Christian ID - 2151 IS - 3 JF - Theory Comput. Syst. TI - Simple, Efficient Routing Schemes for All-Optical Networks VL - 32 ER - TY - CONF AU - Berenbrink, Petra AU - Scheideler, Christian ID - 2164 T2 - SODA TI - Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths ER - TY - CONF AU - Berenbrink, Petra AU - Riedel, Marco AU - Scheideler, Christian ID - 2165 T2 - SPAA TI - Simple Competitive Request Scheduling Strategies ER - TY - CONF AU - Berenbrink, Petra AU - Riedel, Marco AU - Scheideler, Christian ID - 2210 T2 - International Workshop on Communication and Data Management in Large Networks (CDMLarge) TI - Design of the PRESTO Multimedia Storage Network (Extended Abstract) ER - TY - CONF AU - Scheideler, Christian AU - Vöcking, Berthold ID - 2166 T2 - STOC TI - From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols ER - TY - JOUR AU - Scheideler, Christian AU - Vöcking, Berthold ID - 2168 IS - 4 JF - Theory Comput. Syst. TI - Universal Continuous Routing Strategies VL - 31 ER - TY - CONF AU - Adler, Micah AU - Scheideler, Christian ID - 2169 T2 - SPAA TI - Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract) ER - TY - CONF AU - Feige, Uriel AU - Scheideler, Christian ID - 2170 T2 - STOC TI - Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract) ER - TY - CONF AU - Bock, Stefan AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2175 T2 - IPPS TI - Optimal Wormhole Routing in the (n, d)-Torus ER - TY - CONF AU - Flammini, Michele AU - Scheideler, Christian ID - 2179 T2 - SPAA TI - Simple, Efficient Routing Schemes for All-Optical Networks ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian AU - Stemann, Volker ID - 2182 IS - 2 JF - Theor. Comput. Sci. TI - Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations ER - TY - CONF AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2183 T2 - FOCS TI - Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols ER - TY - CONF AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2184 T2 - SOFSEM TI - Communication in Parallel Systems VL - 1175 ER - TY - CONF AU - Cypher, Robert AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian AU - Vöcking, Berthold ID - 2186 T2 - STOC TI - Universal Algorithms for Store-and-Forward and Wormhole Routing ER - TY - CONF AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2187 T2 - ESA TI - Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks ER - TY - CONF AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2207 T2 - SPAA TI - Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract) ER - TY - CONF AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian AU - Stemann, Volker ID - 2208 T2 - STACS TI - Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations ER -