特邀文章前言

Journal of the ACM (JACM) Pub Date : 2021-01-15 DOI:10.1145/3442687

É. Tardos

{"title":"特邀文章前言","authors":"É. Tardos","doi":"10.1145/3442687","DOIUrl":null,"url":null,"abstract":"The Invited Article section of this issue includes “The Reachability Problem for Petri Nets Is Not Elementary,” by Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Flip Mazowiecki, which won the best paper award at the 51st Annual ACM Symposium on the Theory of Computing (STOC’19). We thank the STOC’19 Program Committee for their help in selecting this invited article, and we thank editor Martin Grohe for handling this article.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Invited Article Foreword\",\"authors\":\"É. Tardos\",\"doi\":\"10.1145/3442687\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Invited Article section of this issue includes “The Reachability Problem for Petri Nets Is Not Elementary,” by Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Flip Mazowiecki, which won the best paper award at the 51st Annual ACM Symposium on the Theory of Computing (STOC’19). We thank the STOC’19 Program Committee for their help in selecting this invited article, and we thank editor Martin Grohe for handling this article.\",\"PeriodicalId\":17199,\"journal\":{\"name\":\"Journal of the ACM (JACM)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the ACM (JACM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3442687\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the ACM (JACM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3442687","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本期的特邀文章部分包括Wojciech Czerwiński, Sławomir Lasota, Ranko laziki, Jérôme Leroux和Flip Mazowiecki的“Petri网的可达性问题不是基本的”，这篇文章在第51届ACM计算理论研讨会(STOC ' 19)上获得了最佳论文奖。我们感谢STOC ' 19项目委员会在选择这篇特邀文章方面的帮助，我们感谢编辑Martin Grohe对这篇文章的处理。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Invited Article Foreword

The Invited Article section of this issue includes “The Reachability Problem for Petri Nets Is Not Elementary,” by Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Flip Mazowiecki, which won the best paper award at the 51st Annual ACM Symposium on the Theory of Computing (STOC’19). We thank the STOC’19 Program Committee for their help in selecting this invited article, and we thank editor Martin Grohe for handling this article.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of the ACM (JACM)

自引率

0.00%

发文量