Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing最新文献

Brief announcement: secret sharing based on the social behaviors of players 简短声明:基于玩家社交行为的秘密分享

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835754

Mehrdad Nojoumian, Douglas R Stinson

引用次数: 14

Expansion and the cover time of parallel random walks 并行随机游动的扩展和覆盖时间

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835776

Thomas Sauerwald

引用次数: 8

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing 第29届ACM SIGACT-SIGOPS分布式计算原理研讨会论文集

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698

A. Richa, R. Guerraoui

{"title":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","authors":"A. Richa, R. Guerraoui","doi":"10.1145/1835698","DOIUrl":"https://doi.org/10.1145/1835698","url":null,"abstract":"This volume contains 39 regular papers and 48 brief announcements selected for the on Principles of Distributed Computing, held on July 25-28 in Zurich, Switzerland. 179 papers were submitted to the regular papers track, and 57 were submitted to the brief announcements track. The selection of papers was done by the program committee in a meeting that took place in EPFL, Lausanne, on April 9, 2010, following electronic discussions. Richard van de Stadt handled the electronic submissions and discussions with CyberChairPro. \u0000 \u0000This volume also includes abstracts of keynotes by Hagit Attiya, Eric Brewer and Pierre Fraigniaud. The conference also hosted the 60th birthday celebration of Danny Dolev and Eli Gafni, with talks from Hagit Attiya, Yehuda Afek, Amotz Bar-Noy, Idit Keidar, Rachid Guerraoui, Michael Merritt, Sergio Rajsbaum and Nir Shavit. \u0000 \u0000It is expected that many of these papers will appear in more polished form in refereed journals. A selection of papers has been invited to appear in the Journal of the ACM and a special issue of Distributed Computing dedicated to PODC 2010. The program committee decided to share the best paper award between two papers: Deterministic Distributed Vertex Coloring in Polylogarithmic Time by Barenboim and Elkin, and Breaking the O(n2) Bit Barrier: Scalable Byzantine Agreement with an Adaptive Adversary, by Saia and King.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130398097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Forbidden-set distance labels for graphs of bounded doubling dimension 有界倍维图的禁止集距离标记

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835743

Ittai Abraham, S. Chechik, C. Gavoille, D. Peleg

引用次数: 3

Brief announcement: communication efficient asynchronous byzantine agreement 简短公告:通信高效异步拜占庭协议

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835756

A. Patra, C. Rangan

引用次数: 9

Brief announcement: realizing secure multiparty computation on incomplete networks 简要公告:在不完全网络上实现安全多方计算

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835752

Shailesh Vaya

{"title":"Brief announcement: realizing secure multiparty computation on incomplete networks","authors":"Shailesh Vaya","doi":"10.1145/1835698.1835752","DOIUrl":"https://doi.org/10.1145/1835698.1835752","url":null,"abstract":"We consider a recently proposed model for secure computation appropriate to the setting of low degree networks called almost everywhere secure computation. This model of multiparty computation allows a few honest parties to not achieve the canonical guarantees of Correctness and Privacy. Such honest parties may not be able to communicate reliably or securely with other honest parties in the network due to lack of infrastructure. We explain why a straightforward hybrid argument employed in the previous work can be used to realize privacy only when honest-but-curious type passive corruptions are considered. We further note that the notion of almost everywhere secure computation is theoretically challenging and practically relevant only when malicious corruptions are allowed. We argue and emphasize why simulation based reduction approach taken by the author is the only way to meaningfully realize privacy of almost everywhere secure computation. We present such an approach and show how to realize a.e.s.c. for general Byzantine corruptions, resolving the principle open problem in this line of research. Finally, we note several technical and conceptual improvements to the results given in previous work.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131399873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

On the computational power of oblivious robots: forming a series of geometric patterns 论遗忘机器人的计算能力:形成一系列几何图案

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835761

S. Das, P. Flocchini, N. Santoro, M. Yamashita

{"title":"On the computational power of oblivious robots: forming a series of geometric patterns","authors":"S. Das, P. Flocchini, N. Santoro, M. Yamashita","doi":"10.1145/1835698.1835761","DOIUrl":"https://doi.org/10.1145/1835698.1835761","url":null,"abstract":"We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have any means of explicit communication with each other, and have no memory of the past. In the extensive literature it has been shown how such simple robots can form a single geometric pattern (e.g., a line, a circle, etc), however arbitrary, in spite of their obliviousness. This brings to the front the natural research question: what are the real computational limits imposed by the robots being oblivious? In particular, since obliviousness limits what can be remembered, under what conditions can oblivious robots form a series of geometric patterns? Notice that a series of patterns would create some form of memory in an otherwise memory-less system. In this paper we examine and answer this question showing that, under particular conditions, oblivious robot systems can indeed form series of geometric patterns starting from any arbitrary configuration. More precisely, we study the series of patterns that can be formed by robot systems under various restrictions such as anonymity, asynchrony and lack of common orientation. These results are the first strong indication that oblivious solutions may be obtained also for tasks that intuitively seem to require memory.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124275672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 53

Distributed computational complexities: are you volvo-addicted or nascar-obsessed? 分布式计算复杂性:你是沃尔沃迷还是纳斯卡迷?

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835700

P. Fraigniaud

{"title":"Distributed computational complexities: are you volvo-addicted or nascar-obsessed?","authors":"P. Fraigniaud","doi":"10.1145/1835698.1835700","DOIUrl":"https://doi.org/10.1145/1835698.1835700","url":null,"abstract":"Roughly speaking, and if one ignores important research topics driven by modern applications of distributed computing (like, e.g., P2P systems and multi-core technology), the PODC community can be viewed as the union of two non-necessarily disjoint sub-communities. One is mostly focussing on the combined impact of asynchronism and faults on distributed computation, while the other is mostly focussing on the impact of network structural properties on distributed computation. Both communities address various forms of distributed computational complexities, through the analysis of different concepts. This includes, e.g., failure detectors and wait-free hierarchy for the former community, and compact labeling schemes and computing with advice for the latter community. This talk will describe examples taken from these latter frameworks aiming at demonstrating that many important notions of Distributed Computing seem to fit well with standard computational complexity, although they are not expressed using the traditional computational complexity format, i.e., complexity classes. The thesis that will be defended in the talk is that the traditional computational complexity format might well apply to Distributed Computing, and that our community may in fact take benefit from expressing its main challenges in this standard framework for making them accessible to a wider audience.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116353859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Eventually linearizable shared objects 最终是线性化的共享对象

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/1835698.1835723

M. Serafini, D. Dobre, Matthias Majuntke, P. Bokor, N. Suri

引用次数: 24

Session details: Brief announcements 会议详情:简短公告

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI: 10.1145/3258211

Seth Gilbert

引用次数: 0