The following publications are possibly variants of this publication:
- Self-stabilizing smoothing and balancing networksMaurice Herlihy, Srikanta Tirthapura. dc, 18(5):345-357, 2006. [doi]
- Self-Stabilizing Distributed QueuingSrikanta Tirthapura, Maurice Herlihy. tpds, 17(7):646-655, 2006. [doi]
- Self Stabilizing Distributed QueuingMaurice Herlihy, Srikanta Tirthapura. wdag 2001: 209-223 [doi]
- Randomized smoothing networksMaurice Herlihy, Srikanta Tirthapura. jpdc, 66(5):626-632, 2006. [doi]
- Randomized Smoothing NetworksMaurice Herlihy, Srikanta Tirthapura. ipps 2004: [doi]
- Competitive concurrent distributed queuingMaurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer. podc 2001: 127-133 [doi]
- Ordered Multicast and Distributed SwapMaurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer. sigops, 35(1):85-96, 2001.
- Adaptive Counting NetworksSrikanta Tirthapura. icdcs 2005: 241-250 [doi]
- Dynamic Analysis of the Arrow Distributed ProtocolMaurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer. mst, 39(6):875-901, 2006. [doi]
- Brief announcement: concurrent counting is harder than queuingSrikanta Tirthapura. podc 2003: 112 [doi]
- Concurrent counting is harder than queuingSrikanta Tirthapura, Costas Busch. ipps 2006: [doi]
- Concurrent counting is harder than queuingCostas Busch, Srikanta Tirthapura. TCS, 411(43):3823-3833, 2010. [doi]
- Scalable Subgraph Counting: The Methods Behind The MadnessComandur Seshadhri, Srikanta Tirthapura. WWW 2019: 1317-1318 [doi]
- Range-Efficient Counting of Distinct Elements in a Massive Data StreamA. Pavan, Srikanta Tirthapura. SICOMP, 37(2):359-379, 2007. [doi]