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.
301 Publications
2007 | Conference (Editor) | LibreCat-ID: 2025
Aspnes, James, et al., editors. Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings. Vol. 4549, 2007, doi:10.1007/978-3-540-73090-3.
LibreCat
| DOI
2007 | Conference (Editor) | LibreCat-ID: 2027
B. Gibbons, Phillip, and Christian Scheideler, editors. SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007. ACM, 2007.
LibreCat
2007 | Book Chapter | LibreCat-ID: 2028
W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” Handbook of Approximation Algorithms and Metaheuristics., 2007, doi:10.1201/9781420010749.ch72.
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 2214 | 
Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
LibreCat
| Files available
2007 | Journal Article | LibreCat-ID: 2209
Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.
LibreCat
| DOI
2006 | Journal Article | LibreCat-ID: 2029
Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.
LibreCat
| DOI
2006 | Journal Article | LibreCat-ID: 2110
Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.
LibreCat
| DOI
2006 | Conference Paper | LibreCat-ID: 2111 |
Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” IPDPS, 2006.
LibreCat
| Files available
2006 | Conference Paper | LibreCat-ID: 2112 |
Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.
LibreCat
| Files available
2006 | Conference Paper | LibreCat-ID: 2113 |
Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” SPAA, 2006, pp. 318--327.
LibreCat
| Files available
2006 | Journal Article | LibreCat-ID: 2043
Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.
LibreCat
| DOI
2006 | Conference Paper | LibreCat-ID: 2213 |
Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.
LibreCat
| Files available
2005 | Conference Paper | LibreCat-ID: 2114 |
Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN, 2005, pp. 182--187.
LibreCat
| Files available
2005 | Conference Paper | LibreCat-ID: 2115 |
Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” ISPAN, 2005, pp. 188--193.
LibreCat
| Files available
2005 | Conference Paper | LibreCat-ID: 2116 |
Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” ISPAN, 2005, pp. 346--351.
LibreCat
| Files available
2005 | Conference Paper | LibreCat-ID: 2117 |
Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” SPAA, 2005, pp. 116--125.
LibreCat
| Files available
2005 | Conference Paper | LibreCat-ID: 2118 |
Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC, 2005, pp. 704--713.
LibreCat
| Files available
2005 | Conference Paper | LibreCat-ID: 2212 |
Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA Workshop on Wireless Communications, 2005.
LibreCat
| Files available
2004 | Journal Article | LibreCat-ID: 2119
Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3, 2004, pp. 209--233, doi:10.1007/s00453-004-1086-1.
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 2120 |
Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp. 183--195.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2121 |
Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2122 |
Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2123 |
Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2124 |
Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2125 |
Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2126 |
Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2127 |
Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293.
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
2003 | Conference Paper | LibreCat-ID: 2133 |
Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.
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
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
2000 | Journal Article | LibreCat-ID: 2143
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2145
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 |
Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.
LibreCat
| Files available
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