Distributed computing through combinatorial topology
Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, su...
שמור ב:
| מחבר ראשי: | |
|---|---|
| מחברים אחרים: | |
| שפה: | Undetermined English |
| יצא לאור: |
Amsterdam
Morgan Kaufmann, is an imprint of Elsevier
|
| נושאים: | |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Trà Vinh |
|---|