@inproceedings{2114, author = {{Korzeniowski, Miroslaw and Scheideler, Christian}}, booktitle = {{ISPAN}}, pages = {{182----187}}, title = {{{Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment}}}, year = {{2005}}, } @inproceedings{2115, author = {{Kothapalli, Kishore and Scheideler, Christian}}, booktitle = {{ISPAN}}, pages = {{188----193}}, title = {{{Supervised Peer-to-Peer Systems}}}, year = {{2005}}, } @inproceedings{2116, author = {{Onus, Melih and W. Richa, Andrea and Kothapalli, Kishore and Scheideler, Christian}}, booktitle = {{ISPAN}}, pages = {{346----351}}, title = {{{Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks}}}, year = {{2005}}, } @inproceedings{2117, author = {{Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}}, booktitle = {{SPAA}}, pages = {{116----125}}, title = {{{Constant density spanners for wireless ad-hoc networks}}}, year = {{2005}}, } @inproceedings{2118, author = {{Scheideler, Christian}}, booktitle = {{STOC}}, pages = {{704----713}}, title = {{{How to spread adversarial nodes?: rotate!}}}, year = {{2005}}, } @inproceedings{2212, author = {{Scheideler, Christian}}, booktitle = {{IMA Workshop on Wireless Communications}}, title = {{{Overlay networks for wireless ad hoc networks}}}, year = {{2005}}, } @article{2029, author = {{Kolman, Petr and Scheideler, Christian}}, journal = {{J. Algorithms}}, number = {{1}}, pages = {{20----44}}, title = {{{Improved bounds for the unsplittable flow problem}}}, doi = {{10.1016/j.jalgor.2004.07.006}}, volume = {{61}}, year = {{2006}}, } @article{2110, author = {{Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}}, journal = {{IEEE Trans. Mob. Comput.}}, number = {{9}}, pages = {{1242----1254}}, title = {{{Survivable Monitoring in Dynamic Networks}}}, doi = {{10.1109/TMC.2006.138}}, year = {{2006}}, } @inproceedings{2111, author = {{Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian}}, booktitle = {{IPDPS}}, title = {{{Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}}}, year = {{2006}}, } @inproceedings{2112, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{OPODIS}}, pages = {{275----289}}, title = {{{Robust Random Number Generation for Peer-to-Peer Systems}}}, year = {{2006}}, } @inproceedings{2113, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{318----327}}, title = {{{Towards a scalable and robust DHT}}}, year = {{2006}}, } @article{2043, author = {{Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{6}}, pages = {{903----928}}, title = {{{The Effect of Faults on Network Expansion}}}, doi = {{10.1007/s00224-006-1349-0}}, year = {{2006}}, } @inproceedings{2213, author = {{Scheideler, Christian}}, booktitle = {{6th International HNI Symposium on New Trends in Parallel and Distributed Computing}}, title = {{{Towards a paradigm for robust distributed algorithms and data structures}}}, year = {{2006}}, } @article{2017, author = {{Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}}, journal = {{SIAM J. Discrete Math.}}, number = {{1}}, pages = {{141----157}}, title = {{{Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks}}}, doi = {{10.1137/S0895480102419743}}, year = {{2007}}, } @inproceedings{2020, author = {{Onus, Melih and W. Richa, Andrea and Scheideler, Christian}}, booktitle = {{Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007}}, isbn = {{978-1-61197-287-0}}, title = {{{Linearization: Locally Self-Stabilizing Sorting in Graphs}}}, doi = {{10.1137/1.9781611972870.10}}, year = {{2007}}, } @inproceedings{2022, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}}, title = {{{Towards Scalable and Robust Overlay Networks}}}, year = {{2007}}, } @inproceedings{2023, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007}}, isbn = {{978-1-59593-616-5}}, pages = {{370----371}}, publisher = {{ACM}}, title = {{{A denial-of-service resistant DHT}}}, doi = {{10.1145/1281100.1281178}}, year = {{2007}}, } @inproceedings{2024, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}}, isbn = {{978-3-540-75141-0}}, pages = {{33----47}}, publisher = {{Springer}}, title = {{{A Denial-of-Service Resistant DHT}}}, doi = {{10.1007/978-3-540-75142-7_6}}, volume = {{4731}}, year = {{2007}}, } @inbook{2028, author = {{W. Richa, Andrea and Scheideler, Christian}}, booktitle = {{Handbook of Approximation Algorithms and Metaheuristics.}}, isbn = {{978-1-58488-550-4}}, title = {{{Overlay Networks for Peer-to-Peer Networks}}}, doi = {{10.1201/9781420010749.ch72}}, year = {{2007}}, } @inproceedings{2214, abstract = {{We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices.}}, author = {{Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{IEEE International Conference on Distributed Computing Systems (ICDCS)}}, title = {{{Dynamic and redundant data placement}}}, year = {{2007}}, } @article{2209, author = {{Aggarwal, Vinay and Feldmann, Anja and Scheideler, Christian}}, journal = {{ACM Computer Commucation Review}}, title = {{{Can ISPs and P2P users cooperate for improved performance?}}}, doi = {{10.1145/1273445.1273449}}, year = {{2007}}, } @article{1937, author = {{Scheideler, Christian}}, journal = {{Bulletin of the EATCS}}, pages = {{130----152}}, title = {{{Algorithms for Overlay Networks}}}, year = {{2008}}, } @inproceedings{1938, author = {{Awerbuch, Baruch and W. Richa, Andr{\'{e}}a and Scheideler, Christian}}, booktitle = {{Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}}, isbn = {{978-1-59593-989-0}}, pages = {{45----54}}, publisher = {{ACM}}, title = {{{A jamming-resistant MAC protocol for single-hop wireless networks}}}, doi = {{10.1145/1400751.1400759}}, year = {{2008}}, } @inproceedings{1940, author = {{Mense, Mario and Scheideler, Christian}}, booktitle = {{Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}}, pages = {{1135----1144}}, publisher = {{SIAM}}, title = {{{SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems}}}, year = {{2008}}, } @inproceedings{1941, author = {{Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}}, booktitle = {{Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}}, isbn = {{978-3-540-89334-9}}, pages = {{124----140}}, publisher = {{Springer}}, title = {{{Tiara: A Self-stabilizing Deterministic Skip List}}}, doi = {{10.1007/978-3-540-89335-6_12}}, volume = {{5340}}, year = {{2008}}, } @inbook{1942, author = {{Scheideler, Christian}}, booktitle = {{Taschenbuch der Algorithmen}}, isbn = {{978-3-540-76393-2}}, pages = {{229----236}}, publisher = {{Springer}}, title = {{{Broadcasting: Wie verbreite ich schnell Informationen?}}}, doi = {{10.1007/978-3-540-76394-9_22}}, year = {{2008}}, } @article{1925, author = {{D. Kleinberg, Robert and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{2}}, pages = {{187}}, title = {{{Foreword}}}, doi = {{10.1007/s00224-009-9202-x}}, year = {{2009}}, } @article{1927, author = {{Awerbuch, Baruch and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{2}}, pages = {{234----260}}, title = {{{Towards a Scalable and Robust DHT}}}, doi = {{10.1007/s00224-008-9099-9}}, year = {{2009}}, } @article{1928, author = {{Awerbuch, Baruch and Scheideler, Christian}}, journal = {{Theor. Comput. Sci.}}, number = {{6-7}}, pages = {{453----466}}, title = {{{Robust random number generation for peer-to-peer systems}}}, doi = {{10.1016/j.tcs.2008.10.003}}, year = {{2009}}, } @inproceedings{1929, author = {{Scheideler, Christian and Schmid, Stefan}}, booktitle = {{Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}}, isbn = {{978-3-642-02929-5}}, pages = {{571----582}}, publisher = {{Springer}}, title = {{{A Distributed and Oblivious Heap}}}, doi = {{10.1007/978-3-642-02930-1_47}}, volume = {{5556}}, year = {{2009}}, } @inproceedings{1930, author = {{Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}}, booktitle = {{Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}}, pages = {{771----780}}, publisher = {{Springer}}, title = {{{A Self-stabilizing and Local Delaunay Graph Construction}}}, doi = {{10.1007/978-3-642-10631-6_78}}, volume = {{5878}}, year = {{2009}}, } @inproceedings{1932, author = {{Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}}, booktitle = {{Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}}, isbn = {{978-1-60558-396-9}}, pages = {{131----140}}, title = {{{A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}}}, doi = {{10.1145/1582716.1582741}}, year = {{2009}}, } @inproceedings{1933, author = {{Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}}, booktitle = {{SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}}, isbn = {{978-1-60558-606-9}}, pages = {{300----309}}, title = {{{A DoS-resilient information system for dynamic data management}}}, doi = {{10.1145/1583991.1584064}}, year = {{2009}}, } @inproceedings{1934, author = {{Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}}, booktitle = {{Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}}, isbn = {{978-3-642-05117-3}}, pages = {{781----782}}, publisher = {{Springer}}, title = {{{Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization}}}, doi = {{10.1007/978-3-642-05118-0_58}}, volume = {{5873}}, year = {{2009}}, } @inproceedings{1935, author = {{Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}}, booktitle = {{Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}}, title = {{{Stabilizing Consensus with the Power of Two Choices}}}, doi = {{10.1145/1989493.1989516}}, volume = {{09371}}, year = {{2009}}, } @article{1903, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, journal = {{Informatik Spektrum}}, number = {{5}}, pages = {{468----474}}, title = {{{Algorithmische Grundlagen verteilter Speichersysteme}}}, doi = {{10.1007/s00287-010-0470-2}}, year = {{2010}}, } @article{1904, author = {{Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian}}, journal = {{Theory of Computing Systems}}, number = {{4}}, pages = {{809----810}}, title = {{{Foreword}}}, doi = {{10.1007/s00224-010-9284-5}}, year = {{2010}}, } @inproceedings{1905, author = {{Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}}, booktitle = {{LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings}}, isbn = {{978-3-642-12199-9}}, pages = {{294----305}}, publisher = {{Springer}}, title = {{{Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization}}}, doi = {{10.1007/978-3-642-12200-2_27}}, volume = {{6034}}, year = {{2010}}, } @inproceedings{1906, author = {{Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid, Stefan}}, booktitle = {{Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}}, isbn = {{978-1-60558-888-9}}, pages = {{114----115}}, publisher = {{ACM}}, title = {{{Brief announcement: towards robust medium access in multi-hop networks}}}, doi = {{10.1145/1835698.1835726}}, year = {{2010}}, } @inproceedings{1907, author = {{Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings}}, isbn = {{978-3-642-15762-2}}, pages = {{179----193}}, publisher = {{Springer}}, title = {{{A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks}}}, doi = {{10.1007/978-3-642-15763-9_17}}, volume = {{6343}}, year = {{2010}}, } @inproceedings{1908, author = {{Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}}, booktitle = {{Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings}}, pages = {{528----530}}, publisher = {{Springer}}, title = {{{Brief Announcement: Stabilizing Consensus with the Power of Two Choices}}}, doi = {{10.1007/978-3-642-15763-9_50}}, volume = {{6343}}, year = {{2010}}, } @inproceedings{1891, author = {{W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011}}, isbn = {{978-0-7695-4364-2}}, pages = {{507----516}}, publisher = {{IEEE Computer Society}}, title = {{{Competitive and Fair Medium Access Despite Reactive Jamming}}}, doi = {{10.1109/ICDCS.2011.8}}, year = {{2011}}, } @inproceedings{1892, author = {{W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011}}, isbn = {{978-1-4503-0868-7}}, pages = {{33----36}}, publisher = {{ACM}}, title = {{{Towards jamming-resistant and competitive medium access in the SINR model}}}, doi = {{10.1145/2030686.2030697}}, year = {{2011}}, } @inproceedings{1893, author = {{W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}}, isbn = {{978-1-4503-0722-2}}, pages = {{15}}, publisher = {{ACM}}, title = {{{Self-stabilizing leader election for single-hop wireless networks despite jamming}}}, doi = {{10.1145/2107502.2107522}}, year = {{2011}}, } @inproceedings{1895, author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}}, booktitle = {{SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)}}, isbn = {{978-1-4503-0743-7}}, pages = {{235----244}}, title = {{{Re-Chord: a self-stabilizing chord overlay network}}}, doi = {{10.1145/1989493.1989527}}, year = {{2011}}, } @inproceedings{1899, author = {{Kniesburges, Sebastian and Scheideler, Christian}}, booktitle = {{WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings}}, isbn = {{978-3-642-19093-3}}, pages = {{170----181}}, publisher = {{Springer}}, title = {{{Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}}}, doi = {{10.1007/978-3-642-19094-0_18}}, volume = {{6552}}, year = {{2011}}, } @inbook{1900, author = {{Scheideler, Christian and Graffi, Kalman}}, booktitle = {{Computer Science, The Hardware, Software and Heart of It}}, isbn = {{978-1-4614-1167-3}}, pages = {{155----168}}, publisher = {{Springer}}, title = {{{Programming for Distributed Computing: From Physical to Logical Networks}}}, doi = {{10.1007/978-1-4614-1168-0_9}}, year = {{2011}}, } @inbook{1901, author = {{Scheideler, Christian}}, booktitle = {{Algorithms Unplugged}}, isbn = {{978-3-642-15327-3}}, pages = {{223----229}}, publisher = {{Springer}}, title = {{{Broadcasting - How Can I Quickly Disseminate Information?}}}, doi = {{10.1007/978-3-642-15328-0_22}}, year = {{2011}}, } @inproceedings{1924, author = {{Kolman, Petr and Scheideler, Christian}}, booktitle = {{28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany}}, pages = {{129----140}}, title = {{{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}}}, doi = {{10.4230/LIPIcs.STACS.2011.129}}, year = {{2011}}, } @inproceedings{645, abstract = {{In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence.}}, author = {{Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}}, booktitle = {{Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{149--158}}, title = {{{Stabilizing consensus with the power of two choices}}}, doi = {{10.1145/1989493.1989516}}, year = {{2011}}, }