M. Naor and U.Weider. Scalable and dynamic quorum systems. In Proc. of the 22th Annual ACM Symposium on Principles of Distributed Computing (PODC'03), pages 114--122, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fault-Tolerant Storage in a Dynamic Environment - Nadav, Naor (2004) Self-citation (Naor) (Correct)
No context found.
M.Naor and U.Wieder, Scalable and dynamic quorum systems, Proc. PODC 03.
Routing Complexity of Faulty Networks - Angel, Benjamini, Ofek, Wieder (2004) Self-citation (Wieder) (Correct)
No context found.
M. Naor and U. Wieder. Scalable and dynamic quorum systems. In ACM Conf. on Principles of Distributed Computing (PODC), 2003.
Routing Complexity of Faulty Networks - Angel, Benjamini, Ofek, Wieder (2004) Self-citation (Wieder) (Correct)
No context found.
M. Naor and U. Wieder. Scalable and dynamic quorum systems. In ACM Conf. on Principles of Distributed Computing (PODC), 2003.
Novel Architectures for P2P Applications: the.. - Naor, Wieder (2002) (23 citations) Self-citation (Naor Wieder) (Correct)
....they can update their tables. The way a processor chooses its location in Step (1) determines the smoothness of the construction. Techniques similar in spirit to those of Section 4 may guarantee smoothness. The relation between variants of the Join algorithm and the smoothness is discussed in [20]. 5.2 Constructing Expanders Expander graphs are graphs that are very well connected in the sense that for every set of vertices S of size at most V there are at least # S vertices in V S that are adjacent to some vertex in S. In this case we say the expansion of the graph is #. An ....
M. Naor and U. Wieder. Scalable and dynamic quorum systems. In ACM Conf. on Principles of Distributed Computing (PODC), 2003.
Novel Architectures for P2P Applications: the.. - Naor, Wieder (2003) (23 citations) Self-citation (Naor Wieder) (Correct)
....they can update their tables. The way a processor chooses its location in Step (1) determines the smoothness of the construction. Techniques similar in spirit to those of Section 4 may guarantee smoothness. The relation between variants of the Join algorithm and the smoothness is discussed in [20]. 5.2 Constructing Expanders Expander graphs are graphs that are very well connected in the sense that for every set of vertices S of size at most 2 jV j there are at least jSj vertices in V nS that are adjacent to some vertex in S. In this case we say the expansion of the graph is . An ....
M. Naor and U. Wieder. Scalable and dynamic quorum systems. In ACM Conf. on Principles of Distributed Computing (PODC), 2003.
An Architecture for Dynamic Scalable Self-Managed.. - Anceaume, Friedman, .. (2004) (Correct)
No context found.
M. Naor and U.Weider. Scalable and dynamic quorum systems. In Proc. of the 22th Annual ACM Symposium on Principles of Distributed Computing (PODC'03), pages 114--122, 2003.
Probabilistic Quorums for Dynamic Systems (Extended Abstract) - Abraham, Malkhi (2003) (Correct)
No context found.
M. Naor and U. Wieder. Scalable and Dynamic Quorum Systems. In proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), June 2003.
Probabilistic Quorums for Dynamic Systems - Abraham, Malkhi (2003) (6 citations) (Correct)
No context found.
M. Naor and U. Wieder. Scalable and Dynamic Quorum Systems. In proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), June 2003. Ittai Abraham and Dahlia Malkhi
An Architecture for Dynamic Scalable Self-Managed Distributed.. - Anceaume, al. (2004) (Correct)
No context found.
M. Naor and U.Weider. Scalable and dynamic quorum systems. In Proc. of the 22th Annual ACM Symposium on Principles of Distributed Computing (PODC'03), pages 114--122, 2003.
Probabilistic Quorums for Dynamic Systems - Abraham, Malkhi (2003) (6 citations) (Correct)
No context found.
M. Naor and U. Wieder. Scalable and Dynamic Quorum Systems. In proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003.
Probabilistic Quorums for Dynamic Systems - Dahlia Malk Hi (2003) (Correct)
No context found.
M. Naor and U. Wieder. Scalable and Dynamic Quorum Systems. In proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC