Patent

[P1] William Aiello, Sachin Lodha and Rafail Ostrovsky. A Method for Efficiently Revoking Digital Identities. US Patent 6397329, May 2002.

Journal Publications

[J3] Murali K Ganapathy and Sachin Lodha. On Minimum Circular Arrangement. Submitted. [Abstract PS PDF].
[J2] Béla Csaba and Sachin Lodha. A Randomized Online Algorithm for the k-Server Problem on a Line. Submitted. [Abstract PS PDF].
[J1] Ayman Khalfalah, Sachin Lodha and 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. [Abstract PS PDF].

Conference Publications

[C5] Navin Goyal, Sachin Lodha and Muthu Muthukrishnan. The Graham-Knowlton Problem Revisited. Accepted for FUN 2004, The 3rd International Conference on Fun with Algorithms. [Abstract PS PDF].
[C4] Murali K Ganapathy and Sachin Lodha. On Minimum Circular Arrangement. In Proceedings of 21st Annual Symposium on Theoretical Computer Science (STACS), 2004, pp 394--405. [Abstract PS PDF].
[C3] József Beck and Sachin Lodha. Efficient Proper 2-coloring of Almost Disjoint Hypergraphs. In Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp 598--605. [Abstract PS PDF].
[C2] Stefan Langerman, Sachin Lodha and Rahul Shah. Algorithms for Efficient Filtering in Content-Based Multicast. Algorithms - ESA 2001, Lecture Notes in Computer Science, Springer, Vol. 2161, 2001, pp 428--439. This paper won The Best Student Paper Award in ESA 2001. [Abstract PS PDF].
[C1] William Aiello, Sachin Lodha and Rafail Ostrovsky. Fast Digital Identity Revocation. Advances in Cryptology - CRYPTO'98, Lecture Notes in Computer Science, Springer-Verlag, Vol. 1462, 1998, pp 137--152. [Abstract PS PDF].

Technical Reports

[T1] Béla Csaba and Sachin Lodha. List Update Problem. DIMACS Technical Report 98-44, 1998. [Abstract PS PDF].