Andrew Adler

According to our database, Andrew Adler authored at least 7 papers between 1986 and 1997.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1997

Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings.

Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler

J. Algorithms, 1997

1994

Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings.

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

J. ACM, 1994

1991

Probabilistic Leader Election on Rings of Known Size.

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

Proceedings of the Algorithms and Data Structures, 1991

1989

The Bit Complexity of Randomized Leader Election on a Ring.

Karl R. Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, David G. Kirkpatrick

SIAM J. Comput., 1989

Randomized Function Evaluation on a Ring.

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

Distributed Comput., 1989

1987

Randomized Function on a Ring (Preliminary Version).

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

Proceedings of the Distributed Algorithms, 1987

1986

Probabilistic Solitude Verification on a Ring.

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986