A Statistical Theory of Chord Under Churn. - Supriya Krishnamurthy; Sameh El-Ansary; Erik Aurell; Seif Haridi (IPTPS, 2005)

Comparing Maintenance Strategies for Overlays. - Supriya Krishnamurthy; Sameh El-Ansary; Erik Aurell; Seif Haridi (PDP, 2008)

Circumspect descent prevails in solving random constraint satisfaction problems. - Mikko Alava; John Ardelius; Erik Aurell; Petteri Kaski; Supriya Krishnamurthy; Pekka Orponen; Sakari Seitz (Proc. Natl. Acad. Sci. USA, 2008)

An analytical study of a structured overlay in the presence of dynamic membership. - Supriya Krishnamurthy; Sameh El-Ansary; Erik Aurell; Seif Haridi (IEEE/ACM Trans. Netw., 2008)

Brief announcement: the accuracy of tree-based counting in dynamic networks. - Supriya Krishnamurthy; John Ardelius; Erik Aurell; Mads Dam; Rolf Stadler; Fetahi Zebenigus Wuhib (PODC, 2010)

The Accuracy of Tree-based Counting in Dynamic Networks - Supriya Krishnamurthy; John Ardelius; Erik Aurell; Mads Dam; Rolf Stadler; Fetahi Wuhib (CoRR, 2010)

Some exact calculations for K-SAT on trees - Supriya Krishnamurthy; Sumedha (CoRR, 2011)

Balanced K-SAT and Biased random K-SAT on trees - Sumedha; Supriya Krishnamurthy; Sharmistha Sahoo (CoRR, 2012)

An alternate view of complexity in k-SAT problems. - Supriya Krishnamurthy; Sumedha (CoRR, 2014)