Ilan Kessler - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

1996

Topology-Based Tracking Strategies for Personal Communication NetworksAmotz Bar-Noy, Ilan Kessler, Mahmoud Naghshineh. monet, 1(1):49-56, 1996.

1995

Mobile users: to update or not to update?Amotz Bar-Noy, Ilan Kessler, Moshe Sidi. winet, 1(2):175-185, 1995.

Analysis of a statistical multiplexer with generalized periodic sourcesIsrael Cidon, Roch Guérin, Ilan Kessler, Asad Khamisy. questa, 20(1-2):139-169, 1995. [doi]

1994

A New Competitive Algorithm for Group TestingAmotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten. DAM, 52(1):29-38, 1994. [doi]

Mobile Users: To Uptdate or not to Update?Amotz Bar-Noy, Ilan Kessler, Moshe Sidi. infocom 1994: 570-576

Analysis of a Statistical Multiplexer with Generalized Periodic SourcesIsrael Cidon, Roch Guérin, Ilan Kessler, Asad Khamisy. hpn 1994: 327-341

1993

Tracking mobile users in wireless communications networksAmotz Bar-Noy, Ilan Kessler. TIT, 39(6):1877-1886, 1993.

Tracking Mobile Users in Wireless Communication NetworksAmotz Bar-Noy, Ilan Kessler. infocom 1993: 1232-1239

Growing binary trees in a random environmentIlan Kessler, Moshe Sidi. TIT, 39(1):191, 1993.

On the cost of fairness in ring networksIlan Kessler, Arvind Krishna. ton, 1(3):306-313, 1993. [doi]

1992

A New Competitive Algorithm for Group TestingAmotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang. infocom 1992: 786-793

1991

Growing Binary Trees in a Random EnvironmentIlan Kessler, Moshe Sidi. infocom 1991: 638-647

1989

Splitting Algorithms in Noisy Channels with MemoryIlan Kessler, Moshe Sidi. infocom 1989: 136-142

Splitting algorithms in noisy channels with memoryIlan Kessler, Moshe Sidi. TIT, 35(5):1034-1043, 1989.

1988

Mixing collision resolution algorithms exploiting information of successful messagesIlan Kessler, Moshe Sidi. TIT, 34(3):531-536, 1988.

Sign in or sign up to see more results.

runs on WebDSL