| 2012 | ||
|---|---|---|
| c10 | Sachin Lodha, Nikhil Patwardhan, Ashim Roy, Sharada Sundaram, Dilys Thomas: Data Privacy Using MASKETEERTM. ICTAC 2012: 151-158 | |
| 2011 | ||
| c9 | John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy: Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. CATS 2011: 31-40 | |
| 2010 | ||
| j7 | Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010) | |
| c8 | Sangameshwar Patil, Sasanka Roy, John Augustine, Amanda Redlich, Sachin Lodha, Harrick M. Vin, Anand Deshpande, Mangesh Gharote, Ankit Mehrotra: Minimizing Testing Overheads in Database Migration Lifecycle. COMAD 2010: 191 | |
| 2009 | ||
| i3 | John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy: Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks. CoRR abs/0902.3517 (2009) | |
| 2008 | ||
| i2 | Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation Algorithms for Shortest Descending Paths in Terrains. CoRR abs/0805.1401 (2008) | |
| 2007 | ||
| j6 | Sarang Aravamuthan, Sachin Lodha: The average transmission overhead for broadcast encryption. J. Mathematical Cryptology 1(4): 373 (2007) | |
| c7 | Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari: Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192 | |
| c6 | ||
| 2006 | ||
| j5 | ||
| j4 | Navin Goyal, Sachin Lodha, S. Muthukrishnan: The Graham-Knowlton Problem Revisited. Theory Comput. Syst. 39(3): 399-412 (2006) | |
| j3 | Béla Csaba, Sachin Lodha: A randomized on-line algorithm for the k-server problem on a line. Random Struct. Algorithms 29(1): 82-104 (2006) | |
| i1 | Sarang Aravamuthan, Sachin Lodha: The Average Transmission Overhead of Broadcast Encryption. IACR Cryptology ePrint Archive 2006: 324 (2006) | |
| 2005 | ||
| j2 | Murali K. Ganapathy, Sachin Lodha: Search locally to arrange cyclically. Electronic Notes in Discrete Mathematics 19: 187-193 (2005) | |
| c5 | Sarang Aravamuthan, Sachin Lodha: An Optimal Subset Cover for Broadcast Encryption. INDOCRYPT 2005: 221-231 | |
| 2004 | ||
| c4 | ||
| 2002 | ||
| j1 | Ayman Khalfalah, Sachin Lodha, Endre Szemerédi: Tight bound for the density of sequence of integers the sum of no two of which is a perfect square. Discrete Mathematics 256(1-2): 243-255 (2002) | |
| c3 | József Beck, Sachin Lodha: Efficient proper 2-coloring of almost disjoint hypergraphs. SODA 2002: 598-605 | |
| 2001 | ||
| c2 | Stefan Langerman, Sachin Lodha, Rahul Shah: Algorithms for Efficient Filtering in Content-Based Multicast. ESA 2001: 428-439 | |
| 1998 | ||
| c1 | William Aiello, Sachin Lodha, Rafail Ostrovsky: Fast Digital Identity Revocation (Extended Abstract). CRYPTO 1998: 137-152 | |
Colors in the list of coauthors
Last update Fri May 24 08:38:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page