Skip graphs

テクノロジーカテゴリーの変更を依頼記事元:

cs-www.cs.yale.edu

6 usersがブックマークコメント

記事へのコメント1件

注目コメント
新着コメント

rawwell "Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where elements are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer networks, and improve on

checkitout_research

2009/06/18 リンク

注目コメント算出アルゴリズムの一部にLINEヤフー株式会社の「建設的コメント順位付けモデルAPI」を使用しています

規約違反を報告

いまの話題をアプリでチェック！

バナー広告なし
ミュート機能あり
ダークモード搭載

アプリをダウンロード

Skip graphs

Skip Graphs James Aspnes, Gauri Shah Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ... Skip Graphs James Aspnes, Gauri Shah Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2003, pp. 384-393. Submitted to Journal of Algorithms. Abstract Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where elements are stored in separate nodes that may fail at any time.