| Tài liệu tham khảo |
Loại |
Chi tiết |
| [1]. Nguyễn Đại Thọ, Các hệ phân tán, Đại học Công nghệ - ĐHQG HN, 2006 |
Sách, tạp chí |
|
| [2]. Lưu Vĩnh Toàn, Nguyễn Thúc Hải, Phát triển ứng dụng phân tán bằng công nghệ tác tử di động, Khoa Công nghệ Thông tin – Đại học Bách Khoa Hà Nội, 2000.Tiếng Anh |
Sách, tạp chí |
| Tiêu đề: |
Phát triển ứng dụng phân tán bằng công nghệ tác tử di động |
|
| [3]. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, In: Proc. 19th ACM Symp. on Theory of Computing, 1987 |
Sách, tạp chí |
| Tiêu đề: |
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems |
|
| [4]. C. L. Michael, A. M. Teresa, B.W. Douglas, Election in a complete network with a sense of direction, Inf. Process.Lett, 1988 |
Sách, tạp chí |
| Tiêu đề: |
Election in a complete network with a sense of direction |
|
| [5]. D. Kempe, A. Dobra, and J. Gehrke, Computing aggregate information using gossip, Foundations of Computer Science, October 2003 |
Sách, tạp chí |
| Tiêu đề: |
Computing aggregate information using gossip |
|
| [6]. E. Korach, S. Moran, S.Zaks, Optimal lower bounds for some distributed algorithms for a complete network of processors, Theoretical Computer Science, 1989 |
Sách, tạp chí |
| Tiêu đề: |
Optimal lower bounds for some distributed algorithms for a complete network of processors |
|
| [7]. E. Kranakis, D. Krizanc, S. Rajsbaum, Mobile agent rendezvous: A survey, Proceedings of the 13rd Colloquium on Structural Information andCommunication Complexity, 2007 |
Sách, tạp chí |
| Tiêu đề: |
Mobile agent rendezvous: A survey |
|
| [8]. Gurdip Singh, Arthur. J. Bernstein, A highly asynchronous minimum spanning tree protocol, Distributed Computing, Springer Verlag 8(3), 1995 |
Sách, tạp chí |
| Tiêu đề: |
A highly asynchronous minimum "spanning tree protocol |
|
| [9]. Gurdip Singh, Efficient leader election using sense of direction, Distributed Computing, 1997 |
Sách, tạp chí |
| Tiêu đề: |
Efficient leader election using sense of direction |
|
| [10]. Gurdip Singh, Leader election in complete networks, SIAM J. Comput, 1997 |
Sách, tạp chí |
| Tiêu đề: |
Leader election in complete networks |
|
| [11]. Hagit Attiya, Jenifer Welch, Distributed computing: Fundamentals, simulations and advanced topics, Second Edition, John Wiley & Sons, 2004 |
Sách, tạp chí |
| Tiêu đề: |
Distributed computing: Fundamentals, "simulations and advanced topics |
|
| [12]. J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger, Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance, Springer-Verlag, 2005 |
Sách, tạp chí |
| Tiêu đề: |
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance |
|
| [13]. J. Villadangos, A. Cordoba, F. Farina, M. Prieto, Efficient leader election in complete networks, Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004 |
Sách, tạp chí |
| Tiêu đề: |
Efficient leader election in complete networks |
|
| [14]. L. Barriere, P. Flocchini, P. Fraigniaud, N. Santoro, Rendezvous and election of mobile agents: Impact of sense of direction, Theory of Computing Systems, 2007 |
Sách, tạp chí |
| Tiêu đề: |
Rendezvous and election of mobile agents: Impact of sense of direction |
|
| [15]. M.C. Loui, T.A. Matsushita, D.B. West, Election in complete networks with sense of direction, Information Processing Letters, 1986 |
Sách, tạp chí |
| Tiêu đề: |
Election in complete networks with sense of direction |
|
| [16]. N. Roy and G. Dudek, Collaborative robot exploration and rendezvous: Algorithms, performance bounds and observations, Autonomous Robots, 2001 |
Sách, tạp chí |
| Tiêu đề: |
Collaborative robot exploration and rendezvous: "Algorithms, performance bounds and observations |
|
| [17]. N. Santoro, Design and Analysis of Distributed Algorithms, Wiley Interscience, 2007 |
Sách, tạp chí |
| Tiêu đề: |
Design and Analysis of Distributed Algorithms |
|
| [18]. P. Flocchini, B. Mans, N. Santoro, Sense of direction in distributed computing, Theoretical Computer Science, 2003 |
Sách, tạp chí |
| Tiêu đề: |
Sense of direction in distributed computing |
|
| [19]. R.G. Gallager, P.A. Humblet, P.M. Spira, A distributed algorithm for minimum-weight spanning tree, ACM Transactions on Programming Languages and Systems, 1983 |
Sách, tạp chí |
| Tiêu đề: |
A distributed algorithm for minimum-weight spanning tree |
|
| [20]. S. Alpern, The Rendezvous Search Problem, SIAM Journal of Control and Optimization, 1995 |
Sách, tạp chí |
| Tiêu đề: |
The Rendezvous Search Problem |
|