Notes on Theory of Distributed Systems CPSC 465/565: Fall 2017
Notes on Theory of Distributed Systems James Aspnes 2024-03-03 16:06 i Copyright © 2002–2023 by James Aspnes. Distributed under a Cre- ative Commons Attribution-ShareAlike 4.0 International license: https: //creativecommons.org/licenses/by-sa/4.0/. Contents Table of contents ii List of figures xvi List of tables xvii List of algorithms xviii Preface xxiii 1 Introduction 1 1.1 Models . . . . . . .
Counting networks
James Aspnes, Maurice Herlihy, and Nir Shavit. Counting networks. Journal of the Association for Computing Machinery 41(5):1020–1048, September 1994. An earlier version appeared in Twenty-Third Annual ACM Symposium on Theory of Computing, May 1991, pp. 348–358, under the title “Counting networks and multiprocessor coordination.” Abstract Many fundamental multi-processor coordination problems can b
Exposing computationally-challenged Byzantine impostors
James Aspnes, Collin Jackson, and Arvind Krishnamurthy. Exposing computationally-challenged Byzantine impostors. Available as YALEU/DCS/TR-1332, July 2005. Abstract Internet protocols permit a single machine to masquerade as many, allowing an adversary to appear to control more nodes than it actually does. The possibily of such Sybil attacks has been taken to mean that distributed algorithms that
Broadcast
Note: You are looking at a static copy of the former PineWiki site, used for class notes by James Aspnes from 2003 to 2012. Many mathematical formulas are broken, and there are likely to be other bugs as well. These will most likely not be fixed. You may be able to find more up-to-date versions of some of these notes at http://www.cs.yale.edu/homes/aspnes/#classes. For more up-to-date notes see ht
pram.dvi
COMP 203: Parallel and Distributed Computing PRAM Algorithms Siddhartha Chatterjee Jan Prins Spring 2002 Contents 1 The PRAM model of computation 2 The Work-Time paradigm 2.1 Brent’s Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 Designing good parallel algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Basi
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
DepthFirstSearch
http://www.cs.yale.edu/publications/techreports/tr1049.pdf
http://www.cs.yale.edu/homes/el327/datamining2013aFiles/07_singular_value_decomposition.pdf
http://www.cs.yale.edu/homes/el327/papers/lowRankMatrixApproximation.pdf
http://www.cs.yale.edu/publications/techreports/tr1022.pdf
