]> 2002-03-20 A Continuum of Failure Models for Distributed Computing. 153-165 1992 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag92.html#GarayP92 2002-03-20 Coping with Contention (Extended Abstract). 89-100 1994 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag94.html#ChoyS94 2002-08-19 The Compactness of Interval Routing for Almost All Graphs. 161-174 http://link.springer.de/link/service/series/0558/bibs/1499/14990161.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#GavoilleP98 2004-11-23 A Decision-Theoretic Approach to Reliable Message Delivery. 89-103 http://link.springer.de/link/service/series/0558/bibs/1499/14990089.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#ChuH98 2002-03-20 Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization. 110-119 1992 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag92.html#GarofalakisRST92 2002-03-20 Optimal Computation of Global Sensitive Functions in Fast Networks. 185-191 1990 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag90.html#CidonGK90 2002-10-28 Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection. 280-294 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080280.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#GartnerP02 2002-03-20 A Scalable Approach to Routing in ATM Networks. 209-222 1994 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag94.html#CidonGZ94 2002-03-20 Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. 81-95 1997 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag97.html#GehrkePR97 2002-03-20 Greedy Packet Scheduling. 169-184 1990 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag90.html#CidonKMP90 2004-01-20 Efficient Gossip and Robust Distributed Computation. 224-238 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2848&spage=224 2003 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2003.html#GeorgiouKS03 2002-08-19 Propagation and Leader Election in a Multihop Broadcast Environment. 104-118 http://link.springer.de/link/service/series/0558/bibs/1499/14990104.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#CidonM98 2002-01-03 The Complexity of Synchronous Iterative Do-All with Crashes. 151-165 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800151.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#GeorgiouRS01 2002-03-20 Distributed Fairness Algorithms for Local Area Networks. 57-69 1989 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag89.html#CidonO89 2005-04-19 An Efficient Solution to the Drinking Philosophers Problem and Its Extension. 83-93 1989 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag89.html#GinatSA89 2002-03-20 Message Terminate Algorithms for Anonymous Rings of Unknown Size. 264-276 1992 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag92.html#CidonS92 2002-03-20 Highly Concurrent Logically Synchronous Multicast. 94-109 1989 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag89.html#Goldman89 2002-03-20 An Efficient Reliable Ring Protocol. 70-82 1989 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag89.html#CohenS89 2002-10-28 Secure Computation without Agreement. 17-32 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080017.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#GoldwasserL02 2002-03-20 Exotic Behaviour of Consensus Numbers. 101-115 1994 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag94.html#CoriM94 2002-03-20 The Triumph and Tribulation of System Stabilization. 1-18 1995 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag95.html#Gouda95 2005-01-05 Local-Spin Group Mutual Exclusion Algorithms. 71-85 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=71 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#DanekH04 2005-10-26 Distributed Computing with Imperfect Randomness. 288-302 2005 DISC http://dx.doi.org/10.1007/11561927_22 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#GoldwasserSV05 2003-12-30 Tight Bounds on Early Local Decisions in Uniform Consensus. 264-278 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2848&spage=264 2003 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2003.html#DattaGP03 2002-03-20 Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version). 110-123 1989 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag89.html#GopalT89 2005-01-05 A Single-Enqueuer Wait-Free Queue Implementation. 132-143 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=132 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#David04 2002-03-20 Choice Coordination with Multiple Alternatives (Preliminary Version). 54-68 1992 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag92.html#GreenbergTW92 2005-10-26 Restricted Stack Implementations. 137-151 2005 DISC http://dx.doi.org/10.1007/11561927_12 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#DavidBF05 2005-01-05 The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems. 41-55 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=41 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#FriedmanMR04 2002-10-28 Failure Detection Lower Bounds on Registers and Consensus. 237-251 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080237.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#Delporte-GalletFG02 2002-10-28 Distributed Agreement and Its Relation with Error-Correcting Codes. 63-87 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080063.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#FriedmanMRR02 2005-10-26 (Almost) All Objects Are Universal in Message Passing Systems. 184-198 2005 DISC http://dx.doi.org/10.1007/11561927_15 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#Delporte-GalletFG05 2002-03-20 Stepwise Development of a Distributed Load Balancing Algorithms. 151-168 1990 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag90.html#GronningNL90 2002-08-19 The Arrow Distributed Directory Protocol. 119-133 http://link.springer.de/link/service/series/0558/bibs/1499/14990119.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#DemmerH98 2002-10-28 Ruminations on Domain-Based Reliable Broadcast. 148-162 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080148.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#FrolundP02 2004-07-15 Even Better DCAS-Based Concurrent Deques. 59-73 http://link.springer.de/link/service/series/0558/bibs/1914/19140059.htm 2000 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2000.html#DetlefsFGMSS00 2002-03-20 Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus. 87-100 1995 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag95.html#Guerraoui95 2002-01-03 Incremental, Distributed Orphan Detection and Actor Garbage Collection Using Graph Partitioning and Euler Cycles. 141-158 1996 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag96.html#Dickman96 2005-10-26 Polymorphic Contention Management. 303-323 2005 DISC http://dx.doi.org/10.1007/11561927_23 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#GuerraouiHP05 2002-01-03 Mobile Search for a Black Hole in an Anonymous Ring. 166-179 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800166.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#DobrevFPS01 2003-11-21 On Failure Detectors and Type Boosters. 292-305 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2848&spage=292 2003 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2003.html#GuerraouiK03 2002-03-20 Optimal Time Self Stabilization in Dynamic Systems (Preliminary Version). 160-173 1993 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag93.html#Dolev93 2005-10-26 What Can Be Implemented Anonymously? 244-259 2005 DISC http://dx.doi.org/10.1007/11561927_19 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#GuerraouiR05 2002-03-20 Theory and Practice in Distributed Systems (Abstract). 71 1995 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag95.html#Dolev95 2002-01-03 "Gamma-Accurate" Failure Detectors. 269-286 1996 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag96.html#GuerraouiS96 2005-02-02 Virtual Mobile Nodes for Mobile Ad Hoc Networks. 230-244 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=230 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#DolevGLSSW04 2002-03-20 Genuine Atomic Multicast. 141-154 1997 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag97.html#GuerraouiS97 2004-01-20 <i>Ad Hoc</i>Networks. 306-320 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2848&spage=306 2003 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2003.html#DolevGLSW03 2005-01-05 Exploiting Content Localities for Efficient Search in P2P Systems. 349-364 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=349 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#GuoJXZ04 2002-03-20 Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact). 167-180 1991 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag91.html#DolevIM91 2002-03-18 A Probabilistically Correct Leader Election Protocol for Large Groups. 89-103 http://link.springer.de/link/service/series/0558/bibs/1914/19140089.htm 2000 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2000.html#GuptaRB00 2002-03-20 Crash Resilient Communication in Dynamic Networks (Preliminary Version). 129-144 1993 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag93.html#DolevW93 2002-07-26 Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable. 116-129 1994 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag94.html#HaldarS94 2002-01-03 Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. 48-62 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800048.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#DouceurW01 2002-10-28 A Practical Multi-word Compare-and-Swap Operation. 265-279 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080265.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#HarrisFP02 2005-01-05 Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs. 365-378 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=365 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#Dourisboure04 2002-01-03 Maintaining a Dynamic Set of Processors in a Distributed System. 220-233 1996 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag96.html#FujitaY96 2002-10-28 Improved Compact Routing Scheme for Chordal Graphs. 252-264 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080252.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#DourisboureG02 2002-03-20 Notes on Sorting and Counting Networks (Extended Abstract). 234-248 1993 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag93.html#HardavellasKM93 2005-10-26 Could any Graph be Turned into a Small-World?. 511-513 2005 DISC http://dx.doi.org/10.1007/11561927_46 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#DuchonHLS05 2002-01-03 A Pragmatic Implementation of Non-blocking Linked-Lists. 300-314 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800300.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#Harris01 2005-01-05 Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. 216-229 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=216 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#DuchonHT04 2002-03-20 Observing Global States of Asynchronous Distributed Applications. 124-135 1989 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag89.html#Helary89 2002-01-03 Randomized Finite-State Distributed Algorithms as Markov Chains. 240-254 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800240.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#DuflotFP01 2002-03-20 Virtual Precedence in Asynchronous Systems: Cencept and Applications. 170-184 1997 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag97.html#HelaryMR97 2002-10-28 An Efficient Universal Construction for Message-Passing Systems. 133-147 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080133.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#DuttaFGP02 2005-01-05 Dynamic Memory ABP Work-Stealing. 188-200 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=188 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#HendlerLS04 2002-03-20 Strong Verifiable Secret Sharing (Extended Abstract). 213-227 1990 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag90.html#Dwork90 2002-10-28 The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. 339-353 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080339.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#HerlihyLM02 2002-01-03 Collective Consistency. 234-250 1996 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag96.html#DworkHS96 2003-11-21 <i>k</i>-Set Agreement with Limited-Scope Failure Detectors. 279-291 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2848&spage=279 2003 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2003.html#HerlihyP03 2002-08-19 Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. 149-160 http://link.springer.de/link/service/series/0558/bibs/1499/14990149.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#EberlyHW98 2002-08-19 A Wait-Free Classification of Loop Agreement Tasks. 175-185 http://link.springer.de/link/service/series/0558/bibs/1499/14990175.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#HerlihyR98 2002-03-18 Approximation Algorithms for Survivable Optical Networks. 104-118 http://link.springer.de/link/service/series/0558/bibs/1914/19140104.htm 2000 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2000.html#EilamMZ00 2002-01-03 A New Synchronous Lower Bound for Set Agreement. 136-150 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800136.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#HerlihyRT01 2002-01-03 A Lower Bound for Linear Interval Routing. 191-205 1996 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag96.html#EilamMZ96 2005-10-26 Distributed Transactional Memory for Metric-Space Networks. 324-338 2005 DISC http://dx.doi.org/10.1007/11561927_24 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#HerlihyS05 2002-03-20 A Simple DFS-Based Algorithm for Linear Interval Routing. 37-51 1997 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag97.html#EilamMZ97 2005-01-05 Group-Solvability. 30-40 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3274&spage=30 2004 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2004.html#Gafni04 2003-06-05 Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions. 327-341 http://link.springer.de/link/service/series/0558/bibs/1693/16930327.htm 1999 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc99.html#EleftheriouM99 2002-01-03 Self Stabilizing Distributed Queuing. 209-223 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800209.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#HerlihyT01 2005-10-26 Causing Communication Closure: Safe Program Composition with Non-FIFO Channels. 229-243 2005 DISC http://dx.doi.org/10.1007/11561927_18 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#EngelhardtM05 2002-08-19 A Stabilizing Repair Timer. 186-200 http://link.springer.de/link/service/series/0558/bibs/1499/14990186.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#Herman98 2005-10-26 An Efficient Long-Lived Adaptive Collect Algorithm. 516-518 2005 DISC http://dx.doi.org/10.1007/11561927_48 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#Englert05 2002-01-03 Stabilizing Replicated Search Trees. 315-329 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800315.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#HermanM01 2003-11-21 Efficient Replication of Large Data Objects. 75-91 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2848&spage=75 2003 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2003.html#FanL03 2005-10-26 Securing the Net: Challenges, Failures and Directions. 2 2005 DISC http://dx.doi.org/10.1007/11561927_2 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#Herzberg05 2002-01-03 Adding Networks. 330-342 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800330.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#FatourouH01 2002-03-18 Bounds for Mutual Exclusion with only Processor Consistency. 44-58 http://link.springer.de/link/service/series/0558/bibs/1914/19140044.htm 2000 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2000.html#HighamK00 2003-06-05 A New Scheduling Algorithm for General Strict Multithreaded Computations. 297-311 http://link.springer.de/link/service/series/0558/bibs/1693/16930297.htm 1999 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc99.html#FatourouS99 2002-08-19 Java: Memory Consistency and Process Coordination. 201-215 http://link.springer.de/link/service/series/0558/bibs/1499/14990201.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#HighamK98 2002-03-20 A Modular Proof of Correctness for a Network Synchronizer (Research Summary). 219-256 1987 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag87.html#FeketeLS87 2002-03-20 Generalized Scheme for Topology-Update in Dynamic Networks. 187-196 1987 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag87.html#Gafni87 2005-10-26 Reliably Executing Tasks in the Presence of Malicious Processors. 490-492 2005 DISC http://dx.doi.org/10.1007/11561927_36 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#FernandezGLS05 2002-01-03 Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks. 194-208 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800194.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#HighamL01 2002-01-03 Distributed Admission Control Algorithms for Real-Time Communication. 18-28 1996 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag96.html#Ferrari96 2002-03-20 A Simple, Efficient Algorithm for Maximum Finding on Rings. 249-263 1993 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag93.html#HighamP93 2002-03-18 Short Headers Suffice for Communication in a DAG with Link Failures. 360-373 http://link.springer.de/link/service/series/0558/bibs/1914/19140360.htm 2000 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2000.html#FichJ00 2003-11-21 Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks. 321-336 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2848&spage=321 2003 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2003.html#HildrumK03 2002-01-03 A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. 224-239 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800224.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#FichJ01 2002-01-03 Randomised Mutual Search for k>2 Agents. 180-193 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800180.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#Hoepman01 2005-10-26 Obstruction-Free Algorithms Can Be Practically Wait-Free. 78-92 2005 DISC http://dx.doi.org/10.1007/11561927_8 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#FichLMS05 2002-03-20 Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings. 265-279 1994 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag94.html#Hoepman94 2005-10-26 Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. 493-494 2005 DISC http://dx.doi.org/10.1007/11561927_37 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#FichLMS05a 2002-03-20 Self-Stabilization of Wait-Free Shared Memory Objects. 273-287 1995 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag95.html#HoepmanPT95 2006-09-29 Lower Bounds in Distributed Computing. 1-28 http://link.springer.de/link/service/series/0558/bibs/1914/19140001.htm 2000 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2000.html#FichR00 2002-03-20 Binary Snapshots. 18-25 1993 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag93.html#HoepmanT93 2002-08-19 Efficient Byzantine Agreement Secure Against General Adversaries. 134-148 http://link.springer.de/link/service/series/0558/bibs/1499/14990134.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#FitziM98 2002-10-28 Assignment-Based Partitioning in a Condition Monitoring System. 206-221 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080206.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#HuangG02 2002-03-20 Multi-Dimensional Interval Routing Schemes. 131-144 1995 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag95.html#FlamminiGNT95 2002-03-20 The Quickest Path Problem in Distributed Computing Systems. 181-192 1991 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag91.html#HungC91 2002-03-20 Boolean Routing. 219-233 1993 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag93.html#FlamminiGS93 2002-03-20 Linear-Time Snapshot Using Multi-writer Multi-reader Registers. 130-140 1994 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag94.html#InoueC94 2005-10-26 Asymptotically Optimal Solutions for Small World Graphs. 414-428 2005 DISC http://dx.doi.org/10.1007/11561927_30 http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2005.html#FlamminiMNP05 2002-03-20 Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System. 290-304 1997 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag97.html#InoueMMF97 2002-03-20 ATM Layouts with Bounded Hop Count and Congestion. 52-65 1997 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag97.html#FlamminiNP97 2002-01-03 ²²) Steps. 123-135 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800123.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#InoueUMF01 2002-03-20 A Time-Randomness Tradeoff for Communication Complexity. 390-401 1990 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag90.html#FleischerJM90 2002-10-28 Transformations of Self-Stabilizing Algorithms. 103-117 2002 DISC http://link.springer.de/link/service/series/0558/bibs/2508/25080103.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2002.html#Ioannidou02 2002-08-19 Sense of Direction in Distributed Computing. 1-15 http://link.springer.de/link/service/series/0558/bibs/1499/14990001.htm 1998 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc98.html#FlocchiniMS98 2002-03-20 Self-Stabilizing Ring Orientation. 1-14 1990 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag90.html#IsraeliJ90 2002-01-03 A Framework for the Analysis of Non-Deterministic Clock Synchronisation Algorithms. 159-174 1996 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag96.html#FonsecaM96 2002-01-03 A Low-Latency Non-blocking Commit Service. 93-107 2001 DISC http://link.springer.de/link/service/series/0558/bibs/2180/21800093.htm http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2001.html#Jimenez-PerisPAA01 2002-03-18 Disk Paxos. 330-344 http://link.springer.de/link/service/series/0558/bibs/1914/19140330.htm 2000 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2000.html#GafniL00 2002-03-20 A Concurrent Time-Stamp Scheme which is Linear in Time and Space. 95-109 1992 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag92.html#IsraeliP92 2002-03-20 Efficient Wait-Free Implementation of a Concurrent Priority Queue. 1-17 1993 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag93.html#IsraeliR93 2002-03-20 Linear-Time Snapshot Protocols for Unbalanced Systems. 26-38 1993 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag93.html#IsraeliSS93 2002-03-20 The Communication Complexity of the Two List Problem. 193-199 1991 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag91.html#Itai91 2002-03-20 Distributed Algorithms for Updating Shortest Paths (Extended Abstract). 200-211 1991 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag91.html#Italiano91 2002-03-20 Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings. 288-302 1995 WDAG http://www.informatik.uni-trier.de/~ley/db/conf/wdag/wdag95.html#ItkisLS95 2003-11-21 Compact Routing for Flat Networks. 196-210 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2848&spage=196 2003 DISC http://www.informatik.uni-trier.de/~ley/db/conf/wdag/disc2003.html#IwamaO03 2005-01-05 Synchronous Condition-Based Consensus Adapting to Input-Vector Legality.