| * | 2009 |
|---|
| 78 | EE | Christian Scheideler,
Stefan Schmid:
A Distributed and Oblivious Heap.
ICALP (2) 2009: 571-582 |
| 77 | EE | Riko Jacob,
Andréa W. Richa,
Christian Scheideler,
Stefan Schmid,
Hanjo Täubig:
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
PODC 2009: 131-140 |
| 76 | EE | Matthias Baumgart,
Christian Scheideler,
Stefan Schmid:
A DoS-resilient information system for dynamic data management.
SPAA 2009: 300-309 |
| 75 | EE | Baruch Awerbuch,
Christian Scheideler:
Robust random number generation for peer-to-peer systems.
Theor. Comput. Sci. 410(6-7): 453-466 (2009) |
| 2008 |
|---|
| 74 | | Heinz-Gerd Hegering,
Axel Lehmann,
Hans Jürgen Ohlbach,
Christian Scheideler:
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
GI 2008 |
| 73 | | Heinz-Gerd Hegering,
Axel Lehmann,
Hans Jürgen Ohlbach,
Christian Scheideler:
INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 2, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München
GI 2008 |
| 72 | | Berthold Vöcking,
Helmut Alt,
Martin Dietzfelbinger,
Rüdiger Reischuk,
Christian Scheideler,
Heribert Vollmer,
Dorothea Wagner:
Taschenbuch der Algorithmen
Springer 2008 |
| 71 | EE | Christian Scheideler,
Andréa W. Richa,
Paolo Santi:
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model.
MobiHoc 2008: 91-100 |
| 70 | EE | Baruch Awerbuch,
Andréa W. Richa,
Christian Scheideler:
A jamming-resistant MAC protocol for single-hop wireless networks.
PODC 2008: 45-54 |
| 69 | EE | Mario Mense,
Christian Scheideler:
SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems.
SODA 2008: 1135-1144 |
| 68 | EE | Thomas Clouser,
Mikhail Nesterenko,
Christian Scheideler:
Tiara: A Self-stabilizing Deterministic Skip List.
SSS 2008: 124-140 |
| 67 | EE | Christian Scheideler:
Broadcasting: Wie verbreite ich schnell Informationen?.
Taschenbuch der Algorithmen 2008: 229-236 |
| 2007 |
|---|
| 66 | | Phillip B. Gibbons,
Christian Scheideler:
SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007
ACM 2007 |
| 65 | | James Aspnes,
Christian Scheideler,
Anish Arora,
Samuel Madden:
Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings
Springer 2007 |
| 64 | EE | Melih Onus,
Andréa W. Richa,
Christian Scheideler:
Linearization: Locally Self-Stabilizing Sorting in Graphs.
ALENEX 2007 |
| 63 | EE | Baruch Awerbuch,
Christian Scheideler:
A Denial-of-Service Resistant DHT.
DISC 2007: 33-47 |
| 62 | EE | Baruch Awerbuch,
Christian Scheideler:
A denial-of-service resistant DHT.
PODC 2007: 370-371 |
| 61 | EE | Amitabha Bagchi,
Amitabh Chaudhary,
Christian Scheideler,
Petr Kolman:
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.
SIAM J. Discrete Math. 21(1): 141-157 (2007) |
| 2006 |
|---|
| 60 | EE | Kishore Kothapalli,
Christian Scheideler,
Melih Onus,
Christian Schindelhauer:
Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds.
IPDPS 2006 |
| 59 | EE | Baruch Awerbuch,
Christian Scheideler:
Robust Random Number Generation for Peer-to-Peer Systems.
OPODIS 2006: 275-289 |
| 58 | EE | Baruch Awerbuch,
Christian Scheideler:
Towards a scalable and robust DHT.
SPAA 2006: 318-327 |
| 57 | EE | Giuseppe Ateniese,
Chris Riley,
Christian Scheideler:
Survivable Monitoring in Dynamic Networks.
IEEE Trans. Mob. Comput. 5(9): 1242-1254 (2006) |
| 56 | EE | Petr Kolman,
Christian Scheideler:
Improved bounds for the unsplittable flow problem.
J. Algorithms 61(1): 20-44 (2006) |
| 55 | EE | Amitabha Bagchi,
Ankur Bhargava,
Amitabh Chaudhary,
David Eppstein,
Christian Scheideler:
The Effect of Faults on Network Expansion.
Theory Comput. Syst. 39(6): 903-928 (2006) |
| 2005 |
|---|
| 54 | EE | Miroslaw Korzeniowski,
Christian Scheideler:
Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environmen.
ISPAN 2005: 182-187 |
| 53 | EE | Kishore Kothapalli,
Christian Scheideler:
Supervised Peer-to-Peer Systems.
ISPAN 2005: 188-193 |
| 52 | EE | Melih Onus,
Andréa W. Richa,
Kishore Kothapalli,
Christian Scheideler:
Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.
ISPAN 2005: 346-351 |
| 51 | EE | Kishore Kothapalli,
Christian Scheideler,
Melih Onus,
Andréa W. Richa:
Constant density spanners for wireless ad-hoc networks.
SPAA 2005: 116-125 |
| 50 | EE | Christian Scheideler:
How to spread adversarial nodes?: rotate!
STOC 2005: 704-713 |
| 2004 |
|---|
| 49 | EE | Baruch Awerbuch,
Christian Scheideler:
Group Spreading: A Protocol for Provably Secure Distributed Name Service.
ICALP 2004: 183-195 |
| 48 | EE | Chris Riley,
Christian Scheideler:
A Distributed Hash Table for Computational Grids.
IPDPS 2004 |
| 47 | EE | Baruch Awerbuch,
Christian Scheideler:
Robust Distributed Name Service.
IPTPS 2004: 237-249 |
| 46 | EE | Giuseppe Ateniese,
Chris Riley,
Christian Scheideler:
Survivable Monitoring in Dynamic Networks.
IWIA 2004: 33-47 |
| 45 | EE | Baruch Awerbuch,
Christian Scheideler:
The hyperring: a low-congestion deterministic data structure for distributed environments.
SODA 2004: 318-327 |
| 44 | EE | Ankur Bhargava,
Kishore Kothapalli,
Chris Riley,
Christian Scheideler,
Mark Thober:
Pagoda: a dynamic overlay network for routing, data management, and multicasting.
SPAA 2004: 170-179 |
| 43 | EE | Amitabha Bagchi,
Ankur Bhargava,
Amitabh Chaudhary,
David Eppstein,
Christian Scheideler:
The effect of faults on network expansion.
SPAA 2004: 286-293 |
| 42 | EE | Baruch Awerbuch,
Christian Scheideler:
Consistent and compact data management in distributed storage systems.
SPAA 2004: 44-53 |
| 41 | EE | Petr Kolman,
Christian Scheideler:
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.
Algorithmica 39(3): 209-233 (2004) |
| 40 | EE | Amitabha Bagchi,
Ankur Bhargava,
Amitabh Chaudhary,
David Eppstein,
Christian Scheideler:
The Effect of Faults on Network Expansion
CoRR cs.DC/0404029: (2004) |
| 2003 |
|---|
| 39 | EE | Valentina Damerow,
Friedhelm Meyer auf der Heide,
Harald Räcke,
Christian Scheideler,
Christian Sohler:
Smoothed Motion Complexity.
ESA 2003: 161-171 |
| 38 | EE | Baruch Awerbuch,
André Brinkmann,
Christian Scheideler:
Anycasting in Adversarial Systems: Routing and Admission Control.
ICALP 2003: 1153-1168 |
| 37 | EE | Baruch Awerbuch,
Christian Scheideler:
Peer-to-peer systems for prefix search.
PODC 2003: 123-132 |
| 36 | EE | Artur Czumaj,
Chris Riley,
Christian Scheideler:
Perfectly Balanced Allocation.
RANDOM-APPROX 2003: 240-251 |
| 35 | EE | Lujun Jia,
Rajmohan Rajaraman,
Christian Scheideler:
On local algorithms for topology control and routing in ad hoc networks.
SPAA 2003: 220-229 |
| 34 | EE | Kishore Kothapalli,
Christian Scheideler:
Information gathering in adversarial systems: lines and cycles.
SPAA 2003: 333-342 |
| 2002 |
|---|
| 33 | EE | Petr Kolman,
Christian Scheideler:
Improved bounds for the unsplittable flow problem.
SODA 2002: 184-193 |
| 32 | EE | Amitabha Bagchi,
Amitabh Chaudhary,
Christian Scheideler,
Petr Kolman:
Algorithms for fault-tolerant routing in circuit switched networks.
SPAA 2002: 265-274 |
| 31 | EE | André Brinkmann,
Kay Salzwedel,
Christian Scheideler:
Compact, adaptive placement schemes for non-uniform requirements.
SPAA 2002: 53-62 |
| 30 | EE | Christian Scheideler:
Models and Techniques for Communication in Dynamic Networks.
STACS 2002: 27-49 |
| 29 | EE | Uriel Feige,
Christian Scheideler:
Improved Bounds for Acyclic Job Shop Scheduling.
Combinatorica 22(3): 361-399 (2002) |
| 2001 |
|---|
| 28 | | Baruch Awerbuch,
Petra Berenbrink,
André Brinkmann,
Christian Scheideler:
Simple Routing Strategies for Adversarial Systems.
FOCS 2001: 158-167 |
| 27 | EE | Petr Kolman,
Christian Scheideler:
Simple on-line algorithms for the maximum disjoint paths problem.
SPAA 2001: 38-47 |
| 26 | EE | Friedhelm Meyer auf der Heide,
Christian Scheideler:
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.
Combinatorica 21(1): 95-138 (2001) |
| 2000 |
|---|
| 25 | | Petra Berenbrink,
André Brinkmann,
Christian Scheideler:
Distributed Path Selection for Storage Networks.
PDPTA 2000 |
| 24 | EE | Artur Czumaj,
Christian Scheideler:
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma.
SODA 2000: 30-39 |
| 23 | EE | André Brinkmann,
Kay Salzwedel,
Christian Scheideler:
Efficient, distributed data placement strategies for storage area networks (extended abstract).
SPAA 2000: 119-128 |
| 22 | EE | Artur Czumaj,
Christian Scheideler:
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract).
STOC 2000: 38-47 |
| 21 | | Artur Czumaj,
Christian Scheideler:
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma.
Random Struct. Algorithms 17(3-4): 213-237 (2000) |
| 20 | EE | Christian Scheideler,
Berthold Vöcking:
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.
SIAM J. Comput. 30(4): 1126-1155 (2000) |
| 19 | EE | Micah Adler,
Christian Scheideler:
Efficient Communication Strategies for Ad Hoc Wireless Networks.
Theory Comput. Syst. 33(5/6): 337-391 (2000) |
| 1999 |
|---|
| 18 | EE | Petra Berenbrink,
Christian Scheideler:
Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.
SODA 1999: 112-121 |
| 17 | EE | Petra Berenbrink,
Marco Riedel,
Christian Scheideler:
Simple Competitive Request Scheduling Strategies.
SPAA 1999: 33-42 |
| 16 | EE | Christian Scheideler,
Berthold Vöcking:
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.
STOC 1999: 215-224 |
| 15 | EE | Michele Flammini,
Christian Scheideler:
Simple, Efficient Routing Schemes for All-Optical Networks.
Theory Comput. Syst. 32(3): 387-420 (1999) |
| 1998 |
|---|
| 14 | | Christian Scheideler:
Universal Routing Strategies for Interconnection Networks
Springer 1998 |
| 13 | EE | Micah Adler,
Christian Scheideler:
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).
SPAA 1998: 259-268 |
| 12 | EE | Uriel Feige,
Christian Scheideler:
Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).
STOC 1998: 624-633 |
| 11 | EE | Christian Scheideler,
Berthold Vöcking:
Universal Continuous Routing Strategies.
Theory Comput. Syst. 31(4): 425-449 (1998) |
| 1997 |
|---|
| 10 | EE | Stefan Bock,
Friedhelm Meyer auf der Heide,
Christian Scheideler:
Optimal Wormhole Routing in the (n, d)-Torus.
IPPS 1997: 326-332 |
| 9 | EE | Michele Flammini,
Christian Scheideler:
Simple, Efficient Routing Schemes for All-Optical Networks.
SPAA 1997: 170-179 |
| 1996 |
|---|
| 8 | | Friedhelm Meyer auf der Heide,
Christian Scheideler:
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.
FOCS 1996: 370-379 |
| 7 | | Friedhelm Meyer auf der Heide,
Christian Scheideler:
Communication in Parallel Systems.
SOFSEM 1996: 16-33 |
| 6 | | Christian Scheideler,
Berthold Vöcking:
Universal Continuous Routing Strategies.
SPAA 1996: 141-151 |
| 5 | EE | Robert Cypher,
Friedhelm Meyer auf der Heide,
Christian Scheideler,
Berthold Vöcking:
Universal Algorithms for Store-and-Forward and Wormhole Routing.
STOC 1996: 356-365 |
| 4 | EE | Friedhelm Meyer auf der Heide,
Christian Scheideler,
Volker Stemann:
Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.
Theor. Comput. Sci. 162(2): 245-281 (1996) |
| 1995 |
|---|
| 3 | EE | Friedhelm Meyer auf der Heide,
Christian Scheideler:
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.
ESA 1995: 341-354 |
| 2 | EE | Friedhelm Meyer auf der Heide,
Christian Scheideler:
Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).
SPAA 1995: 137-146 |
| 1 | EE | Friedhelm Meyer auf der Heide,
Christian Scheideler,
Volker Stemann:
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.
STACS 1995: 267-278 |
