The conference was held from July 1st to July 4th at Gran Sasso Science Institute (GSSI) in the heart of L'Aquila, Abruzzo, a historic city in Italy to the east of Rome. First Day On the rst day, a tutorial on Permissioned Blockchains took place. There, Roger Wattenhofer covered a variety of topics on permissioned and permissionless blockchains. The rst part started from the very basics, targeting an audience that has never heard of fault-tolerant distributed systems. In the second part, permissionless blockchains were explained, followed by the third and nal part, in which more advanced topics and current research were discussed. The 6-hour tutorial was well attended by researchers and students from various areas and the interactive format allowed the members of the audience to steer the talk into their preferred directions. In the evening, after the registration, the welcome reception with lots of delicious snacks and refreshing drinks took place.
{"title":"SIROCCO 2019 Review","authors":"S. Brandt, Manuela Fischer, Jara Uitto","doi":"10.1145/3374857.3374867","DOIUrl":"https://doi.org/10.1145/3374857.3374867","url":null,"abstract":"The conference was held from July 1st to July 4th at Gran Sasso Science Institute (GSSI) in the heart of L'Aquila, Abruzzo, a historic city in Italy to the east of Rome.\u0000 First Day On the rst day, a tutorial on Permissioned Blockchains took place. There, Roger Wattenhofer covered a variety of topics on permissioned and permissionless blockchains. The rst part started from the very basics, targeting an audience that has never heard of fault-tolerant distributed systems. In the second part, permissionless blockchains were explained, followed by the third and nal part, in which more advanced topics and current research were discussed. The 6-hour tutorial was well attended by researchers and students from various areas and the interactive format allowed the members of the audience to steer the talk into their preferred directions. In the evening, after the registration, the welcome reception with lots of delicious snacks and refreshing drinks took place.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76521309","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}
This is a book about Kolmogorov complexity and algorithmic randomness. The main idea in Kolmogorov complexity, introduced by A. N. Kolmogorov and others in the 1960's, is to use an algorithmic approach to measure the amount of information in finite objects [1]. Kolmogorov wanted to create an information theory that, unlike Shannon information theory, is founded independently from probability theory. This approach results in a notion of randomness that is independent from the notion of probability and is closer to the intuition that "randomness is the absence of regularities" [2, 1]. As authors stated in the introduction, this book is not intended to be comprehensive, especially with respect to the more recent results; However, the authors cover a wide range of topics and results in Kolmogorov complexity theory and whenever a result is not rigorously investigated, sufficient references are provided. The book starts from the basic concepts and builds its way up toward the more advanced concepts and techniques. The progress from the introductory to the advanced topics is seamless which makes the reading an enjoyable experience. Concepts and techniques are explained very well and proofs are rigorous, detailed, and clear. Important and complicated proofs are usually followed by excellent discussions about the main ideas and techniques used in them. The book also contains many interesting and insightful philosophical discussions.
这是一本关于柯尔莫哥洛夫复杂度和算法随机性的书。由A. N. Kolmogorov等人在20世纪60年代提出的Kolmogorov复杂度的主要思想是使用一种算法方法来测量有限对象中的信息量[1]。Kolmogorov想要创建一个信息论，与香农信息论不同，它是独立于概率论建立起来的。这种方法产生了一个独立于概率概念的随机性概念，更接近于“随机性是缺乏规律性”的直觉[2,1]。正如作者在引言中所述，这本书并不打算全面，特别是关于最近的结果;然而，作者在Kolmogorov复杂性理论中涵盖了广泛的主题和结果，每当结果没有得到严格的研究时，都提供了足够的参考。这本书从基本概念开始，并建立其方式向更先进的概念和技术。从入门到高级主题的进展是无缝的，这使得阅读成为一种愉快的体验。概念和技术解释得很好，证明是严格的，详细的，清晰的。重要而复杂的证明之后通常会有关于主要思想和所用技术的精彩讨论。这本书还包含了许多有趣而深刻的哲学讨论。
{"title":"Review of Kolmogorov Complexity and Algorithmic Randomness by A. Shen, V. A. Uspensky, and N. Vereshchagin","authors":"Hadi Shafei","doi":"10.1145/3374857.3374861","DOIUrl":"https://doi.org/10.1145/3374857.3374861","url":null,"abstract":"This is a book about Kolmogorov complexity and algorithmic randomness. The main idea in Kolmogorov complexity, introduced by A. N. Kolmogorov and others in the 1960's, is to use an algorithmic approach to measure the amount of information in finite objects [1]. Kolmogorov wanted to create an information theory that, unlike Shannon information theory, is founded independently from probability theory. This approach results in a notion of randomness that is independent from the notion of probability and is closer to the intuition that \"randomness is the absence of regularities\" [2, 1].\u0000 As authors stated in the introduction, this book is not intended to be comprehensive, especially with respect to the more recent results; However, the authors cover a wide range of topics and results in Kolmogorov complexity theory and whenever a result is not rigorously investigated, sufficient references are provided. The book starts from the basic concepts and builds its way up toward the more advanced concepts and techniques. The progress from the introductory to the advanced topics is seamless which makes the reading an enjoyable experience. Concepts and techniques are explained very well and proofs are rigorous, detailed, and clear. Important and complicated proofs are usually followed by excellent discussions about the main ideas and techniques used in them. The book also contains many interesting and insightful philosophical discussions.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88638880","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}
Our story is about hardness of problems in P, but its roots begin with two algorithmic approaches that have been developed to cope with NP-hard problems: approximation algorithms and fasterthan- brute-force algorithms. Approximation algorithms were proposed as a response for NP-hardness almost immediately (in historical perspective of almost half a century), and have been one of the most celebrated success stories of our eld. An outstanding complexity result in this area, which has since turned into a sub- eld of its own, is the Probabilistically Checkable Proof (PCP) Theorem. For many problems like Max-3-SAT we now have nearly tight hardness-of-approximation results.
{"title":"SETH vs Approximation","authors":"A. Rubinstein, V. V. Williams","doi":"10.1145/3374857.3374870","DOIUrl":"https://doi.org/10.1145/3374857.3374870","url":null,"abstract":"Our story is about hardness of problems in P, but its roots begin with two algorithmic approaches that have been developed to cope with NP-hard problems: approximation algorithms and fasterthan- brute-force algorithms.\u0000 Approximation algorithms were proposed as a response for NP-hardness almost immediately (in historical perspective of almost half a century), and have been one of the most celebrated success stories of our eld. An outstanding complexity result in this area, which has since turned into a sub- eld of its own, is the Probabilistically Checkable Proof (PCP) Theorem. For many problems like Max-3-SAT we now have nearly tight hardness-of-approximation results.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73153269","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}
Welcome to the Technical Reports Column. If your institution publishes technical reports that you'd like to have included here, please contact me at the email address above.
{"title":"Technical Report Column","authors":"D. Kelley","doi":"10.1145/3351452.3351458","DOIUrl":"https://doi.org/10.1145/3351452.3351458","url":null,"abstract":"Welcome to the Technical Reports Column. If your institution publishes technical reports that you'd like to have included here, please contact me at the email address above.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89485628","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}
The equation y2 = x3 + ax2 + bx + c might seem a little innocuous at first. However, studying the sets of rational points (x; y) obeying this equation has proven to be one of the most far-reaching and fruitful areas of mathematics. For example, it led, aided and abetted by much of the most powerful mathematics of the past century, to Wiles' proof of Fermat's Last Theorem. And furthermore, these so-called "elliptic curves" (the terminology having little to do with ellipses) are actually useful. You can factor numbers with them! And send secret messages!
{"title":"Review of Modern Cryptography and Elliptic Curves, A Beginner's Guide by Thomas R. Shemanske","authors":"Frederic Green","doi":"10.1145/3351452.3351457","DOIUrl":"https://doi.org/10.1145/3351452.3351457","url":null,"abstract":"The equation y2 = x3 + ax2 + bx + c might seem a little innocuous at first. However, studying the sets of rational points (x; y) obeying this equation has proven to be one of the most far-reaching and fruitful areas of mathematics. For example, it led, aided and abetted by much of the most powerful mathematics of the past century, to Wiles' proof of Fermat's Last Theorem. And furthermore, these so-called \"elliptic curves\" (the terminology having little to do with ellipses) are actually useful. You can factor numbers with them! And send secret messages!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81416827","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}
Emerging optical technologies introduce opportunities to recon gure network topologies at runtime. The resulting topological exibilities can be exploited to design novel demand-aware and self-adjusting networks. This paper provides an overview of the algorithmic problems introduced by this technology, and surveys rst solutions.
{"title":"Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity","authors":"Klaus-Tycho Foerster, S. Schmid","doi":"10.1145/3351452.3351464","DOIUrl":"https://doi.org/10.1145/3351452.3351464","url":null,"abstract":"Emerging optical technologies introduce opportunities to recon gure network topologies at runtime. The resulting topological exibilities can be exploited to design novel demand-aware and self-adjusting networks. This paper provides an overview of the algorithmic problems introduced by this technology, and surveys rst solutions.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78282461","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}
This column consists of an overview of recon gurable data center networks and is contributed by Klaus-Tycho Foerster and Stefan Schmid. After giving some accessible background on how such networks came about from the technological and empirical perspective, the authors provide an overview of the algorithmic results obtained so far for problems in this area. The take-away is that the surface has only been scratched and there is potential for much interesting work on algorithmic foundations for recon gurable data center networks.
{"title":"Distributed Computing Column 74 Survey of Recon gurable Data Center Networks","authors":"J. Welch","doi":"10.1145/3351452.3351463","DOIUrl":"https://doi.org/10.1145/3351452.3351463","url":null,"abstract":"This column consists of an overview of recon gurable data center networks and is contributed by Klaus-Tycho Foerster and Stefan Schmid. After giving some accessible background on how such networks came about from the technological and empirical perspective, the authors provide an overview of the algorithmic results obtained so far for problems in this area. The take-away is that the surface has only been scratched and there is potential for much interesting work on algorithmic foundations for recon gurable data center networks.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80579082","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}
This book really is written for people who know NOTHING about quantum mechanics and don't know much math, hence I was able to give it a fair review. Since I have sometimes heard people talk about quantum mechanics I could also recognize some of the discussions in the book as well known controversies in quantum mechanics.
{"title":"Review of Q is for Quantum by Terry Rudolph","authors":"W. Gasarch","doi":"10.1145/3351452.3351455","DOIUrl":"https://doi.org/10.1145/3351452.3351455","url":null,"abstract":"This book really is written for people who know NOTHING about quantum mechanics and don't know much math, hence I was able to give it a fair review. Since I have sometimes heard people talk about quantum mechanics I could also recognize some of the discussions in the book as well known controversies in quantum mechanics.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88225606","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}
This is a very important theorem since it shows that Peano Arithmetic cannot do everything in Number Theory. However, the statement S is not natural. Paris and Harrington came up with a natural statement in Ramsey Theory that is not provable in Peano Arithmetic. I have always wanted a clean self-contained treatment of the Paris-Harrington result and why it is not provable in Peano Arithmetic. Is this book that treatment? Yes!
{"title":"Review of An Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics by Matthew Katz and Jan Reimann","authors":"W. Gasarch","doi":"10.1145/3351452.3351456","DOIUrl":"https://doi.org/10.1145/3351452.3351456","url":null,"abstract":"This is a very important theorem since it shows that Peano Arithmetic cannot do everything in Number Theory. However, the statement S is not natural. Paris and Harrington came up with a natural statement in Ramsey Theory that is not provable in Peano Arithmetic. I have always wanted a clean self-contained treatment of the Paris-Harrington result and why it is not provable in Peano Arithmetic. Is this book that treatment? Yes!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75073615","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}
In this column we review three accessible books about difficult subjects. The second and third are in the AMS Student Mathematical Library, a series I have so far found to be uniformly excellent.
{"title":"The Book Review Column","authors":"Frederic Green","doi":"10.1145/3351452.3351454","DOIUrl":"https://doi.org/10.1145/3351452.3351454","url":null,"abstract":"In this column we review three accessible books about difficult subjects. The second and third are in the AMS Student Mathematical Library, a series I have so far found to be uniformly excellent.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74058373","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：