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

SIGACT News最新文献

筛选
英文 中文
SIGACT News Online Algorithms Column 33 SIGACT新闻在线算法专栏
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197417
R. V. Stee
{"title":"SIGACT News Online Algorithms Column 33","authors":"R. V. Stee","doi":"10.1145/3197406.3197417","DOIUrl":"https://doi.org/10.1145/3197406.3197417","url":null,"abstract":"For this issue, Matthias Englert has contributed an alternative and simpler proof of a result by Gamzu and Segev, which was in ACM Transactions on Algorithms in 2009. The problem considered in this paper was the reordering bu↵er problem on the line. Gamzu and Segev were the first to give an O(log n)-competitive algorithm for this problem, and there has been no improvement on this since then, leaving a gap with the best known lower bound of 2.154 by the same authors. Matthias’ proof shows that this result can be slightly improved (a smaller hidden constant) and simplified. Who is going to be the first to give a constant competitive algorithm, or show that this cannot be done?","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82270429","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
Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds 客座专栏:算术电路下界的一个范例
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197416
N. Kayal, Chandan Saha
{"title":"Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds","authors":"N. Kayal, Chandan Saha","doi":"10.1145/3197406.3197416","DOIUrl":"https://doi.org/10.1145/3197406.3197416","url":null,"abstract":"How many operations are needed to compute a given polynomial f(x1; x2; : : : ; xn)? Answering questions of this form naturally leads us on a search for clever algorithmic techniques to reduce the number of operations required. Simultaneously, it also leads us towards the complementary task of finding techniques and paradigms for proving lower bounds on the minimum number of operations required. In this survey we describe one such paradigm for obtaining lower bounds.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88130425","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}
引用次数: 3
The First Summer School on Practice and Theory of Concurrent Computing SPTCC 2017 第一届并行计算实践与理论暑期学校(SPTCC 2017
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197421
P. Kuznetsov
{"title":"The First Summer School on Practice and Theory of Concurrent Computing SPTCC 2017","authors":"P. Kuznetsov","doi":"10.1145/3197406.3197421","DOIUrl":"https://doi.org/10.1145/3197406.3197421","url":null,"abstract":"Nowadays concurrency is everywhere. Be it a mainstream multi-core machine, a computing cluster, or a large-scale distributed service, a modern computing system involves multiple processes that concurrently perform independent computations and communicate to synchronize their activities. Understanding concurrency is therefore getting essential in both practice and research in computer science. The first summer school on Practice and Theory of Concurrent Computing took place on July 3-7, 2017 in Saint-Petersburg, Russia. The school was hosted by ITMO university, and financially supported by DevExperts, Yandex, Télécom ParisTech, and ANR-DFG DISCMAT project.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74423739","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
SIGACT News Complexity Theory Column 97 SIGACT新闻复杂性理论专栏
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197415
L. Hemaspaandra
{"title":"SIGACT News Complexity Theory Column 97","authors":"L. Hemaspaandra","doi":"10.1145/3197406.3197415","DOIUrl":"https://doi.org/10.1145/3197406.3197415","url":null,"abstract":"Warmest thanks to Neeraj Kayal and Chandan Saha for starting off all our 2018s so very nicely with their wonderful article, “A Paradigm for Arithmetic Circuit Lower Bounds”! And please do stay tuned for the coming articles in the Complexity Theory Column, namely, Josh Grochow and David H. Wolpert (tentative topic: new complexity questions regarding the thermodynamics of computation; so much more than (ir)reversibility), Lane A. Hemaspaandra and Holger Spakowski (tentative topic: team diagonalization), William Gasarch (not-at-all-tentative topic: the third P versus NP poll), William Gasarch (tentative topic: the muffin problem), and Emanuele Viola (topic: TBD). Yes, you can believe your eyes: The start of 2019 will be a gala “half-year of Bill (Gasarch)”! And please warm up your predicting hats, because in the very next issue of SIGACT News (June 2018) you will find in Bill’s Open Questions Column the poll questions he would like your answers to, as well as his discussion of his (surely provocative) thoughts about those questions. And then the results (based on your answers!) of his poll will appear as Complexity Theory Column #100 in the March 2019 issue of SIGACT News.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82546286","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 Real-World Algorithms: A Beginner's Guide by Panos Louridas 回顾现实世界的算法:帕诺斯·洛里达斯的初学者指南
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197410
Ramon de Vera
{"title":"Review of Real-World Algorithms: A Beginner's Guide by Panos Louridas","authors":"Ramon de Vera","doi":"10.1145/3197406.3197410","DOIUrl":"https://doi.org/10.1145/3197406.3197410","url":null,"abstract":"According to the author, “the book was written to serve as a first encounter with algorithms.” The book tries to provide an understanding of algorithms that can be commonly encountered by people in different disciplines. The flow of the discussion covers salient points of the algorithms without necessitating a technical deep dive. This makes the book more accessible to people from disciplines other than just Computer Science. The chapter titles are imaginative and serve to hook the interest of the reader. In addition, the chapter titles segue nicely into the discussions per chapter. For example, the first chapter is titled “Stock Spans.” The chapter starts with a discussion of how stock spans are solvable in several ways, depending on the constraints identified. This is a great jumping off point to discussions of how we can determine which algorithms would serve us better. Also the problem is basic enough that a discussion of basic structures fits well.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78284303","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 The Art of Computer Programming Fascicle 6 'Satisfiability' by Donald E. Knuth Donald E. Knuth的《计算机程序设计的艺术》第六册《可满足性》书评
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197409
J. Rogers
{"title":"Review of The Art of Computer Programming Fascicle 6 'Satisfiability' by Donald E. Knuth","authors":"J. Rogers","doi":"10.1145/3197406.3197409","DOIUrl":"https://doi.org/10.1145/3197406.3197409","url":null,"abstract":"I entered the field of Computer Science as an undergraduate because I very much enjoyed programming. Of course, there is far more to the discipline than that and, as I studied, I found myself pursuing more esoteric topics, landing for quite a while in the land of computational complexity theory. But programming was, and remains, my first love. And that’s why, once again, I find myself reading and, at times, wrestling with yet another of Don Knuth’s TAOCP fascicles. As I have written before in this column, Knuth is able to combine a more theoretical topic, in this case the satisfiability problem, with practical approaches to solving it, approaches that encourage the reader to write some code. It’s this mix of the theoretical and the practical that I, and I believe many others, find engaging. As we all know, the satisfiability problem (SAT) is NP-complete and is considered the ur-problem of the theory. According to Bill Gasarch’s survey, to which Knuth refers in a footnote on page 1, most feel we are a long way from showing whether P 6= NP. Despite that, many have realized that we can still attack large classes of SAT problems, classes coming from many practical applications, with techniques that work reasonably efficiently. Fascicle 6 is Knuth’s contribution to this and is the next in a series of paperback publications that together will form Volume 4 of “The Art of Computer Programming” (TAOCP). The volume will appear as a trilogy, with Volume 4A already in hardcover. This fascicle will be the middle third of Volume 4B.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88284137","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 reordering buffer problem on the line revisited 重新访问了联机上的重新排序缓冲区问题
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197418
Matthias Englert
{"title":"The reordering buffer problem on the line revisited","authors":"Matthias Englert","doi":"10.1145/3197406.3197418","DOIUrl":"https://doi.org/10.1145/3197406.3197418","url":null,"abstract":"The reordering bu↵er problem (or also sorting bu↵er problem) was introduced by Räcke, Sohler, and Westermann in 2002 [14] and has been extensively studied since then. In this problem, a metric space is given1 and a sequence of items arrive online. Each item is associated with a point in the metric space. We allow multiple items to be associated with the same point. An online algorithm can store up to k items in a bu↵er, but once the bu↵er is full, the algorithm has to process at least one of the items stored in the bu↵er. To process an item from the bu↵er, the algorithm moves a single server in the metric space to the point corresponding to that item. The goal is to minimize the total distance that the server has to travel to process the entire input sequence. The problem is reasonably well understood for some metric spaces. For uniform metric spaces for example, a deterministic O( p log k)-competitive algorithm is known, which is close to the lower bound of ⌦( p log k/ log log k) [1]. Similarly, [4] gives a O(log log k)-competitive randomized online algorithm, which is asymptotically tight [1]. For other metric spaces however, the picture is less clear. We will refrain from listing all known results in detail, but there have been a number of papers investigating this online problem for di↵erent metrics spaces and settings [2, 3, 7, 8, 9, 10, 11, 12, 13]. However, in this column, we will focus on line metric spaces. The last notable result for this metric was obtained eleven years ago by Gamzu and Segev [11]. Their main result is a deterministic O(log n)-competitive online algorithm for a line metric space with n evenly spaced points. In the reminder, we will sketch a slightly simplified and improved version of this result.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85558616","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
Distributed Computing Column 69 Proving PACELC and Concurrent Computing Summer School 证明PACELC和并发计算暑期学校
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197419
J. Welch
{"title":"Distributed Computing Column 69 Proving PACELC and Concurrent Computing Summer School","authors":"J. Welch","doi":"10.1145/3197406.3197419","DOIUrl":"https://doi.org/10.1145/3197406.3197419","url":null,"abstract":"Scalable distributed systems face inherent trade-offs arising from the relatively high cost of exchanging information between computing nodes. Brewer’s CAP (Consistency, Availability, Partition-Tolerance) principle states that when communication becomes impossible between isolated parts of the system (i.e., the network is partitioned), then the system must give up either safety (i.e., sometimes return an incorrect result) or liveness (i.e., sometimes fail to produce a result). Abadi generalized Brewer’s principle by defining the PACELC (if Partition then Availability or Consistency, Else Latency or Consistency) formulation, which captures the observation that the trade-off between safety and liveness is often made in practice even while the network is reliable. Building on Gilbert and Lynch’s formal proof of the CAP principle, this paper presents a formal treatment of Abadi’s formulation and connects this result to a body of prior work on latency bounds for distributed objects.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82963845","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
Open Problems Column 开放性问题专栏
SIGACT News Pub Date : 2018-01-01 DOI: 10.1145/3197406.3197413
W. Gasarch
{"title":"Open Problems Column","authors":"W. Gasarch","doi":"10.1145/3197406.3197413","DOIUrl":"https://doi.org/10.1145/3197406.3197413","url":null,"abstract":"","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75433397","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
Technical Report Column 技术报告专栏
SIGACT News Pub Date : 2018-01-01 DOI: 10.1145/3197406.3197412
D. Kelley
{"title":"Technical Report Column","authors":"D. Kelley","doi":"10.1145/3197406.3197412","DOIUrl":"https://doi.org/10.1145/3197406.3197412","url":null,"abstract":"","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75500019","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学术官方微信