In this issue I want to spotlight two important new releases. Jeff Shallit's The Logical Approach to Automatic Sequences introduces the software Walnut for deciding first-order statements in Buchi arithmetic. This software has been used to prove hundreds of results in combinatorics on words. Can the junior's dream of replacing the pumping lemma with a similar software be far behind? Data Science in Context is a new textbook by Alfred Spector, Peter Norvig, Chris Wiggins and Jeannette Wing that addresses the breadth, oppportunities and perils of the field. Its new feature is a sevenelement analysis rubric for determining data science's applicability to a proposed application. Please consider reviewing these books or a new release that you find important and of interest to the TCS community.
{"title":"The Book Review Column","authors":"Nicholas Tran","doi":"10.1145/3623800.3623802","DOIUrl":"https://doi.org/10.1145/3623800.3623802","url":null,"abstract":"In this issue I want to spotlight two important new releases. Jeff Shallit's The Logical Approach to Automatic Sequences introduces the software Walnut for deciding first-order statements in Buchi arithmetic. This software has been used to prove hundreds of results in combinatorics on words. Can the junior's dream of replacing the pumping lemma with a similar software be far behind? Data Science in Context is a new textbook by Alfred Spector, Peter Norvig, Chris Wiggins and Jeannette Wing that addresses the breadth, oppportunities and perils of the field. Its new feature is a sevenelement analysis rubric for determining data science's applicability to a proposed application. Please consider reviewing these books or a new release that you find important and of interest to the TCS community.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135096760","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 42nd edition of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) was held from June 19 to June 21, 2023, in Seattle, USA. After two years of online-only and a year of hybrid conferences, PODS 2023 went back to a fully in-person conference format. As is customary, the symposium was held jointly with the ACM International Conference on Management of Data (SIGMOD).
{"title":"Database Theory Column","authors":"Hung Q. Ngo","doi":"10.1145/3623800.3623806","DOIUrl":"https://doi.org/10.1145/3623800.3623806","url":null,"abstract":"The 42nd edition of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) was held from June 19 to June 21, 2023, in Seattle, USA. After two years of online-only and a year of hybrid conferences, PODS 2023 went back to a fully in-person conference format. As is customary, the symposium was held jointly with the ACM International Conference on Management of Data (SIGMOD).","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135096762","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":"Dean Kelley","doi":"10.1145/3623800.3623803","DOIUrl":"https://doi.org/10.1145/3623800.3623803","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":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135096757","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 Issue's Column! This issue's Open Problem Column is by William Gasarch, Auguste Gezalyan, and Don Patrick. It is about permutable and compatible primes.
本期专栏!本期开放问题专栏由William Gasarch, Auguste Gezalyan和Don Patrick撰写。它是关于置换和兼容素数的。
{"title":"Open Problems Column","authors":"William Gasarch","doi":"10.1145/3623800.3623804","DOIUrl":"https://doi.org/10.1145/3623800.3623804","url":null,"abstract":"This Issue's Column! This issue's Open Problem Column is by William Gasarch, Auguste Gezalyan, and Don Patrick. It is about permutable and compatible primes.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135096758","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}
Overview. In this Fall edition of the column, we resume our coverage of "hot topics" in areas connected to distributed computing with a column by Sepehr Assadi, who is an Associate Professor at the Cheriton School of Computer Science, University of Waterloo. Sepehr's work was highlighted by the PODC community before, as he was the recipient of the 2019 PODC Doctoral Dissertation Award for his work on streaming algorithms, multiparty communication, and massively parallel computation on graphs, and features frequently in the proceedings of mainstream theory conferences such as FOCS, STOC, and SODA. In this column, Sepehr covers some of the recent progress on multi-pass graph streaming lower bounds, which includes a significant amount of his own work. Many thanks to Sepehr for his interesting contribution!
{"title":"Distributed Computing Column 87 Recent Advances in Multi-Pass Graph Streaming Lower Bounds","authors":"Dan Alistarh","doi":"10.1145/3623800.3623807","DOIUrl":"https://doi.org/10.1145/3623800.3623807","url":null,"abstract":"Overview. In this Fall edition of the column, we resume our coverage of \"hot topics\" in areas connected to distributed computing with a column by Sepehr Assadi, who is an Associate Professor at the Cheriton School of Computer Science, University of Waterloo. Sepehr's work was highlighted by the PODC community before, as he was the recipient of the 2019 PODC Doctoral Dissertation Award for his work on streaming algorithms, multiparty communication, and massively parallel computation on graphs, and features frequently in the proceedings of mainstream theory conferences such as FOCS, STOC, and SODA. In this column, Sepehr covers some of the recent progress on multi-pass graph streaming lower bounds, which includes a significant amount of his own work. Many thanks to Sepehr for his interesting contribution!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135096759","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}
Wait! What does an article on 'multi-pass graph streaming' has anything to do with a column for 'distributed computing'?
等等!一篇关于“多通道图流”的文章和一篇关于“分布式计算”的专栏有什么关系?
{"title":"Recent Advances in Multi-Pass Graph Streaming Lower Bounds","authors":"Sepehr Assadi","doi":"10.1145/3623800.3623808","DOIUrl":"https://doi.org/10.1145/3623800.3623808","url":null,"abstract":"Wait! What does an article on 'multi-pass graph streaming' has anything to do with a column for 'distributed computing'?","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135096761","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 One Line and Close. Permutations as Linear Orders. Descents Alternating Runs Alternating Subsequences In One Line and Anywhere. Permutations as Linear Orders. Inversions. Inversions Inversion in Permutations of Multisets In Many Circles. Permutations as Products of Cycles. Decomposing a Permutation into Cycles Type and Stirling Numbers Cycle Decomposition versus Linear Order Permutations with Restricted Cycle Structure In Any Way but This. Pattern Avoidance. The Basics. The Notion of Pattern Avoidance Patterns of Length Three Monotone Patterns Patterns of Length Four The Proof of the Stanley-Wilf Conjecture In This Way but Nicely. Pattern Avoidance. Follow-Up. Polynomial Recurrences Containing a Pattern Many Times Containing a Pattern a Given Number of Times Mean and Insensitive. Random Permutations. The Probabilistic Viewpoint Expectation Variance and Standard Deviation An Application: Longest Increasing Subsequences Permutations versus Everything Else. Algebraic Combinatorics of Permutations. The Robinson-Schensted-Knuth Correspondence Posets of Permutations Simplicial Complexes of Permutations Get Them All. Algorithms and Permutations. Generating Permutations Stack Sorting Permutations Variations of Stack Sorting How Did We Get Here? Permutations as Genome Rearrangements. Introduction Block Transpositions Block Interchanges Block Transpositions Revisited Solutions to Odd-Numbered Exercises References List of Frequently Used Notation Index Exercises, Problems, and Problem Solutions appear at the end of each chapter.
{"title":"Combinatorics of permutations","authors":"M. Bóna","doi":"10.1145/1466390.1466394","DOIUrl":"https://doi.org/10.1145/1466390.1466394","url":null,"abstract":"In One Line and Close. Permutations as Linear Orders. Descents Alternating Runs Alternating Subsequences In One Line and Anywhere. Permutations as Linear Orders. Inversions. Inversions Inversion in Permutations of Multisets In Many Circles. Permutations as Products of Cycles. Decomposing a Permutation into Cycles Type and Stirling Numbers Cycle Decomposition versus Linear Order Permutations with Restricted Cycle Structure In Any Way but This. Pattern Avoidance. The Basics. The Notion of Pattern Avoidance Patterns of Length Three Monotone Patterns Patterns of Length Four The Proof of the Stanley-Wilf Conjecture In This Way but Nicely. Pattern Avoidance. Follow-Up. Polynomial Recurrences Containing a Pattern Many Times Containing a Pattern a Given Number of Times Mean and Insensitive. Random Permutations. The Probabilistic Viewpoint Expectation Variance and Standard Deviation An Application: Longest Increasing Subsequences Permutations versus Everything Else. Algebraic Combinatorics of Permutations. The Robinson-Schensted-Knuth Correspondence Posets of Permutations Simplicial Complexes of Permutations Get Them All. Algorithms and Permutations. Generating Permutations Stack Sorting Permutations Variations of Stack Sorting How Did We Get Here? Permutations as Genome Rearrangements. Introduction Block Transpositions Block Interchanges Block Transpositions Revisited Solutions to Odd-Numbered Exercises References List of Frequently Used Notation Index Exercises, Problems, and Problem Solutions appear at the end of each chapter.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77847671","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}
From the Publisher: This text makes in-depth explorations of a broad range of theoretical topics in computer science. It plunges into the applications of the abstract concepts in order to confront and address the skepticism of readers, and instill in them an appreciation for the usefulness of theory. A two-part presentation integrates logic and formal languageboth with applications. Chapter topics cover mathematical preliminaries, propositional logic, proving things: why and how, predicate logic, proving with predicates, program verification, logic programming, language models for computer science, language models, finite automata and their languages, regular expressions, Lex: a tool for building lexical scanners, context-free grammars, pushdown automata and parsing, and turing machines. For future computer scientists.
{"title":"Logic and language models for computer science","authors":"H. Hamburger, D. Richards","doi":"10.1145/507457.507471","DOIUrl":"https://doi.org/10.1145/507457.507471","url":null,"abstract":"From the Publisher: \u0000This text makes in-depth explorations of a broad range of theoretical topics in computer science. It plunges into the applications of the abstract concepts in order to confront and address the skepticism of readers, and instill in them an appreciation for the usefulness of theory. A two-part presentation integrates logic and formal languageboth with applications. Chapter topics cover mathematical preliminaries, propositional logic, proving things: why and how, predicate logic, proving with predicates, program verification, logic programming, language models for computer science, language models, finite automata and their languages, regular expressions, Lex: a tool for building lexical scanners, context-free grammars, pushdown automata and parsing, and turing machines. For future computer scientists.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81148673","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}
Overview. In this edition of the column, we have an exciting contribution from Luca Becchetti, Andrea Clementi, and Emanuele Natale, who provide an in-depth algorithmic perspective on emergent comp...
{"title":"Distributed Computing Column 77 Consensus Dynamics","authors":"AlistarhDan","doi":"10.1145/3388392.3388402","DOIUrl":"https://doi.org/10.1145/3388392.3388402","url":null,"abstract":"Overview. In this edition of the column, we have an exciting contribution from Luca Becchetti, Andrea Clementi, and Emanuele Natale, who provide an in-depth algorithmic perspective on emergent comp...","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77844343","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}
My deepest thanks to Sabine Broda, Antonio Machiavelo, Nelma Moreira, and Rogerio Reis for welcoming the year 2020 with their exciting tutorial, Analytic Combinatorics and Descriptional Complexity...
{"title":"SIGACT News Complexity Theory Column 104","authors":"A. HemaspaandraLane","doi":"10.1145/3388392.3388400","DOIUrl":"https://doi.org/10.1145/3388392.3388400","url":null,"abstract":"My deepest thanks to Sabine Broda, Antonio Machiavelo, Nelma Moreira, and Rogerio Reis for welcoming the year 2020 with their exciting tutorial, Analytic Combinatorics and Descriptional Complexity...","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77172942","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
扫码关注我们
求助内容：
应助结果提醒方式：