@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{2113,
author = {Awerbuch, Baruch and Scheideler, Christian},
booktitle = {SPAA},
pages = {318----327},
title = {{Towards a scalable and robust DHT}},
year = {2006},
}
@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},
}
@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},
}
@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},
}
@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,
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{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{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},
}
@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{1937,
author = {Scheideler, Christian},
journal = {Bulletin of the EATCS},
pages = {130----152},
title = {{Algorithms for Overlay Networks}},
year = {2008},
}
@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},
}
@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},
}
@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},
}
@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{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{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},
}
@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},
}
@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},
}
@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{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},
}
@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},
}
@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},
}
@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{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},
}
@inproceedings{662,
abstract = {We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph.},
author = {Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian},
booktitle = {Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {356----370},
title = {{Corona: A Stabilizing Deterministic Message-Passing Skip List}},
doi = {10.1007/978-3-642-24550-3_27},
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{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{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},
}
@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},
}
@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},
}
@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{646,
abstract = {This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected.},
author = {Richa, Andrea W. and Scheideler, Christian},
booktitle = {Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {416--430},
title = {{Self-Stabilizing DeBruijn Networks}},
doi = {10.1007/978-3-642-24550-3_31},
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},
}
@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},
}
@article{1882,
author = {Dolev, Shlomi and Scheideler, Christian},
journal = {Theor. Comput. Sci.},
pages = {1},
title = {{Editorial for Algorithmic Aspects of Wireless Sensor Networks}},
doi = {10.1016/j.tcs.2012.07.012},
year = {2012},
}
@article{574,
abstract = {We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.},
author = {Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian},
journal = {Theoretical Computer Science},
pages = {18--35},
publisher = {Elsevier},
title = {{Tiara: A self-stabilizing deterministic skip list and skip graph}},
doi = {10.1016/j.tcs.2011.12.079},
year = {2012},
}
@article{579,
abstract = {A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.},
author = {Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till},
journal = {Transactions on Algorithms},
number = {3},
pages = {30},
publisher = {ACM},
title = {{Smoothed analysis of left-to-right maxima with applications}},
doi = {10.1145/2229163.2229174},
year = {2012},
}
@inproceedings{581,
abstract = {Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.},
author = {Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian},
booktitle = {Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
pages = {1272--1283},
title = {{Self-Organizing Particle Systems}},
doi = {10.1109/IPDPS.2012.116},
year = {2012},
}
@inproceedings{625,
abstract = {This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.},
author = {Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi},
booktitle = {Proceedings of the 26th International Symposium on Distributed Computing (DISC)},
pages = {439--440},
title = {{Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}},
doi = {10.1007/978-3-642-33651-5_47},
year = {2012},
}
@inproceedings{632,
abstract = {Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.},
author = {Kolman, Petr and Scheideler, Christian},
booktitle = {Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)},
pages = {800--810},
title = {{Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}},
doi = {10.1137/1.9781611973099.64},
year = {2012},
}
@inproceedings{1884,
author = {Monien, Burkhard and Scheideler, Christian},
booktitle = {Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings},
isbn = {978-3-642-32819-0},
pages = {1----2},
publisher = {Springer},
title = {{Selfish Distributed Optimization}},
doi = {10.1007/978-3-642-32820-6_1},
volume = {7484},
year = {2012},
}
@article{570,
abstract = {This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \local Delaunay graphs" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks},
author = {Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan},
journal = {Theoretical Computer Science},
pages = {137--148},
publisher = {Elsevier},
title = {{Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}},
doi = {10.1016/j.tcs.2012.07.029},
year = {2012},
}
@inproceedings{626,
abstract = {The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT).},
author = {Kniesburges, Sebastian and Scheideler, Christian},
booktitle = {Proceedings of the 26th International Symposium on Distributed Computing (DISC)},
pages = {435--436},
title = {{Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}},
doi = {10.1007/978-3-642-33651-5_45},
year = {2012},
}