发布求助
文献互助 智能选刊 最新文献

SIGACT News最新文献

筛选
英文 中文
SIROCCO 2019 Review SIROCCO 2019回顾
SIGACT News Pub Date : 2019-12-04 DOI: 10.1145/3374857.3374867
S. Brandt, Manuela Fischer, Jara Uitto
{"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}
引用次数: 0
Review of Kolmogorov Complexity and Algorithmic Randomness by A. Shen, V. A. Uspensky, and N. Vereshchagin A. Shen, V. A. Uspensky和N. Vereshchagin对Kolmogorov复杂度和算法随机性的综述
SIGACT News Pub Date : 2019-12-04 DOI: 10.1145/3374857.3374861
Hadi Shafei
{"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}
引用次数: 0
SETH vs Approximation SETH vs近似
SIGACT News Pub Date : 2019-12-04 DOI: 10.1145/3374857.3374870
A. Rubinstein, V. V. Williams
{"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}
引用次数: 19
Technical Report Column 技术报告专栏
SIGACT News Pub Date : 2019-07-24 DOI: 10.1145/3351452.3351458
D. Kelley
{"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}
引用次数: 0
Review of Modern Cryptography and Elliptic Curves, A Beginner's Guide by Thomas R. Shemanske 回顾现代密码学和椭圆曲线，初学者指南，作者:Thomas R. Shemanske
SIGACT News Pub Date : 2019-07-24 DOI: 10.1145/3351452.3351457
Frederic Green
{"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}
引用次数: 0
Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity 可重构数据中心网络调查:使能器、算法、复杂性
SIGACT News Pub Date : 2019-07-24 DOI: 10.1145/3351452.3351464
Klaus-Tycho Foerster, S. Schmid
{"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}
引用次数: 53
Distributed Computing Column 74 Survey of Recon gurable Data Center Networks 分布式计算专栏74可侦察数据中心网络综述
SIGACT News Pub Date : 2019-07-24 DOI: 10.1145/3351452.3351463
J. Welch
{"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}
引用次数: 0
Review of Q is for Quantum by Terry Rudolph Terry Rudolph对Q is for Quantum的回顾
SIGACT News Pub Date : 2019-07-24 DOI: 10.1145/3351452.3351455
W. Gasarch
{"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}
引用次数: 0
Review of An Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics by Matthew Katz and Jan Reimann 《拉姆齐理论导论:快速函数、无穷和元数学》，作者:Matthew Katz和Jan Reimann
SIGACT News Pub Date : 2019-07-24 DOI: 10.1145/3351452.3351456
W. Gasarch
{"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}
引用次数: 0
The Book Review Column 书评专栏
SIGACT News Pub Date : 2019-07-24 DOI: 10.1145/3351452.3351454
Frederic Green
{"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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信