SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289147
L. Hemaspaandra
{"title":"SIGACT News Complexity Theory Column 99","authors":"L. Hemaspaandra","doi":"10.1145/3289137.3289147","DOIUrl":"https://doi.org/10.1145/3289137.3289147","url":null,"abstract":"To call these papers in uential would be a comic understatement. In fact, what these papers did is to help set the framework in which theoretical computer science would grow. Reductions are perhaps the most central way in which theoretical computer science relates one problem's complexity to another, and these two papers largely sculpted and powerfully explored the landscape of both polynomial-time and logspace reductions.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"4 1","pages":"48-50"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82271824","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}
SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289142
A. Srinivasan
{"title":"Probability and Computing","authors":"A. Srinivasan","doi":"10.1145/3289137.3289142","DOIUrl":"https://doi.org/10.1145/3289137.3289142","url":null,"abstract":"The power of randomization in the computational context is one of the fundamental discoveries of computer science; furthermore, statistical and probabilistic reasoning is indispensable for modern-day data analysis and data science. In this significantly-expanded second edition, the authors (continuing to assume exposure to just basic discrete probability) present a unified treatment of probabilistic concepts useful for modern computer science and data science.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"3 1","pages":"20-22"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84286279","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}
SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289143
D. Kelley
{"title":"Technical Report Column","authors":"D. Kelley","doi":"10.1145/3289137.3289143","DOIUrl":"https://doi.org/10.1145/3289137.3289143","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":"20 1","pages":"23-33"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88321834","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}
SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289144
W. Gasarch
{"title":"Open Problems Column","authors":"W. Gasarch","doi":"10.1145/3289137.3289144","DOIUrl":"https://doi.org/10.1145/3289137.3289144","url":null,"abstract":"This issue's Open Problem Column is by Stephen Fenner, Fred Green, and Steven Homer. It is titled: Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems. It is not on xedparameter tractability. It is on a generalization of the geometric notion of convexity.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"13 1","pages":"34"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78808297","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}
SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289140
L. Kozma
{"title":"Review of Compact Data Structures - a practical approach by Gonzalo Navarro","authors":"L. Kozma","doi":"10.1145/3289137.3289140","DOIUrl":"https://doi.org/10.1145/3289137.3289140","url":null,"abstract":"The book studies fundamental data structures and representations of combinatorial objects, including arrays, bitvectors, permutations, trees, graphs, etc. There are, of course, a great number of existing textbooks and lecture notes about data structures. The perspective of this book is, however, different from the usual presentations. In some sense, this book starts exactly where others leave off saying \"we omit the low-level details of representation\", and concerns itself mostly with the low-level representation. Specifically, it looks at how to organize and store data structures using as little space as possible while supporting efficient queries and operations. For the considered structures, the book explores the trade-off between reduced space and speed of operation. The analyses of the presented solutions go beyond the usual asymptotics, and also consider exact constant factors (particularly for the leading term of the space complexity); useful practical considerations are also discussed.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"9 1","pages":"9-13"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84780428","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}
SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289139
Frederic Green
{"title":"The Book Review Column","authors":"Frederic Green","doi":"10.1145/3289137.3289139","DOIUrl":"https://doi.org/10.1145/3289137.3289139","url":null,"abstract":"In this column we review these three books: 1. Compact Data Structures - A Practical Approach, by Gonzalo Navarro. An unusual approach focussing on data structures that use as little space as is theoretically possible, while maintaining practicality. Review by Laszlo Kozma. 2. Power Up: Unlocking the Hidden Mathematics in Video Games, by Matthew Lane. A revealing look at the mathematics, physics, and computer science that underlies (good) video games, with special attention to their potential valuable role in education. Review by S. V. Nagaraj. 3. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis (Second Edition), by Michael Mitzenmacher and Eli Upfal. The second edition2 of a distinguished text on a rich area that is central to computer and data science. Review by Aravind Srinivasan. Many thanks to these and all reviewers over the years who have graciously volunteered this valuable service to the community! Interested in reviewing? I hope so. Remember the perks: Learning (more?) about a field that interests you, a review on these pages, and a free book! The books listed on the next two pages are available, but the list is not exhaustive: I'm open to suggestions.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"82 1","pages":"6-8"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83776488","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}
SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289150
Dan Alistarh, Rati Gelashvili
{"title":"Recent Algorithmic Advances in Population Protocols","authors":"Dan Alistarh, Rati Gelashvili","doi":"10.1145/3289137.3289150","DOIUrl":"https://doi.org/10.1145/3289137.3289150","url":null,"abstract":"Population protocols are a popular model of distributed computing, introduced by Angluin, Aspnes, Diamadi, Fischer, and Peralta [6] a little over a decade ago. In the meantime, the model has proved a useful abstraction for modeling various settings, from wireless sensor networks [35, 26], to gene regulatory networks [17], and chemical reaction networks [21]. In a nutshell, a population protocol consists of n agents with limited local state that interact randomly in pairs, according to an underlying communication graph, and cooperate to collectively compute global predicates. From a theoretical prospective, population protocols, with the restricted communication and computational power, are probably one of the simplest distributed model one can imagine. Perhaps surprisingly though, solutions to many classical distributed tasks are still possible. Moreover, these solutions often rely on interesting algorithmic ideas for design and interesting probabilistic techniques for analysis, while known lower bound results revolve around complex combinatorial arguments.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"16 1","pages":"63-73"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89786844","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}
SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289141
S. Nagaraj
{"title":"Review of Power Up:: Unlocking the hidden mathematics in video games","authors":"S. Nagaraj","doi":"10.1145/3289137.3289141","DOIUrl":"https://doi.org/10.1145/3289137.3289141","url":null,"abstract":"Video games provide entertainment to those who play them. This book looks at the hidden mathematics behind video games. It is meant for all those who love playing video games, so that they may explore mathematical ideas in the games. It is also aimed at mathematics teachers for inspiring their students, and for all those who love mathematics and games. Even those who hate mathematics but love video games are also a part of the target audience of this book. However, this particular category of readers needs at least some familiarity with high school mathematics to benefit from the book. The author states that many people enjoy playing computer / video games but few would be indulging themselves in doing some math. He terms this a consequence of poor marketing of mathematics since time immemorial. The main purpose of the book is to highlight that mathematics can be fun and that it can be found even in the most unbelievable or unexpected places such as in computer games.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"51 1","pages":"14-19"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73834537","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}
SIGACT NewsPub Date : 2018-10-24DOI: 10.1145/3289137.3289151
A. Czumaj, Robert Krauthgamer
{"title":"3rd Highlights of Algorithms (HALG 2018)","authors":"A. Czumaj, Robert Krauthgamer","doi":"10.1145/3289137.3289151","DOIUrl":"https://doi.org/10.1145/3289137.3289151","url":null,"abstract":"The 3rd edition of the Highlights of Algorithms (HALG) conference took place in Amsterdam, June 46, 2018. In this report, the chairs of the Steering Committee and the Program Committee discuss the role, format and impact of the conference until now, and describe their goals and motivation for the future.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"19 1","pages":"74-77"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82664965","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}
SIGACT NewsPub Date : 2018-10-08DOI: 10.1145/1466390.1466395
C. Charalambides
{"title":"Enumerative combinatorics","authors":"C. Charalambides","doi":"10.1145/1466390.1466395","DOIUrl":"https://doi.org/10.1145/1466390.1466395","url":null,"abstract":"good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations. The proofs of some theorems are continued after the statements and proofs of needed lemmas with no helpful demarcations (“Continuation of proof of Theorem . . . ”). Finally, at least one lemma (3.34) has a corollary with no theorem or proposition in sight; the status of Lemma 3.36 is also unclear. Lemma 1.16 on page 12 giving a closed formula for Stirling numbers of the second kind is important enough to figure in the proof of capstone Theorem 3.71 (Schlömilch’s formula) on page 114. This nonstandard approach to chapter organization may impede some readers’ comprehending the structure of the author’s highly purposeful discussion. Review of 3 Enumerative Combinatorics Author of Book: Charalambos A. Charalambides Publisher: Chapman & Hall/CRC ISBN L-58488-290-5, Hard Cover, 609 pages","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"38 1","pages":"25-27"},"PeriodicalIF":0.0,"publicationDate":"2018-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72679776","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号
