| 2012 | ||
|---|---|---|
| j23 | Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau: Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms 8(3): 30 (2012) | |
| j22 | Thomas Clouser, Mikhail Nesterenko, Christian Scheideler: Tiara: A self-stabilizing deterministic skip list and skip graph. Theor. Comput. Sci. 428: 18-35 (2012) | |
| j21 | Shlomi Dolev, Christian Scheideler: Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor. Comput. Sci. 453: 1 (2012) | |
| j20 | Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid: Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theor. Comput. Sci. 457: 137-148 (2012) | |
| c79 | ||
| c78 | Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler: A Self-Stabilization Process for Small-World Networks. IPDPS 2012: 1261-1271 | |
| c77 | Maximilian Drees, Martina Hüllmann, Andreas Koutsopoulos, Christian Scheideler: Self-organizing Particle Systems. IPDPS 2012: 1272-1283 | |
| c76 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: Competitive and fair throughput for co-existing networks under adversarial interference. PODC 2012: 291-300 | |
| c75 | Petr Kolman, Christian Scheideler: Approximate duality of multicommodity multiroute flows and cuts: single source case. SODA 2012: 800-810 | |
| c74 | Sebastian Kniesburges, Christian Scheideler: Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. DISC 2012: 435-436 | |
| c73 | Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker: Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. DISC 2012: 439-440 | |
| e8 | Andréa W. Richa, Christian Scheideler (Eds.): Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Toronto, Canada, October 1-4, 2012. Proceedings. Lecture Notes in Computer Science 7596, Springer 2012, isbn 978-3-642-33535-8 | |
| 2011 | ||
| e7 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Algorithms Unplugged. Springer 2011, isbn 978-3-642-15327-3 | |
| p2 | Christian Scheideler: Broadcasting - How Can I Quickly Disseminate Information? Algorithms Unplugged 2011: 223-229 | |
| c72 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: Competitive and Fair Medium Access Despite Reactive Jamming. ICDCS 2011: 507-516 | |
| c71 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: Self-stabilizing leader election for single-hop wireless networks despite jamming. MobiHoc 2011: 15 | |
| c70 | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler: Stabilizing consensus with the power of two choices. SPAA 2011: 149-158 | |
| c69 | Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler: Re-Chord: a self-stabilizing chord overlay network. SPAA 2011: 235-244 | |
| c68 | Rizal Mohd Nor, Mikhail Nesterenko, Christian Scheideler: Corona: A Stabilizing Deterministic Message-Passing Skip List. SSS 2011: 356-370 | |
| c67 | Andréa W. Richa, Christian Scheideler, Phillip Stevens: Self-Stabilizing De Bruijn Networks. SSS 2011: 416-430 | |
| c66 | Petr Kolman, Christian Scheideler: Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. STACS 2011: 129-140 | |
| c65 | Sebastian Kniesburges, Christian Scheideler: Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. WALCOM 2011: 170-181 | |
| 2010 | ||
| j19 | Friedhelm Meyer auf der Heide, Christian Scheideler: Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum 33(5): 468-474 (2010) | |
| j18 | Cyril Gavoille, Boaz Patt-Shamir, Christian Scheideler: Foreword. Theory Comput. Syst. 47(4): 809-810 (2010) | |
| c64 | 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 | |
| c63 | Andréa W. Richa, Jin Zhang, Christian Scheideler, Stefan Schmid: Brief announcement: towards robust medium access in multi-hop networks. PODC 2010: 114-115 | |
| c62 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. DISC 2010: 179-193 | |
| c61 | 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 | |
| e6 | Christian Scheideler (Ed.): 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. Lecture Notes in Computer Science 6451, Springer 2010, isbn 978-3-642-16987-8 | |
| i3 | 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) | |
| i2 | Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang: AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming. CoRR abs/1007.4389 (2010) | |
| 2009 | ||
| j17 | ||
| j16 | Baruch Awerbuch, Christian Scheideler: Towards a Scalable and Robust DHT. Theory Comput. Syst. 45(2): 234-260 (2009) | |
| j15 | Baruch Awerbuch, Christian Scheideler: Robust random number generation for peer-to-peer systems. Theor. Comput. Sci. 410(6-7): 453-466 (2009) | |
| c60 | ||
| c59 | Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid: A Self-stabilizing and Local Delaunay Graph Construction. ISAAC 2009: 771-780 | |
| c58 | 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 | |
| c57 | Matthias Baumgart, Christian Scheideler, Stefan Schmid: A DoS-resilient information system for dynamic data management. SPAA 2009: 300-309 | |
| c56 | 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 | |
| 2008 | ||
| e5 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Taschenbuch der Algorithmen. eXamen.press, Springer 2008, isbn 978-3-540-76393-2 | |
| j14 | ||
| c55 | 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 | |
| c54 | Baruch Awerbuch, Andréa W. Richa, Christian Scheideler: A jamming-resistant MAC protocol for single-hop wireless networks. PODC 2008: 45-54 | |
| c53 | Mario Mense, Christian Scheideler: SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. SODA 2008: 1135-1144 | |
| c52 | Thomas Clouser, Mikhail Nesterenko, Christian Scheideler: Tiara: A Self-stabilizing Deterministic Skip List. SSS 2008: 124-140 | |
| p1 | Christian Scheideler: Broadcasting: Wie verbreite ich schnell Informationen?. Taschenbuch der Algorithmen 2008: 229-236 | |
| e4 | Heinz-Gerd Hegering, Axel Lehmann, Hans Jürgen Ohlbach, Christian Scheideler (Eds.): 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. LNI 133, GI 2008, isbn 978-3-88579-227-7 | |
| e3 | Heinz-Gerd Hegering, Axel Lehmann, Hans Jürgen Ohlbach, Christian Scheideler (Eds.): 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. LNI 134, GI 2008, isbn 978-3-88579-228-4 | |
| 2007 | ||
| j13 | 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) | |
| c51 | Melih Onus, Andréa W. Richa, Christian Scheideler: Linearization: Locally Self-Stabilizing Sorting in Graphs. ALENEX 2007 | |
| c50 | ||
| c49 | ||
| c48 | ||
| e2 | James Aspnes, Christian Scheideler, Anish Arora, Samuel Madden (Eds.): Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings. Lecture Notes in Computer Science 4549, Springer 2007, isbn 978-3-540-73089-7 | |
| e1 | Phillip B. Gibbons, Christian Scheideler (Eds.): 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, isbn 978-1-59593-667-7 | |
| 2006 | ||
| j12 | Petr Kolman, Christian Scheideler: Improved bounds for the unsplittable flow problem. J. Algorithms 61(1): 20-44 (2006) | |
| j11 | 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) | |
| j10 | Giuseppe Ateniese, Chris Riley, Christian Scheideler: Survivable Monitoring in Dynamic Networks. IEEE Trans. Mob. Comput. 5(9): 1242-1254 (2006) | |
| c47 | Kishore Kothapalli, Christian Scheideler, Melih Onus, Christian Schindelhauer: Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. IPDPS 2006 | |
| c46 | Baruch Awerbuch, Christian Scheideler: Robust Random Number Generation for Peer-to-Peer Systems. OPODIS 2006: 275-289 | |
| c45 | ||
| 2005 | ||
| c44 | Miroslaw Korzeniowski, Christian Scheideler: Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environmen. ISPAN 2005: 182-187 | |
| c43 | ||
| c42 | Melih Onus, Andréa W. Richa, Kishore Kothapalli, Christian Scheideler: Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. ISPAN 2005: 346-351 | |
| c41 | Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa: Constant density spanners for wireless ad-hoc networks. SPAA 2005: 116-125 | |
| c40 | ||
| 2004 | ||
| j9 | Petr Kolman, Christian Scheideler: Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica 39(3): 209-233 (2004) | |
| c39 | Baruch Awerbuch, Christian Scheideler: Group Spreading: A Protocol for Provably Secure Distributed Name Service. ICALP 2004: 183-195 | |
| c38 | ||
| c37 | ||
| c36 | Giuseppe Ateniese, Chris Riley, Christian Scheideler: Survivable Monitoring in Dynamic Networks. IWIA 2004: 33-47 | |
| c35 | Baruch Awerbuch, Christian Scheideler: The hyperring: a low-congestion deterministic data structure for distributed environments. SODA 2004: 318-327 | |
| c34 | Baruch Awerbuch, Christian Scheideler: Consistent and compact data management in distributed storage systems. SPAA 2004: 44-53 | |
| c33 | 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 | |
| c32 | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The effect of faults on network expansion. SPAA 2004: 286-293 | |
| i1 | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The Effect of Faults on Network Expansion. CoRR cs.DC/0404029 (2004) | |
| 2003 | ||
| c31 | Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler: Smoothed Motion Complexity. ESA 2003: 161-171 | |
| c30 | Baruch Awerbuch, André Brinkmann, Christian Scheideler: Anycasting in Adversarial Systems: Routing and Admission Control. ICALP 2003: 1153-1168 | |
| c29 | ||
| c28 | Artur Czumaj, Chris Riley, Christian Scheideler: Perfectly Balanced Allocation. RANDOM-APPROX 2003: 240-251 | |
| c27 | Lujun Jia, Rajmohan Rajaraman, Christian Scheideler: On local algorithms for topology control and routing in ad hoc networks. SPAA 2003: 220-229 | |
| c26 | Kishore Kothapalli, Christian Scheideler: Information gathering in adversarial systems: lines and cycles. SPAA 2003: 333-342 | |
| 2002 | ||
| j8 | Uriel Feige, Christian Scheideler: Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica 22(3): 361-399 (2002) | |
| c25 | Petr Kolman, Christian Scheideler: Improved bounds for the unsplittable flow problem. SODA 2002: 184-193 | |
| c24 | André Brinkmann, Kay Salzwedel, Christian Scheideler: Compact, adaptive placement schemes for non-uniform requirements. SPAA 2002: 53-62 | |
| c23 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman: Algorithms for fault-tolerant routing in circuit switched networks. SPAA 2002: 265-274 | |
| c22 | Christian Scheideler: Models and Techniques for Communication in Dynamic Networks. STACS 2002: 27-49 | |
| 2001 | ||
| j7 | Friedhelm Meyer auf der Heide, Christian Scheideler: Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica 21(1): 95-138 (2001) | |
| c21 | Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler: Simple Routing Strategies for Adversarial Systems. FOCS 2001: 158-167 | |
| c20 | Petra Berenbrink, André Brinkmann, Christian Scheideler: SIMLAB-A Simulation Environment for Storage Area Networks. PDP 2001: 227-234 | |
| c19 | Petr Kolman, Christian Scheideler: Simple on-line algorithms for the maximum disjoint paths problem. SPAA 2001: 38-47 | |
| 2000 | ||
| j6 | Micah Adler, Christian Scheideler: Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst. 33(5/6): 337-391 (2000) | |
| j5 | 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) | |
| j4 | 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) | |
| c18 | Petra Berenbrink, André Brinkmann, Christian Scheideler: Distributed Path Selection for Storage Networks. PDPTA 2000 | |
| c17 | Artur Czumaj, Christian Scheideler: Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. SODA 2000: 30-39 | |
| c16 | André Brinkmann, Kay Salzwedel, Christian Scheideler: Efficient, distributed data placement strategies for storage area networks (extended abstract). SPAA 2000: 119-128 | |
| c15 | 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 | |
| 1999 | ||
| j3 | Michele Flammini, Christian Scheideler: Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst. 32(3): 387-420 (1999) | |
| c14 | Petra Berenbrink, Christian Scheideler: Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. SODA 1999: 112-121 | |
| c13 | Petra Berenbrink, Marco Riedel, Christian Scheideler: Simple Competitive Request Scheduling Strategies. SPAA 1999: 33-42 | |
| c12 | Christian Scheideler, Berthold Vöcking: From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. STOC 1999: 215-224 | |
| 1998 | ||
| b2 | Christian Scheideler: Universal Routing Strategies for Interconnection Networks. Lecture Notes in Computer Science 1390, Springer 1998, isbn 3-540-64505-5 | |
| j2 | Christian Scheideler, Berthold Vöcking: Universal Continuous Routing Strategies. Theory Comput. Syst. 31(4): 425-449 (1998) | |
| c11 | Micah Adler, Christian Scheideler: Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). SPAA 1998: 259-268 | |
| c10 | Uriel Feige, Christian Scheideler: Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). STOC 1998: 624-633 | |
| 1997 | ||
| c9 | Stefan Bock, Friedhelm Meyer auf der Heide, Christian Scheideler: Optimal Wormhole Routing in the (n, d)-Torus. IPPS 1997: 326-332 | |
| c8 | Michele Flammini, Christian Scheideler: Simple, Efficient Routing Schemes for All-Optical Networks. SPAA 1997: 170-179 | |
| 1996 | ||
| b1 | Christian Scheideler: Universal routing strategies. Universität Paderborn 1996, pp. I-X, 1-202 | |
| j1 | 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) | |
| c7 | Friedhelm Meyer auf der Heide, Christian Scheideler: Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. FOCS 1996: 370-379 | |
| c6 | Friedhelm Meyer auf der Heide, Christian Scheideler: Communication in Parallel Systems. SOFSEM 1996: 16-33 | |
| c5 | ||
| c4 | 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 | |
| 1995 | ||
| c3 | Friedhelm Meyer auf der Heide, Christian Scheideler: Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. ESA 1995: 341-354 | |
| c2 | Friedhelm Meyer auf der Heide, Christian Scheideler: Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). SPAA 1995: 137-146 | |
| c1 | 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 Wed May 22 18:31:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page