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 - 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 - Feige, Uriel AU - Scheideler, Christian ID - 2134 IS - 3 JF - Combinatorica TI - Improved Bounds for Acyclic Job Shop Scheduling ER - TY - CONF AU - Kolman, Petr AU - Scheideler, Christian ID - 2135 T2 - SODA TI - Improved bounds for the unsplittable flow problem ER - TY - CONF AU - Brinkmann, André AU - Salzwedel, Kay AU - Scheideler, Christian ID - 2136 T2 - SPAA TI - Compact, adaptive placement schemes for non-uniform requirements ER - TY - CONF AU - Bagchi, Amitabha AU - Chaudhary, Amitabh AU - Scheideler, Christian AU - Kolman, Petr ID - 2137 T2 - SPAA TI - Algorithms for fault-tolerant routing in circuit switched networks ER - TY - CONF AU - Scheideler, Christian ID - 2138 T2 - STACS TI - Models and Techniques for Communication in Dynamic Networks VL - 2285 ER - TY - CONF AB - The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure. AU - Scheideler, Christian AU - Salzwedel, Kay AU - Meyer auf der Heide, Friedhelm AU - Brinkmann, André AU - Vodisek, Mario AU - Rückert, Ulrich ID - 19790 T2 - Proceedings of SSGRR 2003 TI - Storage Management as Means to cope with Exponential Information Growth ER - TY - CONF AU - Damerow, Valentina AU - Meyer auf der Heide, Friedhelm AU - Räcke, Harald AU - Scheideler, Christian AU - Sohler, Christian ID - 2128 T2 - ESA TI - Smoothed Motion Complexity VL - 2832 ER - TY - CONF AU - Awerbuch, Baruch AU - Brinkmann, André AU - Scheideler, Christian ID - 2129 T2 - ICALP TI - Anycasting in Adversarial Systems: Routing and Admission Control VL - 2719 ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2130 T2 - PODC TI - Peer-to-peer systems for prefix search ER - TY - CONF AU - Czumaj, Artur AU - Riley, Chris AU - Scheideler, Christian ID - 2131 T2 - RANDOM-APPROX TI - Perfectly Balanced Allocation VL - 2764 ER - TY - CONF AU - Jia, Lujun AU - Rajaraman, Rajmohan AU - Scheideler, Christian ID - 2132 T2 - SPAA TI - On local algorithms for topology control and routing in ad hoc networks ER -