Ilan Kessler - RankMe

15 papers A* 5Journal 9Unranked 1

Year	Rank	Type	Title / Venue / Authors
1996	J	`jnl`	Topology-Based Tracking Strategies for Personal Communication Networks. Mob. Networks Appl. Amotz Bar-Noy, Ilan Kessler, Mahmoud Naghshineh
1995	J	`jnl`	Analysis of a statistical multiplexer with generalized periodic sources. Queueing Syst. Theory Appl. Israel Cidon, Roch Guérin, Ilan Kessler, Asad Khamisy
1995	J	`jnl`	Mobile users: to update or not to update? Wirel. Networks Amotz Bar-Noy, Ilan Kessler, Moshe Sidi
1994	J	`jnl`	A New Competitive Algorithm for Group Testing. Discret. Appl. Math. Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten
1994	—	`conf`	Analysis of a Statistical Multiplexer with Generalized Periodic Sources. HPN Israel Cidon, Roch Guérin, Ilan Kessler, Asad Khamisy
1994	A*	`conf`	Mobile Users: To Uptdate or not to Update? INFOCOM Amotz Bar-Noy, Ilan Kessler, Moshe Sidi
1993	J	`jnl`	Growing binary trees in a random environment. IEEE Trans. Inf. Theory Ilan Kessler, Moshe Sidi
1993	J	`jnl`	On the cost of fairness in ring networks. IEEE/ACM Trans. Netw. Ilan Kessler, Arvind Krishna
1993	A*	`conf`	Tracking Mobile Users in Wireless Communication Networks. INFOCOM Amotz Bar-Noy, Ilan Kessler
1993	J	`jnl`	Tracking mobile users in wireless communications networks. IEEE Trans. Inf. Theory Amotz Bar-Noy, Ilan Kessler
1992	A*	`conf`	A New Competitive Algorithm for Group Testing. INFOCOM Amotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang
1991	A*	`conf`	Growing Binary Trees in a Random Environment. INFOCOM Ilan Kessler, Moshe Sidi
1989	A*	`conf`	Splitting Algorithms in Noisy Channels with Memory. INFOCOM Ilan Kessler, Moshe Sidi
1989	J	`jnl`	Splitting algorithms in noisy channels with memory. IEEE Trans. Inf. Theory Ilan Kessler, Moshe Sidi
1988	J	`jnl`	Mixing collision resolution algorithms exploiting information of successful messages. IEEE Trans. Inf. Theory Ilan Kessler, Moshe Sidi