| 2012 | ||
|---|---|---|
| i7 | Sumedha, Supriya Krishnamurthy, Sharmistha Sahoo: Balanced K-SAT and Biased random K-SAT on trees. CoRR abs/1212.1942 (2012) | |
| 2011 | ||
| i6 | Supriya Krishnamurthy, Sumedha: Some exact calculations for K-SAT on trees. CoRR abs/1110.2065 (2011) | |
| 2010 | ||
| c3 | Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, Fetahi Zebenigus Wuhib: Brief announcement: the accuracy of tree-based counting in dynamic networks. PODC 2010: 291-292 | |
| i5 | Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, Fetahi Wuhib: The Accuracy of Tree-based Counting in Dynamic Networks. CoRR abs/1004.4559 (2010) | |
| 2008 | ||
| j1 | Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, Seif Haridi: An analytical study of a structured overlay in the presence of dynamic membership. IEEE/ACM Trans. Netw. 16(4): 814-825 (2008) | |
| c2 | Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, Seif Haridi: Comparing Maintenance Strategies for Overlays. PDP 2008: 473-482 | |
| 2007 | ||
| i4 | Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, Seif Haridi: An Analytical Study of a Structured Overlay in the presence of Dynamic Membership. CoRR abs/0710.0270 (2007) | |
| i3 | Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, Seif Haridi: Comparing Maintenance Strategies for Overlays. CoRR abs/0710.0386 (2007) | |
| i2 | Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, Sakari Seitz: Circumspect descent prevails in solving random constraint satisfaction problems. CoRR abs/0711.4902 (2007) | |
| 2005 | ||
| c1 | Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, Seif Haridi: A Statistical Theory of Chord Under Churn. IPTPS 2005: 93-103 | |
| i1 | Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, Seif Haridi: A Statistical Theory of Chord under Churn. CoRR abs/cs/0501069 (2005) | |
Colors in the list of coauthors
Last update Sat May 18 14:02:44 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page