![]() | ![]() |
| 2012 | ||
|---|---|---|
| 104 | Petr Kolman, Christian Scheideler: Approximate duality of multicommodity multiroute flows and cuts: single source case. SODA 2012: 800-810 | |
| 2011 | ||
| 103 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner: Algorithms Unplugged Springer 2011 | |
| 102 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: Competitive and Fair Medium Access Despite Reactive Jamming. ICDCS 2011: 507-516 | |
| 101 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: Self-stabilizing leader election for single-hop wireless networks despite jamming. MobiHoc 2011: 15 | |
| 100 | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler: Stabilizing consensus with the power of two choices. SPAA 2011: 149-158 | |
| 99 | Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler: Re-Chord: a self-stabilizing chord overlay network. SPAA 2011: 235-244 | |
| 98 | Rizal Mohd Nor, Mikhail Nesterenko, Christian Scheideler: Corona: A Stabilizing Deterministic Message-Passing Skip List. SSS 2011: 356-370 | |
| 97 | Andréa W. Richa, Christian Scheideler, Phillip Stevens: Self-Stabilizing De Bruijn Networks. SSS 2011: 416-430 | |
| 96 | Petr Kolman, Christian Scheideler: Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. STACS 2011: 129-140 | |
| 95 | Sebastian Kniesburges, Christian Scheideler: Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. WALCOM 2011: 170-181 | |
| 94 | Christian Scheideler: Broadcasting - How Can I Quickly Disseminate Information? Algorithms Unplugged 2011: 223-229 | |
| 2010 | ||
| 93 | Christian Scheideler: Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers Springer 2010 | |
| 92 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. DISC 2010: 179-193 | |
| 91 | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler: Brief Announcement: Stabilizing Consensus with the Power of Two Choices. DISC 2010: 528-530 | |
| 90 | Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. LATIN 2010: 294-305 | |
| 89 | Andréa W. Richa, Jin Zhang, Christian Scheideler, Stefan Schmid: Brief announcement: towards robust medium access in multi-hop networks. PODC 2010: 114-115 | |
| 88 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks CoRR abs/1007.1189: (2010) | |
| 87 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming CoRR abs/1007.4389: (2010) | |
| 86 | Friedhelm Meyer auf der Heide, Christian Scheideler: Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum 33(5): 468-474 (2010) | |
| 85 | Cyril Gavoille, Boaz Patt-Shamir, Christian Scheideler: Foreword. Theory Comput. Syst. 47(4): 809-810 (2010) | |
| 2009 | ||
| 84 | Christian Scheideler, Stefan Schmid: A Distributed and Oblivious Heap. ICALP (2) 2009: 571-582 | |
| 83 | Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid: A Self-stabilizing and Local Delaunay Graph Construction. ISAAC 2009: 771-780 | |
| 82 | 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 | |
| 81 | Matthias Baumgart, Christian Scheideler, Stefan Schmid: A DoS-resilient information system for dynamic data management. SPAA 2009: 300-309 | |
| 80 | Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. SSS 2009: 781-782 | |
| 79 | Baruch Awerbuch, Christian Scheideler: Robust random number generation for peer-to-peer systems. Theor. Comput. Sci. 410(6-7): 453-466 (2009) | |
| 78 | Robert D. Kleinberg, Christian Scheideler: Foreword. Theory Comput. Syst. 45(2): 187 (2009) | |
| 77 | Baruch Awerbuch, Christian Scheideler: Towards a Scalable and Robust DHT. Theory Comput. Syst. 45(2): 234-260 (2009) | |
| 2008 | ||
| 76 | 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 | |
| 75 | 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 | |
| 74 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner: Taschenbuch der Algorithmen Springer 2008 | |
| 73 | 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 | |
| 72 | Baruch Awerbuch, Andréa W. Richa, Christian Scheideler: A jamming-resistant MAC protocol for single-hop wireless networks. PODC 2008: 45-54 | |
| 71 | Mario Mense, Christian Scheideler: SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. SODA 2008: 1135-1144 | |
| 70 | Thomas Clouser, Mikhail Nesterenko, Christian Scheideler: Tiara: A Self-stabilizing Deterministic Skip List. SSS 2008: 124-140 | |
| 69 | Christian Scheideler: Broadcasting: Wie verbreite ich schnell Informationen?. Taschenbuch der Algorithmen 2008: 229-236 | |
| 2007 | ||
| 68 | Phillip B. Gibbons, Christian Scheideler: 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 | |
| 67 | 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 | |
| 66 | Melih Onus, Andréa W. Richa, Christian Scheideler: Linearization: Locally Self-Stabilizing Sorting in Graphs. ALENEX 2007 | |
| 65 | Baruch Awerbuch, Christian Scheideler: A Denial-of-Service Resistant DHT. DISC 2007: 33-47 | |
| 64 | Baruch Awerbuch, Christian Scheideler: A denial-of-service resistant DHT. PODC 2007: 370-371 | |
| 63 | 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 | ||
| 62 | Kishore Kothapalli, Christian Scheideler, Melih Onus, Christian Schindelhauer: Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. IPDPS 2006 | |
| 61 | Baruch Awerbuch, Christian Scheideler: Robust Random Number Generation for Peer-to-Peer Systems. OPODIS 2006: 275-289 | |
| 60 | Baruch Awerbuch, Christian Scheideler: Towards a scalable and robust DHT. SPAA 2006: 318-327 | |
| 59 | Giuseppe Ateniese, Chris Riley, Christian Scheideler: Survivable Monitoring in Dynamic Networks. IEEE Trans. Mob. Comput. 5(9): 1242-1254 (2006) | |
| 58 | Petr Kolman, Christian Scheideler: Improved bounds for the unsplittable flow problem. J. Algorithms 61(1): 20-44 (2006) | |
| 57 | 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 | ||
| 56 | Miroslaw Korzeniowski, Christian Scheideler: Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environmen. ISPAN 2005: 182-187 | |
| 55 | Kishore Kothapalli, Christian Scheideler: Supervised Peer-to-Peer Systems. ISPAN 2005: 188-193 | |
| 54 | Melih Onus, Andréa W. Richa, Kishore Kothapalli, Christian Scheideler: Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. ISPAN 2005: 346-351 | |
| 53 | Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa: Constant density spanners for wireless ad-hoc networks. SPAA 2005: 116-125 | |
| 52 | Christian Scheideler: How to spread adversarial nodes?: rotate! STOC 2005: 704-713 | |
| 2004 | ||
| 51 | Baruch Awerbuch, Christian Scheideler: Group Spreading: A Protocol for Provably Secure Distributed Name Service. ICALP 2004: 183-195 | |
| 50 | Chris Riley, Christian Scheideler: A Distributed Hash Table for Computational Grids. IPDPS 2004 | |
| 49 | Baruch Awerbuch, Christian Scheideler: Robust Distributed Name Service. IPTPS 2004: 237-249 | |
| 48 | Giuseppe Ateniese, Chris Riley, Christian Scheideler: Survivable Monitoring in Dynamic Networks. IWIA 2004: 33-47 | |
| 47 | Baruch Awerbuch, Christian Scheideler: The hyperring: a low-congestion deterministic data structure for distributed environments. SODA 2004: 318-327 | |
| 46 | 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 | |
| 45 | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The effect of faults on network expansion. SPAA 2004: 286-293 | |
| 44 | Baruch Awerbuch, Christian Scheideler: Consistent and compact data management in distributed storage systems. SPAA 2004: 44-53 | |
| 43 | Petr Kolman, Christian Scheideler: Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica 39(3): 209-233 (2004) | |
| 42 | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The Effect of Faults on Network Expansion CoRR cs.DC/0404029: (2004) | |
| 2003 | ||
| 41 | Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler: Smoothed Motion Complexity. ESA 2003: 161-171 | |
| 40 | Baruch Awerbuch, André Brinkmann, Christian Scheideler: Anycasting in Adversarial Systems: Routing and Admission Control. ICALP 2003: 1153-1168 | |
| 39 | Baruch Awerbuch, Christian Scheideler: Peer-to-peer systems for prefix search. PODC 2003: 123-132 | |
| 38 | Artur Czumaj, Chris Riley, Christian Scheideler: Perfectly Balanced Allocation. RANDOM-APPROX 2003: 240-251 | |
| 37 | Lujun Jia, Rajmohan Rajaraman, Christian Scheideler: On local algorithms for topology control and routing in ad hoc networks. SPAA 2003: 220-229 | |
| 36 | Kishore Kothapalli, Christian Scheideler: Information gathering in adversarial systems: lines and cycles. SPAA 2003: 333-342 | |
| 2002 | ||
| 35 | Petr Kolman, Christian Scheideler: Improved bounds for the unsplittable flow problem. SODA 2002: 184-193 | |
| 34 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman: Algorithms for fault-tolerant routing in circuit switched networks. SPAA 2002: 265-274 | |
| 33 | André Brinkmann, Kay Salzwedel, Christian Scheideler: Compact, adaptive placement schemes for non-uniform requirements. SPAA 2002: 53-62 | |
| 32 | Christian Scheideler: Models and Techniques for Communication in Dynamic Networks. STACS 2002: 27-49 | |
| 31 | Uriel Feige, Christian Scheideler: Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica 22(3): 361-399 (2002) | |
| 2001 | ||
| 30 | Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler: Simple Routing Strategies for Adversarial Systems. FOCS 2001: 158-167 | |
| 29 | Petra Berenbrink, André Brinkmann, Christian Scheideler: SIMLAB-A Simulation Environment for Storage Area Networks. PDP 2001: 227-234 | |
| 28 | Petr Kolman, Christian Scheideler: Simple on-line algorithms for the maximum disjoint paths problem. SPAA 2001: 38-47 | |
| 27 | Friedhelm Meyer auf der Heide, Christian Scheideler: Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica 21(1): 95-138 (2001) | |
| 2000 | ||
| 26 | Petra Berenbrink, André Brinkmann, Christian Scheideler: Distributed Path Selection for Storage Networks. PDPTA 2000 | |
| 25 | Artur Czumaj, Christian Scheideler: Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. SODA 2000: 30-39 | |
| 24 | André Brinkmann, Kay Salzwedel, Christian Scheideler: Efficient, distributed data placement strategies for storage area networks (extended abstract). SPAA 2000: 119-128 | |
| 23 | 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 | |
| 22 | 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) | |
| 21 | 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) | |
| 20 | Micah Adler, Christian Scheideler: Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst. 33(5/6): 337-391 (2000) | |
| 1999 | ||
| 19 | Petra Berenbrink, Christian Scheideler: Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. SODA 1999: 112-121 | |
| 18 | Petra Berenbrink, Marco Riedel, Christian Scheideler: Simple Competitive Request Scheduling Strategies. SPAA 1999: 33-42 | |
| 17 | Christian Scheideler, Berthold Vöcking: From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. STOC 1999: 215-224 | |
| 16 | Michele Flammini, Christian Scheideler: Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst. 32(3): 387-420 (1999) | |
| 1998 | ||
| 15 | Christian Scheideler: Universal Routing Strategies for Interconnection Networks Springer 1998 | |
| 14 | Micah Adler, Christian Scheideler: Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). SPAA 1998: 259-268 | |
| 13 | Uriel Feige, Christian Scheideler: Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). STOC 1998: 624-633 | |
| 12 | Christian Scheideler, Berthold Vöcking: Universal Continuous Routing Strategies. Theory Comput. Syst. 31(4): 425-449 (1998) | |
| 1997 | ||
| 11 | Stefan Bock, Friedhelm Meyer auf der Heide, Christian Scheideler: Optimal Wormhole Routing in the (n, d)-Torus. IPPS 1997: 326-332 | |
| 10 | Michele Flammini, Christian Scheideler: Simple, Efficient Routing Schemes for All-Optical Networks. SPAA 1997: 170-179 | |
| 1996 | ||
| 9 | Friedhelm Meyer auf der Heide, Christian Scheideler: Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. FOCS 1996: 370-379 | |
| 8 | Friedhelm Meyer auf der Heide, Christian Scheideler: Communication in Parallel Systems. SOFSEM 1996: 16-33 | |
| 7 | Christian Scheideler, Berthold Vöcking: Universal Continuous Routing Strategies. SPAA 1996: 141-151 | |
| 6 | 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 | |
| 5 | 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) | |
| 4 | Christian Scheideler: Universal routing strategies. Universität Paderborn 1996: I-X, 1-202 | |
| 1995 | ||
| 3 | Friedhelm Meyer auf der Heide, Christian Scheideler: Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. ESA 1995: 341-354 | |
| 2 | Friedhelm Meyer auf der Heide, Christian Scheideler: Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). SPAA 1995: 137-146 | |
| 1 | Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann: Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. STACS 1995: 267-278 | |
Colors in the list of coauthors
Last update Tue Feb 14 23:09:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page