Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
209 Publications
2000 | Conference Paper | LibreCat-ID: 2147 | 
Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2211 |
Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat
| Files available
2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 2140 |
Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 2141 |
Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 2142 |
Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 2134
Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 2135 |
Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.
LibreCat
| Files available
2002 | Conference Paper | LibreCat-ID: 2136 |
Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.
LibreCat
| Files available
2002 | Conference Paper | LibreCat-ID: 2137 |
Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274.
LibreCat
| Files available
2002 | Conference Paper | LibreCat-ID: 2138 |
Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 19790
Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2128
Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 2129 |
Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2130 |
Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2131 |
Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2132 |
Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.
LibreCat
| Files available
Filters and Search Terms
(author=20792) AND (type=conference_editor OR type=conference OR type=dissertation OR type=mastersthesis OR type=journal_article OR type=journal_editor OR type=preprint OR type=report OR type=working_paper OR type=book_chapter OR type=book_editor OR type=bachelorsthesis OR type=conference_abstract OR type=newspaper_article)