@inproceedings{2169, author = {{Adler, Micah and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{259----268}}, title = {{{Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}}}, year = {{1998}}, } @inproceedings{2170, author = {{Feige, Uriel and Scheideler, Christian}}, booktitle = {{STOC}}, pages = {{624----633}}, title = {{{Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}}}, year = {{1998}}, } @article{2151, author = {{Flammini, Michele and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{3}}, pages = {{387----420}}, title = {{{Simple, Efficient Routing Schemes for All-Optical Networks}}}, doi = {{10.1007/s002240000123}}, volume = {{32}}, year = {{1999}}, } @inproceedings{2164, author = {{Berenbrink, Petra and Scheideler, Christian}}, booktitle = {{SODA}}, pages = {{112----121}}, title = {{{Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}}}, year = {{1999}}, } @inproceedings{2165, author = {{Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{33----42}}, title = {{{Simple Competitive Request Scheduling Strategies}}}, year = {{1999}}, } @inproceedings{2210, author = {{Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}}, booktitle = {{International Workshop on Communication and Data Management in Large Networks (CDMLarge)}}, pages = {{2--12}}, title = {{{Design of the PRESTO Multimedia Storage Network (Extended Abstract)}}}, year = {{1999}}, } @inproceedings{2166, author = {{Scheideler, Christian and Vöcking, Berthold}}, booktitle = {{STOC}}, pages = {{215----224}}, title = {{{From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}}}, year = {{1999}}, } @article{2143, author = {{Adler, Micah and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{5/6}}, pages = {{337----391}}, title = {{{Efficient Communication Strategies for Ad Hoc Wireless Networks}}}, doi = {{10.1007/s002240010006}}, volume = {{33}}, year = {{2000}}, } @article{2145, author = {{Scheideler, Christian and Vöcking, Berthold}}, journal = {{SIAM J. Comput.}}, number = {{4}}, pages = {{1126----1155}}, title = {{{From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}}}, doi = {{10.1137/S0097539799353431}}, volume = {{30}}, year = {{2000}}, } @inproceedings{2146, author = {{Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}}, booktitle = {{PDPTA}}, title = {{{Distributed Path Selection for Storage Networks}}}, year = {{2000}}, } @inproceedings{2147, author = {{Czumaj, Artur and Scheideler, Christian}}, booktitle = {{SODA}}, pages = {{30----39}}, title = {{{Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}}}, year = {{2000}}, } @article{2148, author = {{Czumaj, Artur and Scheideler, Christian}}, journal = {{Random Struct. Algorithms}}, number = {{3-4}}, pages = {{213----237}}, title = {{{Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}}}, volume = {{17}}, year = {{2000}}, } @inproceedings{2149, author = {{Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{119----128}}, title = {{{Efficient, distributed data placement strategies for storage area networks (extended abstract)}}}, year = {{2000}}, } @inproceedings{2150, author = {{Czumaj, Artur and Scheideler, Christian}}, booktitle = {{STOC}}, pages = {{38----47}}, publisher = {{ACM}}, title = {{{A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}}}, year = {{2000}}, } @inproceedings{2211, author = {{Czumaj, Artur and Scheideler, Christian}}, booktitle = {{32nd ACM Symposium on Theory of Computing}}, pages = {{38--47}}, title = {{{A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }}}, year = {{2000}}, } @article{2139, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, journal = {{Combinatorica}}, number = {{1}}, pages = {{95----138}}, title = {{{Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}}}, doi = {{10.1007/s004930170007}}, volume = {{21}}, year = {{2001}}, } @inproceedings{2140, author = {{Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}}, booktitle = {{FOCS}}, pages = {{158----167}}, publisher = {{IEEE Computer Society}}, title = {{{Simple Routing Strategies for Adversarial Systems}}}, year = {{2001}}, } @inproceedings{2141, author = {{Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}}, booktitle = {{PDP}}, pages = {{227----234}}, publisher = {{IEEE Computer Society}}, title = {{{SIMLAB-A Simulation Environment for Storage Area Networks}}}, year = {{2001}}, } @inproceedings{2142, author = {{Kolman, Petr and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{38----47}}, title = {{{Simple on-line algorithms for the maximum disjoint paths problem}}}, year = {{2001}}, } @article{2134, author = {{Feige, Uriel and Scheideler, Christian}}, journal = {{Combinatorica}}, number = {{3}}, pages = {{361----399}}, title = {{{Improved Bounds for Acyclic Job Shop Scheduling}}}, doi = {{10.1007/s004930200018}}, year = {{2002}}, }