“Efficient projections onto the l1-ball for learning in high dimensions”, John Duchi, Shai Shalev-Shwartz, Yoram Singer, Tushar Chandra, ICML '08: Proceedings of the 25th international conference on Machine learning, 2008, pp. 272-279.
[doi.acm.org] [search]
“Paxos Made Live - An Engineering Perspective (2006 Invited Talk)”, Tushar Deepak Chandra, Robert Griesemer, Joshua Redstone, Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, 2007.
[abstract] [chandrakin.com] [search]
“Bigtable: A Distributed Storage System for Structured Data”, Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber, 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2006, pp. 205-218.
[research.google.com] [search]
“Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus”, Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg, SIAM J. Comput., vol. 34 (2004), pp. 333-357.
[epubs.siam.org] [search]
“On scalable and efficient distributed failure detectors”, Indranil Gupta, Tushar Deepak Chandra, Germán S. Goldszmidt, PODC, 2001, pp. 170-179.
[doi.acm.org] [search]
“A Case for Message Oriented Middleware”, Guruduth Banavar, Tushar Deepak Chandra, Robert E. Strom, Daniel C. Sturman, DISC, 1999, pp. 1-18.
[link.springer.de] [search]
“An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems”, Guruduth Banavar, Tushar Deepak Chandra, Bodhi Mukherjee, Jay Nagarajarao, Robert E. Strom, Daniel C. Sturman, ICDCS, 1999, pp. 262-272.
[computer.org] [search]
“Matching Events in a Content-Based Subscription System”, Marcos Kawazoe Aguilera, Robert E. Strom, Daniel C. Sturman, Mark Astley, Tushar Deepak Chandra, PODC, 1999, pp. 53-61.
[doi.acm.org] [search]
“The Cost of Graceful Degradation for Omission Failures”, Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg, Inf. Process. Lett., vol. 71 (1999), pp. 167-172.
[doi] [search]
“A Polylog Time Wait-Free Construction for Closed Objects”, Tushar Deepak Chandra, Prasad Jayanti, King Tan, PODC, 1998, pp. 287-296.
[doi.acm.org] [search]
“Fault-Tolerant Wait-Free Shared Objects”, Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg, J. ACM, vol. 45 (1998), pp. 451-500.
[doi.acm.org] [search]
“Gryphon: An Information Flow Based Approach to Message Brokering”, Robert E. Strom, Guruduth Banavar, Tushar Deepak Chandra, Marc Kaplan, Kevan Miller, Bodhi Mukherjee, Daniel C. Sturman, Michael Ward, CoRR, vol. cs.DC/9810019 (1998).
[arxiv.org] [search]
“On the Impossibility of Group Membership”, Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg, PODC, 1996, pp. 322-330.
[search]
“Polylog Randomized Wait-Free Consensus”, Tushar Deepak Chandra, PODC, 1996, pp. 166-175.
[search]
“The Weakest Failure Detector for Solving Consensus”, Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg, J. ACM, vol. 43 (1996), pp. 685-722.
[search]
“Unreliable Failure Detectors for Reliable Distributed Systems”, Tushar Deepak Chandra, Sam Toueg, J. ACM, vol. 43 (1996), pp. 225-267.
[search]
“Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies”, Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg, PODC, 1994, pp. 334-343.
[search]
“Fault-tolerant Wait-free Shared Objects”, Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg, FOCS, 1992, pp. 157-166.
[search]
“The Weakest Failure Detector for Solving Consensus”, Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg, PODC, 1992, pp. 147-158.
[search]
“Unreliable Failure Detectors for Asynchronous Systems (Preliminary Version)”, Tushar Deepak Chandra, Sam Toueg, PODC, 1991, pp. 325-340.
[search]
“Time and Message Efficient Reliable Broadcasts”, Tushar Deepak Chandra, Sam Toueg, WDAG, 1990, pp. 289-303.
[search]