@inproceedings{2129, author = {{Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}}, booktitle = {{ICALP}}, pages = {{1153----1168}}, publisher = {{Springer}}, title = {{{Anycasting in Adversarial Systems: Routing and Admission Control}}}, volume = {{2719}}, year = {{2003}}, } @inproceedings{2130, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{PODC}}, pages = {{123----132}}, publisher = {{ACM}}, title = {{{Peer-to-peer systems for prefix search}}}, year = {{2003}}, } @inproceedings{2131, author = {{Czumaj, Artur and Riley, Chris and Scheideler, Christian}}, booktitle = {{RANDOM-APPROX}}, pages = {{240----251}}, publisher = {{Springer}}, title = {{{Perfectly Balanced Allocation}}}, volume = {{2764}}, year = {{2003}}, } @inproceedings{2132, author = {{Jia, Lujun and Rajaraman, Rajmohan and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{220----229}}, publisher = {{ACM}}, title = {{{On local algorithms for topology control and routing in ad hoc networks}}}, year = {{2003}}, } @inproceedings{2133, author = {{Kothapalli, Kishore and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{333----342}}, publisher = {{ACM}}, title = {{{Information gathering in adversarial systems: lines and cycles}}}, year = {{2003}}, } @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}}, } @inproceedings{2135, author = {{Kolman, Petr and Scheideler, Christian}}, booktitle = {{SODA}}, pages = {{184----193}}, publisher = {{ACM/SIAM}}, title = {{{Improved bounds for the unsplittable flow problem}}}, year = {{2002}}, } @inproceedings{2136, author = {{Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{53----62}}, title = {{{Compact, adaptive placement schemes for non-uniform requirements}}}, year = {{2002}}, } @inproceedings{2137, author = {{Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}}, booktitle = {{SPAA}}, pages = {{265----274}}, title = {{{Algorithms for fault-tolerant routing in circuit switched networks}}}, year = {{2002}}, } @inproceedings{2138, author = {{Scheideler, Christian}}, booktitle = {{STACS}}, pages = {{27----49}}, publisher = {{Springer}}, title = {{{Models and Techniques for Communication in Dynamic Networks}}}, volume = {{2285}}, year = {{2002}}, } @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{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{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{2168, author = {{Scheideler, Christian and Vöcking, Berthold}}, journal = {{Theory Comput. Syst.}}, number = {{4}}, pages = {{425----449}}, title = {{{Universal Continuous Routing Strategies}}}, doi = {{10.1007/s002240000096}}, volume = {{31}}, year = {{1998}}, } @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}}, } @inproceedings{2175, author = {{Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{IPPS}}, pages = {{326----332}}, publisher = {{IEEE Computer Society}}, title = {{{Optimal Wormhole Routing in the (n, d)-Torus}}}, year = {{1997}}, } @inproceedings{2179, author = {{Flammini, Michele and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{170----179}}, title = {{{Simple, Efficient Routing Schemes for All-Optical Networks}}}, year = {{1997}}, } @article{2182, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}}, journal = {{Theor. Comput. Sci.}}, number = {{2}}, pages = {{245----281}}, title = {{{Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}}}, doi = {{10.1016/0304-3975(96)00032-1}}, year = {{1996}}, } @inproceedings{2183, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{FOCS}}, pages = {{370----379}}, title = {{{Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols}}}, year = {{1996}}, } @inproceedings{2184, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{SOFSEM}}, pages = {{16----33}}, publisher = {{Springer}}, title = {{{Communication in Parallel Systems}}}, volume = {{1175}}, year = {{1996}}, } @inproceedings{2186, author = {{Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Vöcking, Berthold}}, booktitle = {{STOC}}, pages = {{356----365}}, publisher = {{ACM}}, title = {{{Universal Algorithms for Store-and-Forward and Wormhole Routing}}}, year = {{1996}}, } @inproceedings{2187, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{ESA}}, pages = {{341----354}}, title = {{{Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks}}}, doi = {{10.1007/3-540-60313-1_154}}, year = {{1995}}, } @inproceedings{2207, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{137----146}}, title = {{{Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)}}}, year = {{1995}}, } @inproceedings{2208, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}}, booktitle = {{STACS}}, pages = {{267----278}}, title = {{{Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations}}}, year = {{1995}}, }