Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

A Additional Proofs

- References, H Attiya, A. Bar-Noy, D. Dolev, D. Peleg, R. Reischuk
- 1998

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. If… Expand

- 3
- 1

2011 Edsger W. Dijkstra Prize in Distributed Computing Sharing Memory Robustly in Message-passing Systems

- E. Dijkstra, H. Attiya, A. Bar-Noy, D. Dolev
- 2011

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 Herlihy… Expand

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. If… Expand

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 Angeles… Expand

5 Applications and Concluding Remarks Acknowledgemnt: I Wish to Thank Shmuel Zaks for His Helpful Comments

- R. Abd, H Attiya, A. Bar-Noy, D. Dolev, D. Pe
- 1995

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 then… Expand

MediaScope: selective on-demand media retrieval from mobile devices

- Yurong Jiang, Xing Xu, Peter Terlecky, T. Abdelzaher, A. Bar-Noy, R. Govindan
- Computer Science
- IPSN
- 2013

Energy Peak Shaving with Local Storage 1

- M. Johnson, A. Bar-Noy, Ou Liu, Y. Feng
- 2011

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