Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.
LibreCat: /record/2187
DOI: 10.1007/3-540-60313-1_154

Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
LibreCat: /record/2207

Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.
LibreCat: /record/2208

Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.
LibreCat: /record/2182
DOI: 10.1016/0304-3975(96)00032-1

Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
LibreCat: /record/2183

Communication in Parallel Systems
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
LibreCat: /record/2184

Universal Algorithms for Store-and-Forward and Wormhole Routing
R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.
LibreCat: /record/2186

Optimal Wormhole Routing in the (n, d)-Torus
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat: /record/2175

Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
LibreCat: /record/2179

Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
LibreCat: /record/2168
DOI: 10.1007/s002240000096

Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
LibreCat: /record/2169

Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
LibreCat: /record/2170

Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
LibreCat: /record/2164

Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
LibreCat: /record/2165

Design of the PRESTO Multimedia Storage Network (Extended Abstract)
P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat: /record/2210

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
LibreCat: /record/2166

Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
LibreCat: /record/2143
DOI: 10.1007/s002240010006

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
LibreCat: /record/2145
DOI: 10.1137/S0097539799353431

Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat: /record/2146

Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.
LibreCat: /record/2147

Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
LibreCat: /record/2148

Efficient, distributed data placement strategies for storage area networks (extended abstract)
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
LibreCat: /record/2149

A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.
LibreCat: /record/2150

A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems 
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat: /record/2211

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
LibreCat: /record/2139
DOI: 10.1007/s004930170007

Simple Routing Strategies for Adversarial Systems
B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.
LibreCat: /record/2140

SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat: /record/2141

Simple on-line algorithms for the maximum disjoint paths problem
P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.
LibreCat: /record/2142

Improved Bounds for Acyclic Job Shop Scheduling
U. Feige, C. Scheideler, Combinatorica (2002) 361--399.
LibreCat: /record/2134
DOI: 10.1007/s004930200018

Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.
LibreCat: /record/2135

Compact, adaptive placement schemes for non-uniform requirements
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.
LibreCat: /record/2136

Algorithms for fault-tolerant routing in circuit switched networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.
LibreCat: /record/2137

Models and Techniques for Communication in Dynamic Networks
C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.
LibreCat: /record/2138

Storage Management as Means to cope with Exponential Information Growth
C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.
LibreCat: /record/19790

Smoothed Motion Complexity
V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

Anycasting in Adversarial Systems: Routing and Admission Control
B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.
LibreCat: /record/2129

Peer-to-peer systems for prefix search
B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.
LibreCat: /record/2130

Perfectly Balanced Allocation
A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.
LibreCat: /record/2131

On local algorithms for topology control and routing in ad hoc networks
L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.
LibreCat: /record/2132

Information gathering in adversarial systems: lines and cycles
K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.
LibreCat: /record/2133

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.
LibreCat: /record/2119
DOI: 10.1007/s00453-004-1086-1

Group Spreading: A Protocol for Provably Secure Distributed Name Service
B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.
LibreCat: /record/2120

A Distributed Hash Table for Computational Grids
C. Riley, C. Scheideler, in: IPDPS, 2004.
LibreCat: /record/2121

Robust Distributed Name Service
B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.
LibreCat: /record/2122

Survivable Monitoring in Dynamic Networks
G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.
LibreCat: /record/2123

The hyperring: a low-congestion deterministic data structure for distributed environments
B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.
LibreCat: /record/2124

Consistent and compact data management in distributed storage systems
B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.
LibreCat: /record/2125

Pagoda: a dynamic overlay network for routing, data management, and multicasting
A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.
LibreCat: /record/2126

The effect of faults on network expansion
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293.
LibreCat: /record/2127

Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment
M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.
LibreCat: /record/2114

Supervised Peer-to-Peer Systems
K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.
LibreCat: /record/2115

Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351.
LibreCat: /record/2116

Constant density spanners for wireless ad-hoc networks
K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp. 116--125.
LibreCat: /record/2117

How to spread adversarial nodes?: rotate!
C. Scheideler, in: STOC, 2005, pp. 704--713.
LibreCat: /record/2118

Overlay networks for wireless ad hoc networks
C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.
LibreCat: /record/2212

Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.
LibreCat: /record/2029
DOI: 10.1016/j.jalgor.2004.07.006

Survivable Monitoring in Dynamic Networks
G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.
LibreCat: /record/2110
DOI: 10.1109/TMC.2006.138

Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.
LibreCat: /record/2111

Robust Random Number Generation for Peer-to-Peer Systems
B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.
LibreCat: /record/2112

Towards a scalable and robust DHT
B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.
LibreCat: /record/2113

The Effect of Faults on Network Expansion
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.
LibreCat: /record/2043
DOI: 10.1007/s00224-006-1349-0

Towards a paradigm for robust distributed algorithms and data structures
C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.
LibreCat: /record/2213

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math. (2007) 141--157.
LibreCat: /record/2017
DOI: 10.1137/S0895480102419743

Linearization: Locally Self-Stabilizing Sorting in Graphs
M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.
LibreCat: /record/2020
DOI: 10.1137/1.9781611972870.10

Towards Scalable and Robust Overlay Networks
B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
LibreCat: /record/2022

A denial-of-service resistant DHT
B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371.
LibreCat: /record/2023
DOI: 10.1145/1281100.1281178

A Denial-of-Service Resistant DHT
B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 2007, pp. 33--47.
LibreCat: /record/2024
DOI: 10.1007/978-3-540-75142-7_6

Overlay Networks for Peer-to-Peer Networks
A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007.
LibreCat: /record/2028
DOI: 10.1201/9781420010749.ch72

Dynamic and redundant data placement
A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
LibreCat: /record/2214

Can ISPs and P users cooperate for improved performance?
V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007).
LibreCat: /record/2209
DOI: 10.1145/1273445.1273449

Algorithms for Overlay Networks
C. Scheideler, Bulletin of the EATCS (2008) 130--152.
LibreCat: /record/1937

A jamming-resistant MAC protocol for single-hop wireless networks
B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.
LibreCat: /record/1938
DOI: 10.1145/1400751.1400759

SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.
LibreCat: /record/1940

Tiara: A Self-stabilizing Deterministic Skip List
T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.
LibreCat: /record/1941
DOI: 10.1007/978-3-540-89335-6_12

Broadcasting: Wie verbreite ich schnell Informationen?
C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.
LibreCat: /record/1942
DOI: 10.1007/978-3-540-76394-9_22

Foreword
R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.
LibreCat: /record/1925
DOI: 10.1007/s00224-009-9202-x

Towards a Scalable and Robust DHT
B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.
LibreCat: /record/1927
DOI: 10.1007/s00224-008-9099-9

Robust random number generation for peer-to-peer systems
B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.
LibreCat: /record/1928
DOI: 10.1016/j.tcs.2008.10.003

A Distributed and Oblivious Heap
C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, Springer, 2009, pp. 571--582.
LibreCat: /record/1929
DOI: 10.1007/978-3-642-02930-1_47

A Self-stabilizing and Local Delaunay Graph Construction
R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, Springer, 2009, pp. 771--780.
LibreCat: /record/1930
DOI: 10.1007/978-3-642-10631-6_78

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.
LibreCat: /record/1932
DOI: 10.1145/1582716.1582741

A DoS-resilient information system for dynamic data management
M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.
LibreCat: /record/1933
DOI: 10.1145/1583991.1584064

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization
D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 2009, pp. 781--782.
LibreCat: /record/1934
DOI: 10.1007/978-3-642-05118-0_58

Stabilizing Consensus with the Power of Two Choices
B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009.
LibreCat: /record/1935
DOI: 10.1145/1989493.1989516

Algorithmische Grundlagen verteilter Speichersysteme
F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.
LibreCat: /record/1903
DOI: 10.1007/s00287-010-0470-2

Foreword
C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810.
LibreCat: /record/1904
DOI: 10.1007/s00224-010-9284-5

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.
LibreCat: /record/1905
DOI: 10.1007/978-3-642-12200-2_27

Brief announcement: towards robust medium access in multi-hop networks
A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.
LibreCat: /record/1906
DOI: 10.1145/1835698.1835726

A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 179--193.
LibreCat: /record/1907
DOI: 10.1007/978-3-642-15763-9_17

Brief Announcement: Stabilizing Consensus with the Power of Two Choices
B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 528--530.
LibreCat: /record/1908
DOI: 10.1007/978-3-642-15763-9_50

Competitive and Fair Medium Access Despite Reactive Jamming
A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516.
LibreCat: /record/1891
DOI: 10.1109/ICDCS.2011.8

Towards jamming-resistant and competitive medium access in the SINR model
A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, @MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36.
LibreCat: /record/1892
DOI: 10.1145/2030686.2030697

Self-stabilizing leader election for single-hop wireless networks despite jamming
A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.
LibreCat: /record/1893
DOI: 10.1145/2107502.2107522

Re-Chord: a self-stabilizing chord overlay network
S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: 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), 2011, pp. 235--244.
LibreCat: /record/1895
DOI: 10.1145/1989493.1989527

Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, Springer, 2011, pp. 170--181.
LibreCat: /record/1899
DOI: 10.1007/978-3-642-19094-0_18

Programming for Distributed Computing: From Physical to Logical Networks
C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.
LibreCat: /record/1900
DOI: 10.1007/978-1-4614-1168-0_9

Broadcasting - How Can I Quickly Disseminate Information?
C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.
LibreCat: /record/1901
DOI: 10.1007/978-3-642-15328-0_22

Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing
P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140.
LibreCat: /record/1924
DOI: 10.4230/LIPIcs.STACS.2011.129

Stabilizing consensus with the power of two choices
B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.
LibreCat: /record/645
DOI: 10.1145/1989493.1989516