P. Jayanti. Optimal Multi-writer Snapshot Algorithm. Submitted to Forty-fifth Annual IEEE Symposium on Foundations of Computer Science (FOCS) in April 2004.
P. Jayanti and S. Petrovic. Towards Efficient Wait-Free Queues and Stacks. Submitted to Forty-fifth Annual IEEE Symposium on Foundations of Computer Science (FOCS) in April 2004.
P. Jayanti and S. Petrovic. Efficient and Practical Construction of LL/SC Variables. Submitted to a special issue of Distributed Computing in December 2003.
P. Jayanti. Adaptive and Efficient Abortable Mutual Exclusion. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), July 2003, pages 295-304.
P. Jayanti and S. Petrovic. Efficient and Practical Constructions of LL/SC Variables. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), July 2003, pages 285-294.
P. Jayanti, S. Petrovic and K. Y. Tan. Fair Group Mutual Exclusion. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), July 2003, pages 275-284.
T. D. Chandra, V. Hadzilacos, P. Jayanti, and S. Toueg. Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus. Accepted for publication in SIAM Journal on Computing.
P. Jayanti. f-Arrays: Implementations and Applications. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC), July 2002.
P. Jayanti, K. Y. Tan, G. Friedland and A. Katz. Bounding Lamport's Bakery Algorithm. In Proceedings of SOFSEM 2001: the 28th Conference on Current Trends in Theory and Practice of Informatics, November/December 2001, Lecture Notes in Computer Science 2234, Springer.
P. Jayanti, K. Y. Tan and S. Toueg. Time and Space Lower Bounds for Nonblocking Implementations. SIAM Journal on Computing, 2000, Volume 30, Number 2, Pages 438-456.
P. Jayanti, J. E. Burns, and G. L. Peterson. Almost Optimal Single Reader Single Writer Atomic Register. Journal of Parallel and Distributed Computing (JPDC), 2000, Volume 60, pages 150-168.
P. Jayanti, T. D. Chandra, and S. Toueg. The Cost of Graceful Degradation for Omission Failures. Information Processing Letters (IPL), 1999, Volume 71, pages 167-172.
P. Jayanti. Solvability of Consensus: Composition Breaks Down for Nondeterministic Types. SIAM Journal on Computing, 1998, Volume 28, Number 3, Pages 782-797.
P. Jayanti. A Complete and Constant Time Wait-free Implementation of CAS from LL/SC and Vice Versa. In Proceedings of the 12th International Symposium on Distributed Computing (DISC), September 1998, Lecture Notes in Computer Science 1499, Springer.
P. Jayanti. A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), June 1998.
P. Jayanti. A Lower Bound on Local Time Complexity of Universal Constructions. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), June 1998.
T. D. Chandra, P. Jayanti, and K. Y. Tan. A Polylogarithmic Time Wait-Free Construction for Closed Objects. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), June 1998.
P. Jayanti, T. D. Chandra, and S. Toueg. Fault-Tolerant Wait-Free Shared Objects. Journal of ACM (JACM), May 1998, Volume 45, Number 3, pages 451-500.
P. Jayanti and S. Khanna. On the Power of Multi-Objects. In Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG), September 1997, Lecture Notes in Computer Science 1320, Springer.
P. Jayanti. Robust Wait-Free Hierarchies. Journal of ACM (JACM), July 1997, Volume 44, Number 4, pages 592-614.
P. Jayanti, K. Y. Tan, and S. Toueg. Time and Space Lower Bounds for Non-Blocking Implementations. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), May 1996.
T. D. Chandra, V. Hadzilacos, P. Jayanti, and S. Toueg. Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), August 1994.
P. Jayanti. On the Robustness of Herlihy's Hierarchy. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC), August 1993.
P. Jayanti and S. Toueg. Some Results on the Impossibility, Universality, and Decidability of Consensus. In Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG), November 1992, Lecture Notes in Computer Science 647, Springer-Verlag.
P. Jayanti, T. D. Chandra, and S. Toueg. Fault-Tolerant Wait-Free Shared Objects. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), October 1992.
P. Jayanti, E. L. Lloyd, and A. S. Sethi. Complexity of Concurrent Reading and Writing. In Proceedings of the 5th International Workshop on Distributed Algorithms (WDAG), October 1991, Lecture Notes in Computer Science 579, Springer-Verlag.
P. Jayanti and S. Toueg. Wakeup under Read/Write Atomicity. In Proceedings of the 4th International Workshop on Distributed Algorithms (WDAG), September 1990, Lecture Notes in Computer Science 486, Springer-Verlag.