@inproceedings{43f828cfe0154759a90d2daee1cc1422,
title = "Wakeup problem",
abstract = "We study a new problem, the wakeup problem, that seems to be very fundamental in distributed computing. We present efficient solutions to the problem and show how these solutions can be used to solve the consensus problem, the leader election problem, and other related problems. The main question we try to answer is, how much memory is needed to solve the wakeup problem? We assume a model that captures important properties of real systems that have been largely ignored by previous work on cooperative problems.",
author = "Fischer, \{Michael J.\} and Shlomo Moran and Steven Rudich and Gadi Taubenfeld",
year = "1990",
doi = "10.1145/100216.100228",
language = "אנגלית",
isbn = "0897913612",
series = "Proceedings of the twenty-second annual ACM symposium on Theory of Computing",
publisher = "Publ by ACM",
pages = "106--116",
booktitle = "Proceedings of the twenty-second annual ACM symposium on Theory of Computing",
note = "22nd Annual ACM Symposium on Theory of Computing, STOC 1990 ; Conference date: 14-05-1990 Through 16-05-1990",
}