找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Distributed Computing; 25th International S David Peleg Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 2011 communicati

[復(fù)制鏈接]
查看: 22913|回復(fù): 66
樓主
發(fā)表于 2025-3-21 19:51:45 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Distributed Computing
副標(biāo)題25th International S
編輯David Peleg
視頻videohttp://file.papertrans.cn/282/281792/281792.mp4
概述Fast track conference proceeding.Unique visibility.State of the art research
叢書(shū)名稱Lecture Notes in Computer Science
圖書(shū)封面Titlebook: Distributed Computing; 25th International S David Peleg Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 2011 communicati
描述This book constitutes the refereed proceedings of the 25th International Symposium on Distributed Computing, DISC 2011, held in Rome, Italy, in September 2011. The 31 revised full papers presented together with invited lectures and brief announcements were carefully reviewed and selected from 136 submissions. The papers are organized in topical sections on distributed graph algorithms; shared memory; brief announcements; fault-tolerance and security; paxos plus; wireless; network algorithms; aspects of locality; consensus; concurrency.
出版日期Conference proceedings 2011
關(guān)鍵詞communication complexity; distributed algorithms; finite state automata; local computing; reliable commu
版次1
doihttps://doi.org/10.1007/978-3-642-24100-0
isbn_softcover978-3-642-24099-7
isbn_ebook978-3-642-24100-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag GmbH Berlin Heidelberg 2011
The information of publication is updating

書(shū)目名稱Distributed Computing影響因子(影響力)




書(shū)目名稱Distributed Computing影響因子(影響力)學(xué)科排名




書(shū)目名稱Distributed Computing網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Distributed Computing網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Distributed Computing被引頻次




書(shū)目名稱Distributed Computing被引頻次學(xué)科排名




書(shū)目名稱Distributed Computing年度引用




書(shū)目名稱Distributed Computing年度引用學(xué)科排名




書(shū)目名稱Distributed Computing讀者反饋




書(shū)目名稱Distributed Computing讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:15:32 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:17:55 | 只看該作者
Beeping a Maximal Independent Setdel consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that nodes wake up asynchronously. At each time slot a node can either beep (i.e., emit a signal) or be silent. At a partic
地板
發(fā)表于 2025-3-22 05:03:49 | 只看該作者
Trading Bit, Message, and Time Complexity of Distributed Algorithmsits of information for . and Θ(.) for .. This allows to derive lower bounds on the time complexity for distributed algorithms as we demonstrate for the MIS and the coloring problems. We reduce the bit-complexity of the state-of-the art O(Δ) coloring algorithm without changing its time and message co
5#
發(fā)表于 2025-3-22 10:53:07 | 只看該作者
6#
發(fā)表于 2025-3-22 14:38:32 | 只看該作者
Physical Expander in Virtual Tree Overlayrticular in the design of robust tree overlays. Our key result can be stated as follows. Consider a complete binary tree . and construct a random pairing Π between leaf nodes and internal nodes. We prove that the graph .. obtained from . by contracting all pairs (leaf-internal nodes) achieves a cons
7#
發(fā)表于 2025-3-22 18:53:56 | 只看該作者
8#
發(fā)表于 2025-3-23 00:24:40 | 只看該作者
9#
發(fā)表于 2025-3-23 05:11:46 | 只看該作者
Brief Announcement: When You Don’t Trust Clients: Byzantine Proposer Fast Paxosonsensus. The set of Byzantine failures is so large that it has been applied for masking the effects of compromised systems, and so Byzantine-tolerant consensus has been used to construct systems that are meant to ameliorate the effect of compromise (see [1] among others). In the Byzantine model, th
10#
發(fā)表于 2025-3-23 06:13:05 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 17:57
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
即墨市| 西安市| 磐石市| 青铜峡市| 宁明县| 泰来县| 黄石市| 廊坊市| 鲁甸县| 漾濞| 通化县| 禄劝| 玛纳斯县| 石屏县| 雷山县| 定南县| 三明市| 南和县| 汉中市| 南召县| 兴城市| 潞城市| 天全县| 乳山市| 阳原县| 天全县| 长治市| 威远县| 荆门市| 呼伦贝尔市| 法库县| 锦屏县| 巴彦淖尔市| 盐边县| 松原市| 诏安县| 垦利县| 嘉定区| 梁山县| 武冈市| 凭祥市|