Search the dblp DataBase
Oran Sharon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Oran Sharon, Adrian Segall
Schemes for Slot Reuse in CRMA. [Citation Graph (0, 0)][DBLP]
Data Communication Networks and their Performance, 1993, pp:27-46 [Conf] - Oran Sharon
A Proof for Lack of Starvation in DQDB with and without Slot Reuse. [Citation Graph (0, 0)][DBLP]
INFOCOM, 1995, pp:1180-1187 [Conf] - Oran Sharon, Adrian Segall
On the Efficiency of Slot Reuse in the Dual Bus Configuration. [Citation Graph (0, 0)][DBLP]
INFOCOM, 1994, pp:758-765 [Conf] - Oran Sharon, Michael Spratt
A CSMA/CD Compatible MAC for Real-Time Transmissions Based on Varying Collision Intervals. [Citation Graph (0, 0)][DBLP]
INFOCOM, 1998, pp:1265-1272 [Conf] - Oran Sharon, Adrian Segall
A Simple Scheme for Slot Reuse without Latency in Dual Bus. [Citation Graph (0, 0)][DBLP]
Protocols for High-Speed Networks, 1992, pp:103-118 [Conf] - Oran Sharon
On the Relation between Bit Delay for Slot Reuse and the Number of Address Bits in the Dual Bus Configuration (Brief Announcement). [Citation Graph (0, 0)][DBLP]
PODC, 1997, pp:294- [Conf] - Oran Sharon, Michael Spratt
A CSMA/CD compatible MAC for real-time transmissions based on varying collision intervals. [Citation Graph (0, 0)][DBLP]
Computer Networks, 2001, v:35, n:2-3, pp:117-142 [Journal] - Oran Sharon, Adrian Segall
Session management in broadcast networks with dynamic addresses. [Citation Graph (0, 0)][DBLP]
Computer Networks, 1999, v:31, n:23-24, pp:2489-2503 [Journal] - Oran Sharon, Adrian Segall
The parallel D-Net. [Citation Graph (0, 0)][DBLP]
Computer Communications, 1995, v:18, n:8, pp:552-562 [Journal] - Oran Sharon, Anatoly Likholat
On the relation between the throughput gain with slot reuse and the number of address bits in the dual bus configuration Part 2: Linear and equal throughputs. [Citation Graph (0, 0)][DBLP]
Comput. Syst. Sci. Eng., 2002, v:17, n:4/5, pp:237-251 [Journal] - Oran Sharon, Alexander Vainshtein, Anatoly Likholat
On the relation between the throughput gain with slot reuse and the number of address bits in the dual bus configuration Part 1: Maximum throughput. [Citation Graph (0, 0)][DBLP]
Comput. Syst. Sci. Eng., 2002, v:17, n:4/5, pp:223-236 [Journal] - Oran Sharon
On the Relation Between Bit Delay for Slot Reuse and the Number of Address Bits in the Dual-Bus Configuration. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:356-365 [Journal] - Oran Sharon
A proof for lack of starvation in DQDB with and without slot reuse. [Citation Graph (0, 0)][DBLP]
IEEE/ACM Trans. Netw., 1997, v:5, n:3, pp:410-420 [Journal] - Oran Sharon, Eitan Altman
An efficient polling MAC for wireless LANs. [Citation Graph (0, 0)][DBLP]
IEEE/ACM Trans. Netw., 2001, v:9, n:4, pp:439-451 [Journal] - Oran Sharon, Adrian Segall
A simple scheme for slot reuse without latency for a dual bus configuration. [Citation Graph (0, 0)][DBLP]
IEEE/ACM Trans. Netw., 1993, v:1, n:1, pp:96-104 [Journal] - Oran Sharon, Adrian Segall
On the efficiency of slot reuse in the Dual Bus configuration. [Citation Graph (0, 0)][DBLP]
IEEE/ACM Trans. Netw., 1994, v:2, n:1, pp:89-100 [Journal] - Oran Sharon, Adrian Segall
Schemes for slot reuse in CRMA. [Citation Graph (0, 0)][DBLP]
IEEE/ACM Trans. Netw., 1994, v:2, n:3, pp:269-278 [Journal] - Amos Israeli, Dror Rawitz, Oran Sharon
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems. [Citation Graph (0, 0)][DBLP]
ESA, 2007, pp:570-581 [Conf]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002