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
2004 | Conference Paper | LibreCat-ID: 2121 | 
C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2122 |
B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2123 |
G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in IWIA, 2004, pp. 33--47.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2124 |
B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2125 |
B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in SPAA, 2004, pp. 44--53.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2126 |
A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 2127 |
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The effect of faults on network expansion,” in SPAA, 2004, pp. 286--293.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 19790
C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2129 |
B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2130 |
B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2131 |
A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2132 |
L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2133 |
K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.
LibreCat
| Files available
2002 | Conference Paper | LibreCat-ID: 2135 |
P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193.
LibreCat
| Files available
2002 | Conference Paper | LibreCat-ID: 2136 |
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.
LibreCat
| Files available
2002 | Conference Paper | LibreCat-ID: 2137 |
A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.
LibreCat
| Files available
2002 | Conference Paper | LibreCat-ID: 2138 |
C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 2140 |
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 2141 |
P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 2142 |
P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38--47.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2146 |
P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2211 |
A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2164 |
P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2165 |
P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2210 |
P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2166 |
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.
LibreCat
| Files available
1998 | Conference Paper | LibreCat-ID: 2169 |
M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
LibreCat
| Files available
1998 | Conference Paper | LibreCat-ID: 2170 |
U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 2175 |
S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 2179 |
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.
LibreCat
| Files available
1996 | Dissertation | LibreCat-ID: 2181
C. Scheideler, Universal routing strategies. University of Paderborn, Germany, 1996.
LibreCat
1996 | Conference Paper | LibreCat-ID: 2183 |
F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.
LibreCat
| Files available
1996 | Conference Paper | LibreCat-ID: 2184 |
F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in SOFSEM, 1996, vol. 1175, pp. 16--33.
LibreCat
| Files available
1996 | Conference Paper | LibreCat-ID: 2186 |
R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996, pp. 356--365.
LibreCat
| Files available
1995 | Conference Paper | LibreCat-ID: 2187 |
F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.
LibreCat
| Files available
| DOI
1995 | Conference Paper | LibreCat-ID: 2207 |
F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146.
LibreCat
| Files available
1995 | Conference Paper | LibreCat-ID: 2208 |
F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS, 1995, pp. 267--278.
LibreCat
| Files available