James Aspnes, Maurice Herlihy & Nir Shavit (1994):
Counting networks.
J. ACM 41(5),
pp. 1020–1048,
doi:10.1145/185675.185815.
Hagit Attiya, Vincent Gramoli & Alessia Milani (2010):
A provably starvation-free distributed directory protocol.
In: SSS,
pp. 405–419,
doi:10.1007/978-3-642-16023-3_33.
B. Awerbuch & D. Peleg (1990):
Sparse partitions.
In: FOCS,
pp. 503–513 vol.2,
doi:10.1109/FSCS.1990.89571.
Costas Busch & Srikanta Tirthapura (2010):
Concurrent counting is harder than queuing.
Theor. Comput. Sci. 411(43),
pp. 3823–3833,
doi:10.1016/j.tcs.2010.07.002.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein (2009):
Introduction to Algorithms, Third Edition,
3rd edition.
The MIT Press.
Michael J. Demmer & Maurice Herlihy (1998):
The Arrow Distributed Directory Protocol.
In: DISC,
pp. 119–133,
doi:10.1007/BFb0056478.
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun & Emanuele Viola (2013):
On the Complexity of Information Spreading in Dynamic Networks.
In: SODA,
pp. 717–736.
Available at http://knowledgecenter.siam.org/0236-000128/.
Bernhard Haeupler & David Karger (2011):
Faster information dissemination in dynamic networks via network coding.
In: PODC,
pp. 381–390,
doi:10.1145/1993806.1993885.
Bernhard Haeupler & Fabian Kuhn (2012):
Lower bounds on information dissemination in dynamic networks.
In: DISC,
pp. 166–180,
doi:10.1007/978-3-642-33651-5_12.
Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura & Roger Wattenhofer (2006):
Dynamic Analysis of the Arrow Distributed Protocol.
Theor. Comp. Syst. 39(6),
pp. 875–901,
doi:10.1007/s00224-006-1251-9.
Maurice Herlihy & Ye Sun (2007):
Distributed transactional memory for metric-space networks.
Distrib. Comput. 20(3),
pp. 195–208,
doi:10.1007/s00446-007-0037-x.
Maurice Herlihy, Srikanta Tirthapura & Roger Wattenhofer (2001):
Competitive concurrent distributed queuing.
In: PODC,
pp. 127–133,
doi:10.1145/383962.384001.
Fabian Kuhn, Nancy Lynch & Rotem Oshman (2010):
Distributed computation in dynamic networks.
In: STOC,
pp. 513–522,
doi:10.1145/1806689.1806760.
Fabian Kuhn, Yoram Moses & Rotem Oshman (2011):
Coordinated consensus in dynamic networks.
In: PODC,
pp. 1–10,
doi:10.1145/1993806.1993808.
Fabian Kuhn & Rotem Oshman (2011):
Dynamic networks: models and algorithms.
SIGACT News 42(1),
pp. 82–96,
doi:10.1145/1959045.1959064.
Kai Li & Paul Hudak (1989):
Memory coherence in shared virtual memory systems.
ACM Trans. Comput. Syst. 7(4),
pp. 321–359,
doi:10.1145/75104.75105.
M. Luby (1985):
A simple parallel algorithm for the maximal independent set problem.
In: STOC,
pp. 1–10,
doi:10.1145/22145.22146.
Mohamed Naimi, Michel Trehel & André Arnold (1996):
A log (N) distributed mutual exclusion algorithm based on path reversal.
J. Parallel Distrib. Comput. 34(1),
pp. 1–13,
doi:10.1006/jpdc.1996.0041.
Regina O'Dell & Roger Wattenhofer (2005):
Information dissemination in highly dynamic graphs.
In: FOMC,
pp. 104–110,
doi:10.1145/1080810.1080828.
Kerry Raymond (1989):
A tree-based algorithm for distributed mutual exclusion.
ACM Trans. Comput. Syst. 7(1),
pp. 61–77,
doi:10.1145/58564.59295.
Gokarna Sharma & Costas Busch (2012):
Towards load balanced distributed transactional memory.
In: Euro-Par,
pp. 403–414,
doi:10.1007/978-3-642-32820-6_41.
Gokarna Sharma & Costas Busch (2013):
An Analysis Framework for Distributed Hierarchical Directories.
In: ICDCN,
pp. 378–392,
doi:10.1007/978-3-642-35668-1_26.
Gokarna Sharma, Costas Busch & Srivathsan Srinivasagopalan (2012):
Distributed Transactional Memory for General Networks.
In: IPDPS,
pp. 1045–1056,
doi:10.1109/IPDPS.2012.97.
Srikanta Tirthapura & Maurice Herlihy (2006):
Self-Stabilizing Distributed Queuing.
Trans. Parallel Distrib. Syst. 17(7),
pp. 646–655,
doi:10.1109/TPDS.2006.94.
Roger Wattenhofer & Peter Widmayer (1998):
An inherent bottleneck in distributed counting.
J. Parallel Distrib. Comput. 49(1),
pp. 135–145,
doi:10.1006/jpdc.1998.1431.
Bo Zhang & Binoy Ravindran (2009):
Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory.
In: OPODIS,
pp. 48–53,
doi:10.1007/978-3-642-10877-8_6.
eptcs@eptcs.org