Introduction to the special issue of papers from DISC 2015,Distributed Computing

当前位置： X-MOL 学术 › Distrib. Comput. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

Introduction to the special issue of papers from DISC 2015
Distributed Computing ( IF 1.3 ) Pub Date : 2018-06-25 , DOI: 10.1007/s00446-018-0337-3
Yoram Moses

This special issue of Distributed Computing is based on four papers that originally appeared, in preliminary and abbreviated form, in the Proceedings of the 29th International Symposium onDistributedComputing (DISC), held onOctober 7–9, 2015 inTokyo, Japan. The paperswere chosen by the ProgramCommittee from the 42 full-length papers presented at the symposium, based on their quality and representation of the range of topics addressed in the symposium. DISC is an annual forum for presentation of high-quality and novel research on all aspects of Distributed Computing, including the theory, design, implementation and applications of distributed algorithms, systems and networks. The four selected papers offer a fascinating view of the breadth and depth of subjects presented at DISC. The first paper, by Rati Gelashvili, introduces a new technique for proving space lower bounds for the fundamental problem of consensus in shared memory systems, which results in new insights and greatly improved bounds. The second paper, by Michael Dinitz, Jeremy Fineman, Seth Gilbert and Calvin Newport, shows how the smoothed analysis technique originally introduced by Spielman and Teng for the analysis of sequential algorithms can be adapted to distributed protocols and can provide new insights into their behavior.

更新日期：2018-06-25

点击分享查看原文

点击收藏

公开下载

阅读更多本刊最新论文本刊介绍/投稿指南11