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


2008 | Conference Paper | LibreCat-ID: 1940 | OA
Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.
LibreCat | Files available
 

2008 | Conference Paper | LibreCat-ID: 1941
Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.” Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.
LibreCat | DOI
 

2008 | Book Chapter | LibreCat-ID: 1942
Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236, doi:10.1007/978-3-540-76394-9_22.
LibreCat | DOI
 

2008 | Conference (Editor) | LibreCat-ID: 1943
Hegering, Heinz-Gerd, et al., editors. INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland. Vol. 133, 2008.
LibreCat
 

2008 | Book | LibreCat-ID: 1945
Vöcking, Berthold, et al. Taschenbuch Der Algorithmen. 2008.
LibreCat | Download (ext.)
 

2007 | Journal Article | LibreCat-ID: 2017
Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” SIAM J. Discrete Math., no. 1, 2007, pp. 141--157, doi:10.1137/S0895480102419743.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 2020
Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.” Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007, doi:10.1137/1.9781611972870.10.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 2022 | OA
Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
LibreCat | Files available
 

2007 | Conference Paper | LibreCat-ID: 2023 | OA
Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178.
LibreCat | Files available | DOI
 

2007 | Conference Paper | LibreCat-ID: 2024
Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp. 33--47, doi:10.1007/978-3-540-75142-7_6.
LibreCat | DOI
 

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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” ISPAN, 2005, pp. 188--193.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2116 | OA
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 | OA
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 | OA
Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC, 2005, pp. 704--713.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2212 | OA
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 | OA
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 | OA
Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2122 | OA
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 | OA
Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 2124 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2147 | OA
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 | OA
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 | OA
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 | OA
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
 

1999 | Journal Article | LibreCat-ID: 2151
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 2164 | OA
Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2165 | OA
Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2210 | OA
Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2166 | OA
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224.
LibreCat | Files available
 

1998 | Journal Article | LibreCat-ID: 2168
Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 2169 | OA
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.
LibreCat | Files available
 

1998 | Conference Paper | LibreCat-ID: 2170 | OA
Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.
LibreCat | Files available
 

1998 | Book | LibreCat-ID: 2185
Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 2175 | OA
Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 2179 | OA
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179.
LibreCat | Files available
 

1996 | Dissertation | LibreCat-ID: 2181
Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.
LibreCat
 

1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
LibreCat | DOI
 

1996 | Conference Paper | LibreCat-ID: 2183 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.
LibreCat | Files available
 

1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.
LibreCat | Files available
 

1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.
LibreCat | Files available | DOI
 

1995 | Conference Paper | LibreCat-ID: 2207 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.
LibreCat | Files available
 

1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
LibreCat | Files available
 

1985 | Journal Article | LibreCat-ID: 21607
Raggam, J., et al. “Radargrammetric Aspects of SAR Data Evaluation.” Thematic Applications of SAR Data, 1985, p. 57.
LibreCat
 

Filters and Search Terms

department=79

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed