1996 |
15 | | Amotz Bar-Noy,
Ilan Kessler,
Mahmoud Naghshineh:
Topology-Based Tracking Strategies for Personal Communication Networks.
MONET 1(1): 49-56 (1996) |
1995 |
14 | EE | Israel Cidon,
Roch Guérin,
Ilan Kessler,
Asad Khamisy:
Analysis of a statistical multiplexer with generalized periodic sources.
Queueing Syst. 20(1-2): 139-169 (1995) |
13 | | Amotz Bar-Noy,
Ilan Kessler,
Moshe Sidi:
Mobile users: to update or not to update?
Wireless Networks 1(2): 175-185 (1995) |
1994 |
12 | | Israel Cidon,
Roch Guérin,
Ilan Kessler,
Asad Khamisy:
Analysis of a Statistical Multiplexer with Generalized Periodic Sources.
HPN 1994: 327-341 |
11 | | Amotz Bar-Noy,
Ilan Kessler,
Moshe Sidi:
Mobile Users: To Uptdate or not to Update?
INFOCOM 1994: 570-576 |
10 | EE | Amotz Bar-Noy,
Frank K. Hwang,
Ilan Kessler,
Shay Kutten:
A New Competitive Algorithm for Group Testing.
Discrete Applied Mathematics 52(1): 29-38 (1994) |
1993 |
9 | | Amotz Bar-Noy,
Ilan Kessler:
Tracking Mobile Users in Wireless Communication Networks.
INFOCOM 1993: 1232-1239 |
8 | | Ilan Kessler,
Moshe Sidi:
Growing binary trees in a random environment.
IEEE Transactions on Information Theory 39(1): 191- (1993) |
7 | | Amotz Bar-Noy,
Ilan Kessler:
Tracking mobile users in wireless communications networks.
IEEE Transactions on Information Theory 39(6): 1877-1886 (1993) |
6 | EE | Ilan Kessler,
Arvind Krishna:
On the cost of fairness in ring networks.
IEEE/ACM Trans. Netw. 1(3): 306-313 (1993) |
1992 |
5 | | Amotz Bar-Noy,
Ilan Kessler,
Shay Kutten,
Frank K. Hwang:
A New Competitive Algorithm for Group Testing.
INFOCOM 1992: 786-793 |
1991 |
4 | | Ilan Kessler,
Moshe Sidi:
Growing Binary Trees in a Random Environment.
INFOCOM 1991: 638-647 |
1989 |
3 | | Ilan Kessler,
Moshe Sidi:
Splitting Algorithms in Noisy Channels with Memory.
INFOCOM 1989: 136-142 |
2 | | Ilan Kessler,
Moshe Sidi:
Splitting algorithms in noisy channels with memory.
IEEE Transactions on Information Theory 35(5): 1034-1043 (1989) |
1988 |
1 | | Ilan Kessler,
Moshe Sidi:
Mixing collision resolution algorithms exploiting information of successful messages.
IEEE Transactions on Information Theory 34(3): 531-536 (1988) |