• Publications
  • Influence
A Additional Proofs
It can easily be shown that p j distinguishes between and 0 , and therefore, 6 = 0. We now show that 0 is unique. If B k 6 = fp j g (Case (1)), then clearly, there is another processor p i 2 B k. IfExpand
  • 3
  • 1
2011 Edsger W. Dijkstra Prize in Distributed Computing Sharing Memory Robustly in Message-passing Systems
In 1985 Fischer, Lynch, and Paterson (FLP) proved that consensus is not attainable in asynchronous message passing systems with failures. In the following years, Loui and Abu-Amara, and HerlihyExpand
A Additional Proofs 6 Discussion
It can easily be shown that p j distinguishes between and 0 , and therefore, 6 = 0. We now show that 0 is unique. If B k 6 = fp j g (Case (1)), then clearly, there is another processor p i 2 B k. IfExpand
Efficient Mechanism Design for Competitive Uplink Carrier Selection and Rate Allocation
Selection and Rate Allocation Yanting Wu, Bhaskar Krishnamachari, George Rabanca, and Amotz Bar-Noy 1. Ming Hsieh Department of Electrical Engineering, University of Southern California, Los AngelesExpand
5 Applications and Concluding Remarks Acknowledgemnt: I Wish to Thank Shmuel Zaks for His Helpful Comments
The asynchronous computability theorem for t-resilient tasks. A simple constructive computability theorem for wait-free computation. a spanning tree of G, starting (and ending) at a leaf, and thenExpand
Energy Peak Shaving with Local Storage 1
We introduce a new problem inspired by energy pricing scheme s in which a client is billed for peak usage. At each timeslot the system meets an energy demand through a combination of a new request,Expand