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 -