You may be using a Web browser that does not support standards for accessibility and user interaction. Find out why you should upgrade your browser for a better experience of this and other standards-based sites...
B.Tech. Indian Institute of Technology; M.S. University of Delaware; Ph.D. Cornell University
Areas of Expertise
Algorithms; computational theory; data structures
Selected Works
Jayanti, P and S Petrovic, "Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes," in Proceedings of the 7th International Workshop on Distributed Computing (IWDC) December 27-30, 2005, (2005) 45-56.
Jayanti, P and S Petrovic, "Logarithmic Time Single-deleter Multiple-inserter Wait-free Queues and Stacks," in Proceedings of FSTTCS 2005: the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, December 15-18, 2005*, (2005) 408-419.
Jayanti, P, and S Petrovic, "Efficiently Implementing a Large Number of LL/SC Objects," Ninth International Conference on Principles of Distributed Systems (OPODIS), Italy, December 12-14, 2005, http://www.cs.dartmouth.edu/reports/abstracts/TR2005-554/ (Retrieved December 2006).
Jayant, P and S Petrovic, "Efficient Wait-free Implementation of Multiword LL/SC Variables," in Proceedings of the 25th IEEE International Conference on Distributed Computing Systems(ICDCS) June 6-10, 2005 (2005) 59-68.
"An Optimal Multi-writer Snapshot Algorithm," in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC) May 22-24, 2005, (2005) 723-732.
Current Projects
"Efficient Constructions of 64-bit LL/SC Variables;" "Read/Write-based Fast Path Transformation of FCFS Mutual Exclusion;" "Group Mutual Exclusion Algorithm with Logarithmic Remote Reference Complexity"
