[{"doi":"10.1007/s00446-022-00439-5","article_type":"original","_id":"12164","year":"2023","acknowledgement":"A preliminary version of this work appeared in DISC’19. Mirza Ahad Baig, Alessia Milani and Corentin Travers are supported by ANR projects Descartes and FREDDA. Mirza Ahad Baig is supported by UMI Relax. Danny Hendler is supported by the Israel Science Foundation (Grants 380/18 and 1425/22).","keyword":["Computational Theory and Mathematics","Computer Networks and Communications","Hardware and Architecture","Theoretical Computer Science"],"date_created":"2023-01-12T12:10:08Z","citation":{"short":"M.A. Baig, D. Hendler, A. Milani, C. Travers, Distributed Computing 36 (2023) 29–43.","ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived counters with polylogarithmic amortized step complexity,” Distributed Computing, vol. 36. Springer Nature, pp. 29–43, 2023.","ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. 2023;36:29-43. doi:10.1007/s00446-022-00439-5","ista":"Baig MA, Hendler D, Milani A, Travers C. 2023. Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. 36, 29–43.","mla":"Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” Distributed Computing, vol. 36, Springer Nature, 2023, pp. 29–43, doi:10.1007/s00446-022-00439-5.","chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” Distributed Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00439-5.","apa":"Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2023). Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-022-00439-5"},"date_published":"2023-03-01T00:00:00Z","publisher":"Springer Nature","quality_controlled":"1","volume":36,"department":[{"_id":"KrPi"}],"page":"29-43","abstract":[{"text":"A shared-memory counter is a widely-used and well-studied concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. In Jayanti et al (SIAM J Comput, 30(2), 2000), Jayanti, Tan and Toueg proved a linear lower bound on the worst-case step complexity of obstruction-free implementations, from read-write registers, of a large class of shared objects that includes counters. The lower bound leaves open the question of finding counter implementations with sub-linear amortized step complexity. In this work, we address this gap. We show that n-process, wait-free and linearizable counters can be implemented from read-write registers with O(log2n) amortized step complexity. This is the first counter algorithm from read-write registers that provides sub-linear amortized step complexity in executions of arbitrary length. Since a logarithmic lower bound on the amortized step complexity of obstruction-free counter implementations exists, our upper bound is within a logarithmic factor of the optimal. The worst-case step complexity of the construction remains linear, which is optimal. This is obtained thanks to a new max register construction with O(logn) amortized step complexity in executions of arbitrary length in which the value stored in the register does not grow too quickly. We then leverage an existing counter algorithm by Aspnes, Attiya and Censor-Hillel [1] in which we “plug” our max register implementation to show that it remains linearizable while achieving O(log2n) amortized step complexity.","lang":"eng"}],"external_id":{"isi":["000890138700001"]},"publication_status":"published","publication":"Distributed Computing","language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","intvolume":" 36","article_processing_charge":"No","oa":1,"date_updated":"2023-08-16T08:39:36Z","title":"Long-lived counters with polylogarithmic amortized step complexity","type":"journal_article","status":"public","month":"03","publication_identifier":{"eissn":["1432-0452"],"issn":["0178-2770"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Preprint","main_file_link":[{"url":"https://drops.dagstuhl.de/opus/volltexte/2019/11310/","open_access":"1"}],"author":[{"first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad","last_name":"Baig","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"},{"last_name":"Hendler","first_name":"Danny","full_name":"Hendler, Danny"},{"last_name":"Milani","full_name":"Milani, Alessia","first_name":"Alessia"},{"last_name":"Travers","first_name":"Corentin","full_name":"Travers, Corentin"}]},{"language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","oa":1,"date_updated":"2023-08-01T12:47:32Z","article_processing_charge":"No","title":"Local criteria for triangulating general manifolds","isi":1,"intvolume":" 69","has_accepted_license":"1","scopus_import":"1","status":"public","type":"journal_article","author":[{"last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel"},{"first_name":"Ramsay","full_name":"Dyer, Ramsay","last_name":"Dyer"},{"full_name":"Ghosh, Arijit","first_name":"Arijit","last_name":"Ghosh"},{"last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","full_name":"Wintraecken, Mathijs"}],"month":"01","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"day":"01","oa_version":"Published Version","file":[{"relation":"main_file","file_size":582850,"access_level":"open_access","content_type":"application/pdf","creator":"dernst","date_created":"2023-02-02T11:01:10Z","date_updated":"2023-02-02T11:01:10Z","success":1,"file_id":"12488","checksum":"46352e0ee71e460848f88685ca852681","file_name":"2023_DiscreteCompGeometry_Boissonnat.pdf"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file_date_updated":"2023-02-02T11:01:10Z","_id":"12287","article_type":"original","doi":"10.1007/s00454-022-00431-7","acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian Science Fund (FWF): M-3073. A part of the results described in this paper were presented at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science Fund (FWF).","year":"2023","date_created":"2023-01-16T10:04:06Z","citation":{"apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local criteria for triangulating general manifolds. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7","ama":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 2023;69:156-191. doi:10.1007/s00454-022-00431-7","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” Discrete & Computational Geometry, vol. 69. Springer Nature, pp. 156–191, 2023.","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 69, 156–191.","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7.","mla":"Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry, vol. 69, Springer Nature, 2023, pp. 156–91, doi:10.1007/s00454-022-00431-7."},"keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"ec_funded":1,"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073"}],"publisher":"Springer Nature","date_published":"2023-01-01T00:00:00Z","department":[{"_id":"HeEd"}],"page":"156-191","volume":69,"quality_controlled":"1","publication_status":"published","ddc":["510"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"isi":["000862193600001"]},"abstract":[{"lang":"eng","text":"We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use."}]},{"ec_funded":1,"acknowledgement":"Andrei Krokhin and Jakub Opršal were supported by the UK EPSRC grant EP/R034516/1. Jakub Opršal has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No 101034413. Stanislav Živný was supported by a Royal Society University Research Fellowship. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 714532). The paper re\u001eects only the authors’ views and not the views of the ERC or the European Commission. ","year":"2023","citation":{"apa":"Krokhin, A., Opršal, J., Wrochna, M., & Živný, S. (2023). Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/20m1378223","chicago":"Krokhin, Andrei, Jakub Opršal, Marcin Wrochna, and Stanislav Živný. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2023. https://doi.org/10.1137/20m1378223.","mla":"Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial & Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.","ista":"Krokhin A, Opršal J, Wrochna M, Živný S. 2023. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 52(1), 38–79.","ieee":"A. Krokhin, J. Opršal, M. Wrochna, and S. Živný, “Topology and adjunction in promise constraint satisfaction,” SIAM Journal on Computing, vol. 52, no. 1. Society for Industrial & Applied Mathematics, pp. 38–79, 2023.","ama":"Krokhin A, Opršal J, Wrochna M, Živný S. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 2023;52(1):38-79. doi:10.1137/20m1378223","short":"A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79."},"date_created":"2023-02-16T07:03:52Z","keyword":["General Mathematics","General Computer Science"],"doi":"10.1137/20m1378223","_id":"12563","article_type":"original","external_id":{"isi":["000955000000001"],"arxiv":["2003.11351"]},"abstract":[{"lang":"eng","text":"he approximate graph coloring problem, whose complexity is unresolved in most cases, concerns finding a c-coloring of a graph that is promised to be k-colorable, where c≥k. This problem naturally generalizes to promise graph homomorphism problems and further to promise constraint satisfaction problems. The complexity of these problems has recently been studied through an algebraic approach. In this paper, we introduce two new techniques to analyze the complexity of promise CSPs: one is based on topology and the other on adjunction. We apply these techniques, together with the previously introduced algebraic approach, to obtain new unconditional NP-hardness results for a significant class of approximate graph coloring and promise graph homomorphism problems."}],"publication_status":"published","publisher":"Society for Industrial & Applied Mathematics","date_published":"2023-01-01T00:00:00Z","page":"38-79","department":[{"_id":"UlWa"}],"volume":52,"quality_controlled":"1","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"}],"isi":1,"intvolume":" 52","scopus_import":"1","oa":1,"date_updated":"2023-08-01T13:11:30Z","issue":"1","article_processing_charge":"No","title":"Topology and adjunction in promise constraint satisfaction","publication":"SIAM Journal on Computing","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"oa_version":"Preprint","day":"01","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2003.11351","open_access":"1"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Krokhin, Andrei","first_name":"Andrei","last_name":"Krokhin"},{"orcid":"0000-0003-1245-3456","id":"ec596741-c539-11ec-b829-c79322a91242","last_name":"Opršal","full_name":"Opršal, Jakub","first_name":"Jakub"},{"first_name":"Marcin","full_name":"Wrochna, Marcin","last_name":"Wrochna"},{"last_name":"Živný","full_name":"Živný, Stanislav","first_name":"Stanislav"}],"arxiv":1,"status":"public","type":"journal_article"},{"publication_status":"published","external_id":{"isi":["000927831000001"]},"abstract":[{"lang":"eng","text":"Most permissionless blockchains inherently suffer from throughput limitations. Layer-2 systems, such as side-chains or Rollups, have been proposed as a possible strategy to overcome this limitation. Layer-2 systems interact with the main-chain in two ways. First, users can move funds from/to the main-chain to/from the layer-2. Second, layer-2 systems periodically synchronize with the main-chain to keep some form of log of their activity on the main-chain - this log is key for security. Due to this interaction with the main-chain, which is necessary and recurrent, layer-2 systems impose some load on the main-chain. The impact of such load on the main-chain has been, so far, poorly understood. In addition to that, layer-2 approaches typically sacrifice decentralization and security in favor of higher throughput. This paper presents an experimental study that analyzes the current state of Ethereum layer-2 projects. Our goal is to assess the load they impose on Ethereum and to understand their scalability potential in the long-run. Our analysis shows that the impact of any given layer-2 on the main-chain is the result of both technical aspects (how state is logged on the main-chain) and user behavior (how often users decide to transfer funds between the layer-2 and the main-chain). Based on our observations, we infer that without efficient mechanisms that allow users to transfer funds in a secure and fast manner directly from one layer-2 project to another, current layer-2 systems will not be able to scale Ethereum effectively, regardless of their technical solutions. Furthermore, from our results, we conclude that the layer-2 systems that offer similar security guarantees as Ethereum have limited scalability potential, while approaches that offer better performance, sacrifice security and lead to an increase in centralization which runs against the end-goals of permissionless blockchains."}],"ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"page":"8651-8662","department":[{"_id":"ElKo"}],"volume":11,"quality_controlled":"1","publisher":"Institute of Electrical and Electronics Engineers","date_published":"2023-08-01T00:00:00Z","date_created":"2023-08-09T12:09:57Z","citation":{"apa":"Neiheiser, R., Inacio, G., Rech, L., Montez, C., Matos, M., & Rodrigues, L. (2023). Practical limitations of Ethereum’s layer-2. IEEE Access. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/access.2023.3237897","ista":"Neiheiser R, Inacio G, Rech L, Montez C, Matos M, Rodrigues L. 2023. Practical limitations of Ethereum’s layer-2. IEEE Access. 11, 8651–8662.","chicago":"Neiheiser, Ray, Gustavo Inacio, Luciana Rech, Carlos Montez, Miguel Matos, and Luis Rodrigues. “Practical Limitations of Ethereum’s Layer-2.” IEEE Access. Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/access.2023.3237897.","mla":"Neiheiser, Ray, et al. “Practical Limitations of Ethereum’s Layer-2.” IEEE Access, vol. 11, Institute of Electrical and Electronics Engineers, 2023, pp. 8651–62, doi:10.1109/access.2023.3237897.","short":"R. Neiheiser, G. Inacio, L. Rech, C. Montez, M. Matos, L. Rodrigues, IEEE Access 11 (2023) 8651–8662.","ieee":"R. Neiheiser, G. Inacio, L. Rech, C. Montez, M. Matos, and L. Rodrigues, “Practical limitations of Ethereum’s layer-2,” IEEE Access, vol. 11. Institute of Electrical and Electronics Engineers, pp. 8651–8662, 2023.","ama":"Neiheiser R, Inacio G, Rech L, Montez C, Matos M, Rodrigues L. Practical limitations of Ethereum’s layer-2. IEEE Access. 2023;11:8651-8662. doi:10.1109/access.2023.3237897"},"keyword":["General Engineering","General Materials Science","General Computer Science","Electrical and Electronic Engineering"],"acknowledgement":"This work was supported in part by the Coordenação de Aperfeiçoamento de Pessoal de Nivel Superior (CAPES)—Brazil (CAPES), in part by the Fundação para a Ciência e Tecnologia (FCT) under Project UIDB/50021/2020 and Grant 2020.05270.BD, in part by the Project COSMOS (via the Orçamento de Estado (OE) with ref. PTDC/EEI-COM/29271/2017 and via the ‘‘Programa Operacional Regional de Lisboa na sua componente Fundo Europeu de Desenvolvimento Regional (FEDER)’’ with ref. Lisboa-01-0145-FEDER-029271), and in part by the project Angainor with reference LISBOA-01-0145-FEDER-031456 as well as supported by Meta Platforms for the project key Transparency at Scale.","year":"2023","file_date_updated":"2023-08-22T06:37:48Z","_id":"13988","article_type":"original","doi":"10.1109/access.2023.3237897","author":[{"orcid":"0000-0001-7227-8309","last_name":"Neiheiser","id":"f09651b9-fec0-11ec-b5d8-934aff0e52a4","first_name":"Ray","full_name":"Neiheiser, Ray"},{"last_name":"Inacio","first_name":"Gustavo","full_name":"Inacio, Gustavo"},{"last_name":"Rech","first_name":"Luciana","full_name":"Rech, Luciana"},{"first_name":"Carlos","full_name":"Montez, Carlos","last_name":"Montez"},{"last_name":"Matos","full_name":"Matos, Miguel","first_name":"Miguel"},{"last_name":"Rodrigues","full_name":"Rodrigues, Luis","first_name":"Luis"}],"oa_version":"Published Version","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"14166","file_name":"2023_IEEEAccess_Neiheiser.pdf","checksum":"4b80b0ff212edf7e5842fbdd53784432","success":1,"date_updated":"2023-08-22T06:37:48Z","date_created":"2023-08-22T06:37:48Z","creator":"dernst","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":1289285}],"publication_identifier":{"issn":["2169-3536"]},"month":"08","type":"journal_article","status":"public","title":"Practical limitations of Ethereum’s layer-2","date_updated":"2023-12-13T12:14:52Z","oa":1,"article_processing_charge":"Yes","intvolume":" 11","has_accepted_license":"1","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"publication":"IEEE Access"},{"date_published":"2023-07-01T00:00:00Z","publisher":"Institute of Electrical and Electronics Engineers","volume":69,"quality_controlled":"1","page":"4093-4127","department":[{"_id":"MaMo"}],"abstract":[{"text":"We consider zero-error communication over a two-transmitter deterministic adversarial multiple access channel (MAC) governed by an adversary who has access to the transmissions of both senders (hence called omniscient ) and aims to maliciously corrupt the communication. None of the encoders, jammer and decoder is allowed to randomize using private or public randomness. This enforces a combinatorial nature of the problem. Our model covers a large family of channels studied in the literature, including all deterministic discrete memoryless noisy or noiseless MACs. In this work, given an arbitrary two-transmitter deterministic omniscient adversarial MAC, we characterize when the capacity region: 1) has nonempty interior (in particular, is two-dimensional); 2) consists of two line segments (in particular, has empty interior); 3) consists of one line segment (in particular, is one-dimensional); 4) or only contains (0,0) (in particular, is zero-dimensional). This extends a recent result by Wang et al. (201 9) from the point-to-point setting to the multiple access setting. Indeed, our converse arguments build upon their generalized Plotkin bound and involve delicate case analysis. One of the technical challenges is to take care of both “joint confusability” and “marginal confusability”. In particular, the treatment of marginal confusability does not follow from the point-to-point results by Wang et al. Our achievability results follow from random coding with expurgation.","lang":"eng"}],"external_id":{"arxiv":["2101.12426"]},"publication_status":"published","doi":"10.1109/tit.2023.3257239","_id":"14751","article_type":"original","year":"2023","acknowledgement":"The author would like to thank Amitalok J. Budkuley and Sidharth Jaggi for many helpful discussions at the early stage of this work. He would also like to thank Nir Ailon, Qi Cao, and Chandra Nair for discussions on a related problem regarding zero-error binary adder MACs.\r\nThe work of Yihan Zhang was supported by the European Union’s Horizon 2020 Research and Innovation Programme under Grant 682203-ERC-[Inf-Speed-Tradeoff]","keyword":["Computer Science Applications","Information Systems"],"citation":{"apa":"Zhang, Y. (2023). Zero-error communication over adversarial MACs. IEEE Transactions on Information Theory. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/tit.2023.3257239","ieee":"Y. Zhang, “Zero-error communication over adversarial MACs,” IEEE Transactions on Information Theory, vol. 69, no. 7. Institute of Electrical and Electronics Engineers, pp. 4093–4127, 2023.","ama":"Zhang Y. Zero-error communication over adversarial MACs. IEEE Transactions on Information Theory. 2023;69(7):4093-4127. doi:10.1109/tit.2023.3257239","short":"Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 4093–4127.","chicago":"Zhang, Yihan. “Zero-Error Communication over Adversarial MACs.” IEEE Transactions on Information Theory. Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/tit.2023.3257239.","mla":"Zhang, Yihan. “Zero-Error Communication over Adversarial MACs.” IEEE Transactions on Information Theory, vol. 69, no. 7, Institute of Electrical and Electronics Engineers, 2023, pp. 4093–127, doi:10.1109/tit.2023.3257239.","ista":"Zhang Y. 2023. Zero-error communication over adversarial MACs. IEEE Transactions on Information Theory. 69(7), 4093–4127."},"date_created":"2024-01-08T13:04:54Z","status":"public","type":"journal_article","month":"07","publication_identifier":{"eissn":["1557-9654"],"issn":["0018-9448"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2101.12426"}],"day":"01","arxiv":1,"author":[{"id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","last_name":"Zhang","orcid":"0000-0002-6465-6258","first_name":"Yihan","full_name":"Zhang, Yihan"}],"publication":"IEEE Transactions on Information Theory","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":" 69","article_processing_charge":"No","issue":"7","oa":1,"date_updated":"2024-01-09T08:45:24Z","title":"Zero-error communication over adversarial MACs"},{"article_number":"16527","keyword":["Inorganic Chemistry","Organic Chemistry","Physical and Theoretical Chemistry","Computer Science Applications","Spectroscopy","Molecular Biology","General Medicine","Catalysis"],"citation":{"apa":"Teplova, A., Pigidanov, A. A., Serebryakova, M. V., Golyshev, S. A., Galiullina, R. A., Chichkova, N. V., & Vartapetian, A. B. (2023). Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms242216527","ista":"Teplova A, Pigidanov AA, Serebryakova MV, Golyshev SA, Galiullina RA, Chichkova NV, Vartapetian AB. 2023. Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3. International Journal of Molecular Sciences. 24(22), 16527.","mla":"Teplova, Anastasiia, et al. “Phytaspase Is Capable of Detaching the Endoplasmic Reticulum Retrieval Signal from Tobacco Calreticulin-3.” International Journal of Molecular Sciences, vol. 24, no. 22, 16527, MDPI, 2023, doi:10.3390/ijms242216527.","chicago":"Teplova, Anastasiia, Artemii A. Pigidanov, Marina V. Serebryakova, Sergei A. Golyshev, Raisa A. Galiullina, Nina V. Chichkova, and Andrey B. Vartapetian. “Phytaspase Is Capable of Detaching the Endoplasmic Reticulum Retrieval Signal from Tobacco Calreticulin-3.” International Journal of Molecular Sciences. MDPI, 2023. https://doi.org/10.3390/ijms242216527.","ama":"Teplova A, Pigidanov AA, Serebryakova MV, et al. Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3. International Journal of Molecular Sciences. 2023;24(22). doi:10.3390/ijms242216527","ieee":"A. Teplova et al., “Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3,” International Journal of Molecular Sciences, vol. 24, no. 22. MDPI, 2023.","short":"A. Teplova, A.A. Pigidanov, M.V. Serebryakova, S.A. Golyshev, R.A. Galiullina, N.V. Chichkova, A.B. Vartapetian, International Journal of Molecular Sciences 24 (2023)."},"date_created":"2024-01-10T09:24:35Z","year":"2023","acknowledgement":"We thank C.U.T. Hellen for critically reading the manuscript. The MALDI MS facility and CLSM became available to us in the framework of Moscow State University Development Programs PNG 5.13 and PNR 5.13.\r\nThis work was funded by the Russian Science Foundation, grant numbers 19-14-00010 and 22-14-00071.","doi":"10.3390/ijms242216527","article_type":"original","_id":"14776","file_date_updated":"2024-01-10T13:39:42Z","abstract":[{"text":"Soluble chaperones residing in the endoplasmic reticulum (ER) play vitally important roles in folding and quality control of newly synthesized proteins that transiently pass through the ER en route to their final destinations. These soluble residents of the ER are themselves endowed with an ER retrieval signal that enables the cell to bring the escaped residents back from the Golgi. Here, by using purified proteins, we showed that Nicotiana tabacum phytaspase, a plant aspartate-specific protease, introduces two breaks at the C-terminus of the N. tabacum ER resident calreticulin-3. These cleavages resulted in removal of either a dipeptide or a hexapeptide from the C-terminus of calreticulin-3 encompassing part or all of the ER retrieval signal. Consistently, expression of the calreticulin-3 derivative mimicking the phytaspase cleavage product in Nicotiana benthamiana cells demonstrated loss of the ER accumulation of the protein. Notably, upon its escape from the ER, calreticulin-3 was further processed by an unknown protease(s) to generate the free N-terminal (N) domain of calreticulin-3, which was ultimately secreted into the apoplast. Our study thus identified a specific proteolytic enzyme capable of precise detachment of the ER retrieval signal from a plant ER resident protein, with implications for the further fate of the escaped resident.","lang":"eng"}],"external_id":{"isi":["001113792600001"],"pmid":["38003717"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["580"],"publication_status":"published","volume":24,"quality_controlled":"1","department":[{"_id":"JiFr"}],"date_published":"2023-11-01T00:00:00Z","publisher":"MDPI","has_accepted_license":"1","intvolume":" 24","isi":1,"title":"Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3","issue":"22","article_processing_charge":"Yes","oa":1,"date_updated":"2024-01-10T13:41:10Z","publication":"International Journal of Molecular Sciences","language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":2637784,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"2023_IJMS_Teplova.pdf","file_id":"14791","checksum":"4df7d206ba022b7f54eff1f0aec1659a","success":1,"date_updated":"2024-01-10T13:39:42Z","date_created":"2024-01-10T13:39:42Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Published Version","publication_identifier":{"issn":["1422-0067"]},"month":"11","author":[{"full_name":"Teplova, Anastasiia","first_name":"Anastasiia","last_name":"Teplova","id":"e3736151-106c-11ec-b916-c2558e2762c6"},{"full_name":"Pigidanov, Artemii A.","first_name":"Artemii A.","last_name":"Pigidanov"},{"last_name":"Serebryakova","first_name":"Marina V.","full_name":"Serebryakova, Marina V."},{"last_name":"Golyshev","first_name":"Sergei A.","full_name":"Golyshev, Sergei A."},{"full_name":"Galiullina, Raisa A.","first_name":"Raisa A.","last_name":"Galiullina"},{"last_name":"Chichkova","first_name":"Nina V.","full_name":"Chichkova, Nina V."},{"last_name":"Vartapetian","first_name":"Andrey B.","full_name":"Vartapetian, Andrey B."}],"status":"public","type":"journal_article","pmid":1},{"month":"06","publication_identifier":{"issn":["0934-5043"],"eissn":["1433-299X"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"success":1,"checksum":"3bb133eeb27ec01649a9a36445d952d9","file_id":"14804","file_name":"2023_FormalAspectsComputing_Chatterjee.pdf","date_created":"2024-01-16T08:11:24Z","date_updated":"2024-01-16T08:11:24Z","creator":"dernst","relation":"main_file","file_size":502522,"access_level":"open_access","content_type":"application/pdf"}],"oa_version":"Published Version","day":"23","arxiv":1,"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kafshdar Goharshady","full_name":"Kafshdar Goharshady, Ehsan","first_name":"Ehsan"},{"full_name":"Novotný, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný"},{"last_name":"Zárevúcky","first_name":"Jiří","full_name":"Zárevúcky, Jiří"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde","first_name":"Dorde"}],"status":"public","type":"journal_article","intvolume":" 35","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","issue":"2","date_updated":"2025-07-14T09:10:10Z","oa":1,"title":"On lexicographic proof rules for probabilistic termination","publication":"Formal Aspects of Computing","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"abstract":[{"text":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs.","lang":"eng"}],"external_id":{"arxiv":["2108.02188"]},"publication_status":"published","date_published":"2023-06-23T00:00:00Z","publisher":"Association for Computing Machinery","quality_controlled":"1","volume":35,"department":[{"_id":"KrCh"}],"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"article_number":"11","related_material":{"record":[{"status":"public","id":"10414","relation":"earlier_version"}]},"ec_funded":1,"year":"2023","acknowledgement":"This research was partially supported by the ERC CoG (grant no. 863818; ForM-SMArt), the Czech Science Foundation (grant no. GA21-24711S), and the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385.","keyword":["Theoretical Computer Science","Software"],"date_created":"2024-01-10T09:27:43Z","citation":{"apa":"Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., & Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. Association for Computing Machinery. https://doi.org/10.1145/3585391","short":"K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, Formal Aspects of Computing 35 (2023).","ama":"Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. 2023;35(2). doi:10.1145/3585391","ieee":"K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” Formal Aspects of Computing, vol. 35, no. 2. Association for Computing Machinery, 2023.","mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” Formal Aspects of Computing, vol. 35, no. 2, 11, Association for Computing Machinery, 2023, doi:10.1145/3585391.","ista":"Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2023. On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. 35(2), 11.","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” Formal Aspects of Computing. Association for Computing Machinery, 2023. https://doi.org/10.1145/3585391."},"doi":"10.1145/3585391","_id":"14778","article_type":"original","file_date_updated":"2024-01-16T08:11:24Z"},{"publication":"Symmetry","language":[{"iso":"eng"}],"scopus_import":"1","has_accepted_license":"1","intvolume":" 14","isi":1,"title":"First and second sound in two-dimensional bosonic and fermionic superfluids","date_updated":"2023-08-09T10:13:17Z","oa":1,"issue":"10","article_processing_charge":"Yes","type":"journal_article","status":"public","day":"17","oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"dernst","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":843723,"checksum":"9b6bd0e484834dd76d7b26e3c5fba8bd","file_name":"2022_Symmetry_Salsnich.pdf","file_id":"12361","success":1,"date_updated":"2023-01-24T10:56:12Z","date_created":"2023-01-24T10:56:12Z"}],"month":"10","publication_identifier":{"issn":["2073-8994"]},"author":[{"full_name":"Salasnich, Luca","first_name":"Luca","last_name":"Salasnich"},{"first_name":"Alberto","full_name":"Cappellaro, Alberto","id":"9d13b3cb-30a2-11eb-80dc-f772505e8660","last_name":"Cappellaro","orcid":"0000-0001-6110-2359"},{"first_name":"Koichiro","full_name":"Furutani, Koichiro","last_name":"Furutani"},{"first_name":"Andrea","full_name":"Tononi, Andrea","last_name":"Tononi"},{"id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","last_name":"Bighin","orcid":"0000-0001-8823-9777","first_name":"Giacomo","full_name":"Bighin, Giacomo"}],"doi":"10.3390/sym14102182","file_date_updated":"2023-01-24T10:56:12Z","article_type":"original","_id":"12154","article_number":"2182","citation":{"apa":"Salasnich, L., Cappellaro, A., Furutani, K., Tononi, A., & Bighin, G. (2022). First and second sound in two-dimensional bosonic and fermionic superfluids. Symmetry. MDPI. https://doi.org/10.3390/sym14102182","ieee":"L. Salasnich, A. Cappellaro, K. Furutani, A. Tononi, and G. Bighin, “First and second sound in two-dimensional bosonic and fermionic superfluids,” Symmetry, vol. 14, no. 10. MDPI, 2022.","ama":"Salasnich L, Cappellaro A, Furutani K, Tononi A, Bighin G. First and second sound in two-dimensional bosonic and fermionic superfluids. Symmetry. 2022;14(10). doi:10.3390/sym14102182","short":"L. Salasnich, A. Cappellaro, K. Furutani, A. Tononi, G. Bighin, Symmetry 14 (2022).","chicago":"Salasnich, Luca, Alberto Cappellaro, Koichiro Furutani, Andrea Tononi, and Giacomo Bighin. “First and Second Sound in Two-Dimensional Bosonic and Fermionic Superfluids.” Symmetry. MDPI, 2022. https://doi.org/10.3390/sym14102182.","mla":"Salasnich, Luca, et al. “First and Second Sound in Two-Dimensional Bosonic and Fermionic Superfluids.” Symmetry, vol. 14, no. 10, 2182, MDPI, 2022, doi:10.3390/sym14102182.","ista":"Salasnich L, Cappellaro A, Furutani K, Tononi A, Bighin G. 2022. First and second sound in two-dimensional bosonic and fermionic superfluids. Symmetry. 14(10), 2182."},"date_created":"2023-01-12T12:08:31Z","keyword":["Physics and Astronomy (miscellaneous)","General Mathematics","Chemistry (miscellaneous)","Computer Science (miscellaneous)"],"acknowledgement":"This research is partially supported by University of Padova, BIRD grant “Ultracold atoms\r\nin curved geometries”. KF is supported by Fondazione CARIPARO with a PhD fellowship. AT is\r\npartially supported by French National Research Agency ANR Grant Droplets N. ANR-19-CE30-0003-02. LS thanks Herwig Ott and Sandro Wimberger for their kind invitation to the\r\nInternational Workshop “Quantum Transport with ultracold atoms” (2022).","year":"2022","department":[{"_id":"MiLe"}],"volume":14,"quality_controlled":"1","publisher":"MDPI","date_published":"2022-10-17T00:00:00Z","external_id":{"isi":["000875039200001"]},"abstract":[{"lang":"eng","text":"We review our theoretical results of the sound propagation in two-dimensional (2D) systems of ultracold fermionic and bosonic atoms. In the superfluid phase, characterized by the spontaneous symmetry breaking of the U(1) symmetry, there is the coexistence of first and second sound. In the case of weakly-interacting repulsive bosons, we model the recent measurements of the sound velocities of 39K atoms in 2D obtained in the weakly-interacting regime and around the Berezinskii–Kosterlitz–Thouless (BKT) superfluid-to-normal transition temperature. In particular, we perform a quite accurate computation of the superfluid density and show that it is reasonably consistent with the experimental results. For superfluid attractive fermions, we calculate the first and second sound velocities across the whole BCS-BEC crossover. In the low-temperature regime, we reproduce the recent measurements of first-sound speed with 6Li atoms. We also predict that there is mixing between sound modes only in the finite-temperature BEC regime."}],"ddc":["530"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published"},{"issue":"9","article_processing_charge":"Yes (via OA deal)","date_updated":"2023-02-13T09:20:34Z","oa":1,"title":"Eukaryotic gene regulation at equilibrium, or non?","intvolume":" 31","scopus_import":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"Current Opinion in Systems Biology","author":[{"full_name":"Zoller, Benjamin","first_name":"Benjamin","last_name":"Zoller"},{"last_name":"Gregor","full_name":"Gregor, Thomas","first_name":"Thomas"},{"first_name":"Gašper","full_name":"Tkačik, Gašper","orcid":"1","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"month":"09","publication_identifier":{"issn":["2452-3100"]},"file":[{"creator":"dernst","relation":"main_file","file_size":2214944,"access_level":"open_access","content_type":"application/pdf","checksum":"97ef01e0cc60cdc84f45640a0f248fb0","file_id":"12362","file_name":"2022_CurrentBiology_Zoller.pdf","success":1,"date_updated":"2023-01-24T12:14:10Z","date_created":"2023-01-24T12:14:10Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Published Version","status":"public","type":"journal_article","year":"2022","acknowledgement":"This work was supported through the Center for the Physics of Biological Function (PHYe1734030) and by National Institutes of Health Grants R01GM097275 and U01DK127429 (TG). GT acknowledges the support of the Austrian Science Fund grant FWF P28844 and the Human Frontiers Science Program. ","keyword":["Applied Mathematics","Computer Science Applications","Drug Discovery","General Biochemistry","Genetics and Molecular Biology","Modeling and Simulation"],"date_created":"2023-01-12T12:08:51Z","citation":{"apa":"Zoller, B., Gregor, T., & Tkačik, G. (2022). Eukaryotic gene regulation at equilibrium, or non? Current Opinion in Systems Biology. Elsevier. https://doi.org/10.1016/j.coisb.2022.100435","ama":"Zoller B, Gregor T, Tkačik G. Eukaryotic gene regulation at equilibrium, or non? Current Opinion in Systems Biology. 2022;31(9). doi:10.1016/j.coisb.2022.100435","ieee":"B. Zoller, T. Gregor, and G. Tkačik, “Eukaryotic gene regulation at equilibrium, or non?,” Current Opinion in Systems Biology, vol. 31, no. 9. Elsevier, 2022.","short":"B. Zoller, T. Gregor, G. Tkačik, Current Opinion in Systems Biology 31 (2022).","ista":"Zoller B, Gregor T, Tkačik G. 2022. Eukaryotic gene regulation at equilibrium, or non? Current Opinion in Systems Biology. 31(9), 100435.","chicago":"Zoller, Benjamin, Thomas Gregor, and Gašper Tkačik. “Eukaryotic Gene Regulation at Equilibrium, or Non?” Current Opinion in Systems Biology. Elsevier, 2022. https://doi.org/10.1016/j.coisb.2022.100435.","mla":"Zoller, Benjamin, et al. “Eukaryotic Gene Regulation at Equilibrium, or Non?” Current Opinion in Systems Biology, vol. 31, no. 9, 100435, Elsevier, 2022, doi:10.1016/j.coisb.2022.100435."},"article_number":"100435","_id":"12156","article_type":"original","file_date_updated":"2023-01-24T12:14:10Z","doi":"10.1016/j.coisb.2022.100435","publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["570"],"abstract":[{"lang":"eng","text":"Models of transcriptional regulation that assume equilibrium binding of transcription factors have been less successful at predicting gene expression from sequence in eukaryotes than in bacteria. This could be due to the non-equilibrium nature of eukaryotic regulation. Unfortunately, the space of possible non-equilibrium mechanisms is vast and predominantly uninteresting. The key question is therefore how this space can be navigated efficiently, to focus on mechanisms and models that are biologically relevant. In this review, we advocate for the normative role of theory—theory that prescribes rather than just describes—in providing such a focus. Theory should expand its remit beyond inferring mechanistic models from data, towards identifying non-equilibrium gene regulatory schemes that may have been evolutionarily selected, despite their energy consumption, because they are precise, reliable, fast, or otherwise outperform regulation at equilibrium. We illustrate our reasoning by toy examples for which we provide simulation code."}],"project":[{"call_identifier":"FWF","name":"Biophysics of information processing in gene regulation","_id":"254E9036-B435-11E9-9278-68D0E5697425","grant_number":"P28844-B27"}],"date_published":"2022-09-01T00:00:00Z","publisher":"Elsevier","volume":31,"quality_controlled":"1","department":[{"_id":"GaTk"}]},{"article_type":"original","_id":"12286","file_date_updated":"2023-01-30T11:45:13Z","doi":"10.37236/10794","year":"2022","acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","keyword":["Computational Theory and Mathematics","Geometry and Topology","Theoretical Computer Science","Applied Mathematics","Discrete Mathematics and Combinatorics"],"date_created":"2023-01-16T10:03:57Z","citation":{"apa":"Cooley, O., Kang, M., & Zalla, J. (2022). Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics. https://doi.org/10.37236/10794","short":"O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29 (2022).","ama":"Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 2022;29(4). doi:10.37236/10794","ieee":"O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,” The Electronic Journal of Combinatorics, vol. 29, no. 4. The Electronic Journal of Combinatorics, 2022.","mla":"Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.” The Electronic Journal of Combinatorics, vol. 29, no. 4, P4.13, The Electronic Journal of Combinatorics, 2022, doi:10.37236/10794.","chicago":"Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles in Random Hypergraphs.” The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2022. https://doi.org/10.37236/10794.","ista":"Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 29(4), P4.13."},"article_number":"P4.13","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_published":"2022-10-21T00:00:00Z","publisher":"The Electronic Journal of Combinatorics","volume":29,"quality_controlled":"1","department":[{"_id":"MaKw"}],"publication_status":"published","tmp":{"image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"ddc":["510"],"abstract":[{"text":"Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structurewhich mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition at a certain critical threshold and determine this order, as well as the number of edges, asymptotically in the subcritical and supercritical regimes.
\r\nOur main tool is an algorithm called CoreConstruct, which enables us to analyse a peeling process for the loose core. By analysing this algorithm we determine the asymptotic degree distribution of vertices in the loose core and in particular how many vertices and edges the loose core contains. As a corollary we obtain an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$.","lang":"eng"}],"external_id":{"isi":["000876763300001"]},"language":[{"iso":"eng"}],"publication":"The Electronic Journal of Combinatorics","issue":"4","article_processing_charge":"No","oa":1,"date_updated":"2023-08-04T10:29:18Z","title":"Loose cores and cycles in random hypergraphs","isi":1,"intvolume":" 29","has_accepted_license":"1","scopus_import":"1","type":"journal_article","status":"public","author":[{"first_name":"Oliver","full_name":"Cooley, Oliver","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","last_name":"Cooley"},{"last_name":"Kang","full_name":"Kang, Mihyun","first_name":"Mihyun"},{"last_name":"Zalla","full_name":"Zalla, Julian","first_name":"Julian"}],"publication_identifier":{"eissn":["1077-8926"]},"month":"10","file":[{"date_created":"2023-01-30T11:45:13Z","date_updated":"2023-01-30T11:45:13Z","success":1,"checksum":"00122b2459f09b5ae43073bfba565e94","file_name":"2022_ElecJournCombinatorics_Cooley_Kang_Zalla.pdf","file_id":"12462","content_type":"application/pdf","access_level":"open_access","file_size":626953,"relation":"main_file","creator":"dernst"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"21","oa_version":"Published Version"},{"language":[{"iso":"eng"}],"publication":"Mathematics of Operations Research","oa":1,"date_updated":"2023-09-05T13:16:11Z","issue":"1","article_processing_charge":"No","title":"Finite-memory strategies in POMDPs with long-run average objectives","isi":1,"intvolume":" 47","scopus_import":"1","status":"public","type":"journal_article","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0001-5103-038X","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J"},{"last_name":"Ziliotto","full_name":"Ziliotto, Bruno","first_name":"Bruno"}],"arxiv":1,"month":"02","publication_identifier":{"issn":["0364-765X"],"eissn":["1526-5471"]},"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1904.13360","open_access":"1"}],"day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9311","article_type":"original","doi":"10.1287/moor.2020.1116","acknowledgement":"Partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT through grant C15E03.\r\n","year":"2022","date_created":"2021-04-08T09:33:31Z","citation":{"apa":"Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116","ieee":"K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022.","ama":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119. doi:10.1287/moor.2020.1116","short":"K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119.","mla":"Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:10.1287/moor.2020.1116.","chicago":"Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.","ista":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119."},"keyword":["Management Science and Operations Research","General Mathematics","Computer Science Applications"],"project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"publisher":"Institute for Operations Research and the Management Sciences","date_published":"2022-02-01T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"page":"100-119","volume":47,"quality_controlled":"1","publication_status":"published","external_id":{"isi":["000731918100001"],"arxiv":["1904.13360"]},"abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the decision maker has approximately optimal strategies with finite memory. This implies notably that approximating the long-run value is recursively enumerable, as well as a weak continuity property of the value with respect to the transition function. ","lang":"eng"}]},{"project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"page":"2621–2635","department":[{"_id":"HeEd"}],"volume":13,"quality_controlled":"1","publisher":"Springer Nature","date_published":"2022-05-01T00:00:00Z","publication_status":"published","external_id":{"isi":["000712198000001"]},"abstract":[{"lang":"eng","text":"It is practical to collect a huge amount of movement data and environmental context information along with the health signals of individuals because there is the emergence of new generations of positioning and tracking technologies and rapid advancements of health sensors. The study of the relations between these datasets and their sequence similarity analysis is of interest to many applications such as health monitoring and recommender systems. However, entering all movement parameters and health signals can lead to the complexity of the problem and an increase in its computational load. In this situation, dimension reduction techniques can be used to avoid consideration of simultaneous dependent parameters in the process of similarity measurement of the trajectories. The present study provides a framework, named CaDRAW, to use spatial–temporal data and movement parameters along with independent context information in the process of measuring the similarity of trajectories. In this regard, the omission of dependent movement characteristic signals is conducted by using an unsupervised feature selection dimension reduction technique. To evaluate the effectiveness of the proposed framework, it was applied to a real contextualized movement and related health signal datasets of individuals. The results indicated the capability of the proposed framework in measuring the similarity and in decreasing the characteristic signals in such a way that the similarity results -before and after reduction of dependent characteristic signals- have small differences. The mean differences between the obtained results before and after reducing the dimension were 0.029 and 0.023 for the round path, respectively."}],"ddc":["000"],"file_date_updated":"2022-12-20T23:30:08Z","_id":"10208","article_type":"original","doi":"10.1007/s12652-021-03569-z","date_created":"2021-11-02T09:28:55Z","citation":{"ama":"Goudarzi S, Sharif M, Karimipour F. A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. 2022;13:2621–2635. doi:10.1007/s12652-021-03569-z","ieee":"S. Goudarzi, M. Sharif, and F. Karimipour, “A context-aware dimension reduction framework for trajectory and health signal analyses,” Journal of Ambient Intelligence and Humanized Computing, vol. 13. Springer Nature, pp. 2621–2635, 2022.","short":"S. Goudarzi, M. Sharif, F. Karimipour, Journal of Ambient Intelligence and Humanized Computing 13 (2022) 2621–2635.","mla":"Goudarzi, Samira, et al. “A Context-Aware Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and Humanized Computing, vol. 13, Springer Nature, 2022, pp. 2621–2635, doi:10.1007/s12652-021-03569-z.","chicago":"Goudarzi, Samira, Mohammad Sharif, and Farid Karimipour. “A Context-Aware Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and Humanized Computing. Springer Nature, 2022. https://doi.org/10.1007/s12652-021-03569-z.","ista":"Goudarzi S, Sharif M, Karimipour F. 2022. A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. 13, 2621–2635.","apa":"Goudarzi, S., Sharif, M., & Karimipour, F. (2022). A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. Springer Nature. https://doi.org/10.1007/s12652-021-03569-z"},"keyword":["general computer science"],"acknowledgement":"The third author acknowledges the funding received from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","year":"2022","type":"journal_article","status":"public","author":[{"last_name":"Goudarzi","full_name":"Goudarzi, Samira","first_name":"Samira"},{"last_name":"Sharif","first_name":"Mohammad","full_name":"Sharif, Mohammad"},{"id":"2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425","last_name":"Karimipour","orcid":"0000-0001-6746-4174","first_name":"Farid","full_name":"Karimipour, Farid"}],"day":"01","oa_version":"Submitted Version","file":[{"creator":"fkarimip","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":1634958,"embargo":"2022-11-12","checksum":"0a8961416a9bb2be5a1cebda65468bcf","file_name":"A Context‑aware Dimension Reduction Framework - Journal of Ambient Intelligence 2021 (Preprint version).pdf","file_id":"10279","date_created":"2021-11-12T19:38:05Z","date_updated":"2022-12-20T23:30:08Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"05","publication_identifier":{"issn":["1868-5137"],"eissn":["1868-5145"]},"language":[{"iso":"eng"}],"publication":"Journal of Ambient Intelligence and Humanized Computing","title":"A context-aware dimension reduction framework for trajectory and health signal analyses","oa":1,"date_updated":"2023-08-02T13:31:48Z","article_processing_charge":"No","scopus_import":"1","has_accepted_license":"1","intvolume":" 13","isi":1},{"file_date_updated":"2022-01-19T09:27:43Z","_id":"10643","article_type":"original","doi":"10.1017/fms.2021.80","citation":{"chicago":"Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Gap in the Bulk.” Forum of Mathematics, Sigma. Cambridge University Press, 2022. https://doi.org/10.1017/fms.2021.80.","mla":"Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Gap in the Bulk.” Forum of Mathematics, Sigma, vol. 10, e4, Cambridge University Press, 2022, doi:10.1017/fms.2021.80.","ista":"Henheik SJ, Teufel S. 2022. Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. 10, e4.","ieee":"S. J. Henheik and S. Teufel, “Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk,” Forum of Mathematics, Sigma, vol. 10. Cambridge University Press, 2022.","ama":"Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2021.80","short":"S.J. Henheik, S. Teufel, Forum of Mathematics, Sigma 10 (2022).","apa":"Henheik, S. J., & Teufel, S. (2022). Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2021.80"},"date_created":"2022-01-18T16:18:51Z","keyword":["computational mathematics","discrete mathematics and combinatorics","geometry and topology","mathematical physics","statistics and probability","algebra and number theory","theoretical computer science","analysis"],"acknowledgement":"J.H. acknowledges partial financial support by the ERC Advanced Grant ‘RMTBeyond’ No. 101020331. Support for publication costs from the Deutsche Forschungsgemeinschaft and the Open Access Publishing Fund of the University of Tübingen is gratefully acknowledged.","year":"2022","ec_funded":1,"article_number":"e4","project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"department":[{"_id":"GradSch"},{"_id":"LaEr"}],"volume":10,"quality_controlled":"1","publisher":"Cambridge University Press","date_published":"2022-01-18T00:00:00Z","publication_status":"published","external_id":{"isi":["000743615000001"],"arxiv":["2012.15239"]},"abstract":[{"text":"We prove a generalised super-adiabatic theorem for extended fermionic systems assuming a spectral gap only in the bulk. More precisely, we assume that the infinite system has a unique ground state and that the corresponding Gelfand–Naimark–Segal Hamiltonian has a spectral gap above its eigenvalue zero. Moreover, we show that a similar adiabatic theorem also holds in the bulk of finite systems up to errors that vanish faster than any inverse power of the system size, although the corresponding finite-volume Hamiltonians need not have a spectral gap.\r\n\r\n","lang":"eng"}],"ddc":["510"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"publication":"Forum of Mathematics, Sigma","title":"Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk","oa":1,"date_updated":"2023-08-02T13:53:11Z","article_processing_charge":"Yes","intvolume":" 10","has_accepted_license":"1","isi":1,"type":"journal_article","status":"public","author":[{"first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha","last_name":"Henheik","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","orcid":"0000-0003-1106-327X"},{"full_name":"Teufel, Stefan","first_name":"Stefan","last_name":"Teufel"}],"arxiv":1,"oa_version":"Published Version","day":"18","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_size":705323,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"cchlebak","date_updated":"2022-01-19T09:27:43Z","date_created":"2022-01-19T09:27:43Z","file_name":"2022_ForumMathSigma_Henheik.pdf","file_id":"10646","checksum":"87592a755adcef22ea590a99dc728dd3","success":1}],"month":"01","publication_identifier":{"eissn":["2050-5094"]}},{"author":[{"first_name":"Aleksei","full_name":"Kalinov, Aleksei","orcid":"0000-0003-2189-3904","last_name":"Kalinov","id":"44b7120e-eb97-11eb-a6c2-e1557aa81d02"},{"first_name":"A.I.","full_name":"Osinskiy, A.I.","last_name":"Osinskiy"},{"last_name":"Matveev","full_name":"Matveev, S.A.","first_name":"S.A."},{"last_name":"Otieno","first_name":"W.","full_name":"Otieno, W."},{"last_name":"Brilliantov","full_name":"Brilliantov, N.V.","first_name":"N.V."}],"arxiv":1,"month":"10","publication_identifier":{"issn":["0021-9991"]},"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2103.09481"}],"day":"15","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","status":"public","oa":1,"date_updated":"2023-08-03T11:55:06Z","article_processing_charge":"No","title":"Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics","isi":1,"intvolume":" 467","language":[{"iso":"eng"}],"publication":"Journal of Computational Physics","publication_status":"published","ddc":["518"],"external_id":{"isi":["000917225500013"],"arxiv":["2103.09481"]},"abstract":[{"lang":"eng","text":"We revisit two basic Direct Simulation Monte Carlo Methods to model aggregation kinetics and extend them for aggregation processes with collisional fragmentation (shattering). We test the performance and accuracy of the extended methods and compare their performance with efficient deterministic finite-difference method applied to the same model. We validate the stochastic methods on the test problems and apply them to verify the existence of oscillating regimes in the aggregation-fragmentation kinetics recently detected in deterministic simulations. We confirm the emergence of steady oscillations of densities in such systems and prove the stability of the\r\noscillations with respect to fluctuations and noise."}],"publisher":"Elsevier","date_published":"2022-10-15T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"quality_controlled":"1","volume":467,"acknowledgement":"Zhores supercomputer of Skolkovo Institute of Science and Technology [68] has been used in the present research. S.A.M. was supported by Moscow Center for Fundamental and Applied Mathematics (the agreement with the Ministry of Education and Science of the Russian Federation No. 075-15-2019-1624). A.I.O. acknowledges RFBR project No. 20-31-90022. N.V.B. acknowledges the support of the Analytical Center (subsidy agreement 000000D730321P5Q0002, Grant No. 70-2021-00145 02.11.2021).","year":"2022","citation":{"apa":"Kalinov, A., Osinskiy, A. I., Matveev, S. A., Otieno, W., & Brilliantov, N. V. (2022). Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics. Journal of Computational Physics. Elsevier. https://doi.org/10.1016/j.jcp.2022.111439","ista":"Kalinov A, Osinskiy AI, Matveev SA, Otieno W, Brilliantov NV. 2022. Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics. Journal of Computational Physics. 467, 111439.","mla":"Kalinov, Aleksei, et al. “Direct Simulation Monte Carlo for New Regimes in Aggregation-Fragmentation Kinetics.” Journal of Computational Physics, vol. 467, 111439, Elsevier, 2022, doi:10.1016/j.jcp.2022.111439.","chicago":"Kalinov, Aleksei, A.I. Osinskiy, S.A. Matveev, W. Otieno, and N.V. Brilliantov. “Direct Simulation Monte Carlo for New Regimes in Aggregation-Fragmentation Kinetics.” Journal of Computational Physics. Elsevier, 2022. https://doi.org/10.1016/j.jcp.2022.111439.","short":"A. Kalinov, A.I. Osinskiy, S.A. Matveev, W. Otieno, N.V. Brilliantov, Journal of Computational Physics 467 (2022).","ama":"Kalinov A, Osinskiy AI, Matveev SA, Otieno W, Brilliantov NV. Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics. Journal of Computational Physics. 2022;467. doi:10.1016/j.jcp.2022.111439","ieee":"A. Kalinov, A. I. Osinskiy, S. A. Matveev, W. Otieno, and N. V. Brilliantov, “Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics,” Journal of Computational Physics, vol. 467. Elsevier, 2022."},"date_created":"2022-07-11T12:19:59Z","keyword":["Computer Science Applications","Physics and Astronomy (miscellaneous)","Applied Mathematics","Computational Mathematics","Modeling and Simulation","Numerical Analysis"],"article_number":"111439","article_type":"original","_id":"11556","doi":"10.1016/j.jcp.2022.111439"},{"status":"public","type":"journal_article","author":[{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","first_name":"Uli"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"month":"11","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"oa_version":"Published Version","day":"14","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"date_updated":"2023-01-23T11:10:03Z","date_created":"2023-01-23T11:10:03Z","file_name":"2022_DiscreteCompGeometry_Wagner.pdf","checksum":"307e879d09e52eddf5b225d0aaa9213a","file_id":"12345","success":1,"access_level":"open_access","file_size":1747581,"content_type":"application/pdf","relation":"main_file","creator":"dernst"}],"language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","oa":1,"date_updated":"2023-08-04T08:51:08Z","issue":"4","article_processing_charge":"No","title":"Connectivity of triangulation flip graphs in the plane","isi":1,"has_accepted_license":"1","scopus_import":"1","intvolume":" 68","publisher":"Springer Nature","date_published":"2022-11-14T00:00:00Z","department":[{"_id":"UlWa"}],"page":"1227-1284","volume":68,"quality_controlled":"1","publication_status":"published","ddc":["510"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"isi":["000883222200003"]},"abstract":[{"text":"Given a finite point set P in general position in the plane, a full triangulation of P is a maximal straight-line embedded plane graph on P. A partial triangulation of P is a full triangulation of some subset P′ of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge (called edge flip), removes a non-extreme point of degree 3, or adds a point in P∖P′ as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The edge flip graph is defined with full triangulations as vertices, and edge flips determining the adjacencies. Lawson showed in the early seventies that these graphs are connected. The goal of this paper is to investigate the structure of these graphs, with emphasis on their vertex connectivity. For sets P of n points in the plane in general position, we show that the edge flip graph is ⌈n/2−2⌉-vertex connected, and the bistellar flip graph is (n−3)-vertex connected; both results are tight. The latter bound matches the situation for the subfamily of regular triangulations (i.e., partial triangulations obtained by lifting the points to 3-space and projecting back the lower convex hull), where (n−3)-vertex connectivity has been known since the late eighties through the secondary polytope due to Gelfand, Kapranov, & Zelevinsky and Balinski’s Theorem. For the edge flip-graph, we additionally show that the vertex connectivity is at least as large as (and hence equal to) the minimum degree (i.e., the minimum number of flippable edges in any full triangulation), provided that n is large enough. Our methods also yield several other results: (i) The edge flip graph can be covered by graphs of polytopes of dimension ⌈n/2−2⌉ (products of associahedra) and the bistellar flip graph can be covered by graphs of polytopes of dimension n−3 (products of secondary polytopes). (ii) A partial triangulation is regular, if it has distance n−3 in the Hasse diagram of the partial order of partial subdivisions from the trivial subdivision. (iii) All partial triangulations of a point set are regular iff the partial order of partial subdivisions has height n−3. (iv) There are arbitrarily large sets P with non-regular partial triangulations and such that every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular triangulations.","lang":"eng"}],"file_date_updated":"2023-01-23T11:10:03Z","_id":"12129","article_type":"original","doi":"10.1007/s00454-022-00436-2","acknowledgement":"This is a full and revised version of [38] (on partial triangulations) in Proceedings of the 36th Annual International Symposium on Computational Geometry (SoCG‘20) and of some of the results in [37] (on full triangulations) in Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA‘20).\r\nThis research started at the 11th Gremo’s Workshop on Open Problems (GWOP), Alp Sellamatt, Switzerland, June 24–28, 2013, motivated by a question posed by Filip Mori´c on full triangulations. Research was supported by the Swiss National Science Foundation within the collaborative DACH project Arrangements and Drawings as SNSF Project 200021E-171681, and by IST Austria and Berlin Free University during a sabbatical stay of the second author. We thank Michael Joswig, Jesús De Loera, and Francisco Santos for helpful discussions on the topics of this paper, and Daniel Bertschinger and Valentin Stoppiello for carefully reading earlier versions and for many helpful comments.\r\nOpen access funding provided by the Swiss Federal Institute of Technology Zürich","year":"2022","date_created":"2023-01-12T12:02:28Z","citation":{"chicago":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.” Discrete & Computational Geometry. Springer Nature, 2022. https://doi.org/10.1007/s00454-022-00436-2.","mla":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.” Discrete & Computational Geometry, vol. 68, no. 4, Springer Nature, 2022, pp. 1227–84, doi:10.1007/s00454-022-00436-2.","ista":"Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. 68(4), 1227–1284.","ama":"Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. 2022;68(4):1227-1284. doi:10.1007/s00454-022-00436-2","ieee":"U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane,” Discrete & Computational Geometry, vol. 68, no. 4. Springer Nature, pp. 1227–1284, 2022.","short":"U. Wagner, E. Welzl, Discrete & Computational Geometry 68 (2022) 1227–1284.","apa":"Wagner, U., & Welzl, E. (2022). Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00436-2"},"keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"7807"},{"relation":"earlier_version","id":"7990","status":"public"}]}},{"_id":"12134","article_type":"original","file_date_updated":"2023-01-24T07:24:37Z","doi":"10.1088/2632-072x/ac99cd","keyword":["Artificial Intelligence","Computer Networks and Communications","Computer Science Applications","Information Systems"],"citation":{"apa":"Börner, G., Schröder, M., Scarselli, D., Budanur, N. B., Hof, B., & Timme, M. (2022). Explosive transitions in epidemic dynamics. Journal of Physics: Complexity. IOP Publishing. https://doi.org/10.1088/2632-072x/ac99cd","mla":"Börner, Georg, et al. “Explosive Transitions in Epidemic Dynamics.” Journal of Physics: Complexity, vol. 3, no. 4, 04LT02, IOP Publishing, 2022, doi:10.1088/2632-072x/ac99cd.","chicago":"Börner, Georg, Malte Schröder, Davide Scarselli, Nazmi B Budanur, Björn Hof, and Marc Timme. “Explosive Transitions in Epidemic Dynamics.” Journal of Physics: Complexity. IOP Publishing, 2022. https://doi.org/10.1088/2632-072x/ac99cd.","ista":"Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. 2022. Explosive transitions in epidemic dynamics. Journal of Physics: Complexity. 3(4), 04LT02.","ieee":"G. Börner, M. Schröder, D. Scarselli, N. B. Budanur, B. Hof, and M. Timme, “Explosive transitions in epidemic dynamics,” Journal of Physics: Complexity, vol. 3, no. 4. IOP Publishing, 2022.","ama":"Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. Explosive transitions in epidemic dynamics. Journal of Physics: Complexity. 2022;3(4). doi:10.1088/2632-072x/ac99cd","short":"G. Börner, M. Schröder, D. Scarselli, N.B. Budanur, B. Hof, M. Timme, Journal of Physics: Complexity 3 (2022)."},"date_created":"2023-01-12T12:03:43Z","year":"2022","acknowledgement":"We acknowledge support from the Volkswagen Foundation under Grant No. 99720 and the German Federal Ministry for Education and Research (BMBF) under Grant No. 16ICR01. This research was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2068—390729961—Cluster of Excellence Physics of Life of TU Dresden.","article_number":"04LT02","volume":3,"quality_controlled":"1","department":[{"_id":"BjHo"}],"date_published":"2022-10-25T00:00:00Z","publisher":"IOP Publishing","publication_status":"published","abstract":[{"lang":"eng","text":"Standard epidemic models exhibit one continuous, second order phase transition to macroscopic outbreaks. However, interventions to control outbreaks may fundamentally alter epidemic dynamics. Here we reveal how such interventions modify the type of phase transition. In particular, we uncover three distinct types of explosive phase transitions for epidemic dynamics with capacity-limited interventions. Depending on the capacity limit, interventions may (i) leave the standard second order phase transition unchanged but exponentially suppress the probability of large outbreaks, (ii) induce a first-order discontinuous transition to macroscopic outbreaks, or (iii) cause a secondary explosive yet continuous third-order transition. These insights highlight inherent limitations in predicting and containing epidemic outbreaks. More generally our study offers a cornerstone example of a third-order explosive phase transition in complex systems."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["530"],"language":[{"iso":"eng"}],"publication":"Journal of Physics: Complexity","title":"Explosive transitions in epidemic dynamics","article_processing_charge":"No","issue":"4","date_updated":"2023-02-13T09:15:13Z","oa":1,"intvolume":" 3","has_accepted_license":"1","scopus_import":"1","type":"journal_article","status":"public","author":[{"first_name":"Georg","full_name":"Börner, Georg","last_name":"Börner"},{"last_name":"Schröder","full_name":"Schröder, Malte","first_name":"Malte"},{"full_name":"Scarselli, Davide","first_name":"Davide","orcid":"0000-0001-5227-4271","last_name":"Scarselli","id":"40315C30-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nazmi B","full_name":"Budanur, Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","last_name":"Budanur","orcid":"0000-0003-0423-5010"},{"last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","first_name":"Björn"},{"last_name":"Timme","full_name":"Timme, Marc","first_name":"Marc"}],"file":[{"date_created":"2023-01-24T07:24:37Z","date_updated":"2023-01-24T07:24:37Z","success":1,"file_id":"12350","file_name":"2022_JourPhysics_Boerner.pdf","checksum":"35c5c5cb0eb17ea1b5184755daab9fc9","content_type":"application/pdf","file_size":1006106,"access_level":"open_access","relation":"main_file","creator":"dernst"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"25","oa_version":"Published Version","month":"10","publication_identifier":{"issn":["2632-072X"]}},{"language":[{"iso":"eng"}],"publication":"Forum of Mathematics, Sigma","title":"Rank-uniform local law for Wigner matrices","article_processing_charge":"No","date_updated":"2023-08-04T09:00:35Z","oa":1,"intvolume":" 10","has_accepted_license":"1","scopus_import":"1","isi":1,"status":"public","type":"journal_article","author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","first_name":"Giorgio"},{"orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László"},{"orcid":"0000-0002-2904-1856","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","full_name":"Schröder, Dominik J"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":817089,"creator":"dernst","date_updated":"2023-01-24T10:02:40Z","date_created":"2023-01-24T10:02:40Z","file_id":"12356","file_name":"2022_ForumMath_Cipolloni.pdf","checksum":"94a049aeb1eea5497aa097712a73c400","success":1}],"oa_version":"Published Version","day":"27","month":"10","publication_identifier":{"issn":["2050-5094"]},"_id":"12148","article_type":"original","file_date_updated":"2023-01-24T10:02:40Z","doi":"10.1017/fms.2022.86","keyword":["Computational Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Theoretical Computer Science","Analysis"],"date_created":"2023-01-12T12:07:30Z","citation":{"apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2022). Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2022.86","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Forum of Mathematics, Sigma 10 (2022).","ama":"Cipolloni G, Erdös L, Schröder DJ. Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2022.86","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Rank-uniform local law for Wigner matrices,” Forum of Mathematics, Sigma, vol. 10. Cambridge University Press, 2022.","mla":"Cipolloni, Giorgio, et al. “Rank-Uniform Local Law for Wigner Matrices.” Forum of Mathematics, Sigma, vol. 10, e96, Cambridge University Press, 2022, doi:10.1017/fms.2022.86.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Rank-Uniform Local Law for Wigner Matrices.” Forum of Mathematics, Sigma. Cambridge University Press, 2022. https://doi.org/10.1017/fms.2022.86.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2022. Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. 10, e96."},"year":"2022","acknowledgement":"L.E. acknowledges support by ERC Advanced Grant ‘RMTBeyond’ No. 101020331. D.S. acknowledges the support of Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation.","article_number":"e96","ec_funded":1,"project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"quality_controlled":"1","volume":10,"department":[{"_id":"LaEr"}],"date_published":"2022-10-27T00:00:00Z","publisher":"Cambridge University Press","publication_status":"published","abstract":[{"text":"We prove a general local law for Wigner matrices that optimally handles observables of arbitrary rank and thus unifies the well-known averaged and isotropic local laws. As an application, we prove a central limit theorem in quantum unique ergodicity (QUE): that is, we show that the quadratic forms of a general deterministic matrix A on the bulk eigenvectors of a Wigner matrix have approximately Gaussian fluctuation. For the bulk spectrum, we thus generalise our previous result [17] as valid for test matrices A of large rank as well as the result of Benigni and Lopatto [7] as valid for specific small-rank observables.","lang":"eng"}],"external_id":{"isi":["000873719200001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["510"]},{"language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","oa":1,"date_updated":"2023-09-05T15:02:40Z","issue":"1","article_processing_charge":"Yes (via OA deal)","title":"Triangulating submanifolds: An elementary and quantified version of Whitney’s method","isi":1,"intvolume":" 66","has_accepted_license":"1","status":"public","type":"journal_article","author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"last_name":"Kachanovich","first_name":"Siargey","full_name":"Kachanovich, Siargey"},{"first_name":"Mathijs","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220"}],"month":"07","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"day":"01","oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"checksum":"c848986091e56699dc12de85adb1e39c","file_id":"9795","file_name":"2021_DescreteCompGeopmetry_Boissonnat.pdf","success":1,"date_updated":"2021-08-06T09:52:29Z","date_created":"2021-08-06T09:52:29Z","creator":"kschuh","file_size":983307,"access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"file_date_updated":"2021-08-06T09:52:29Z","_id":"8940","article_type":"original","doi":"10.1007/s00454-020-00250-8","acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement Number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). The third author also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. Open access funding provided by the Institute of Science and Technology (IST Austria).","year":"2021","date_created":"2020-12-12T11:07:02Z","citation":{"ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Triangulating submanifolds: An elementary and quantified version of Whitney’s method,” Discrete & Computational Geometry, vol. 66, no. 1. Springer Nature, pp. 386–434, 2021.","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. 2021;66(1):386-434. doi:10.1007/s00454-020-00250-8","short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete & Computational Geometry 66 (2021) 386–434.","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” Discrete & Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00250-8.","mla":"Boissonnat, Jean-Daniel, et al. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” Discrete & Computational Geometry, vol. 66, no. 1, Springer Nature, 2021, pp. 386–434, doi:10.1007/s00454-020-00250-8.","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. 66(1), 386–434.","apa":"Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00250-8"},"keyword":["Theoretical Computer Science","Computational Theory and Mathematics","Geometry and Topology","Discrete Mathematics and Combinatorics"],"ec_funded":1,"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"publisher":"Springer Nature","date_published":"2021-07-01T00:00:00Z","page":"386-434","department":[{"_id":"HeEd"}],"quality_controlled":"1","volume":66,"publication_status":"published","ddc":["516"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"isi":["000597770300001"]},"abstract":[{"text":"We quantise Whitney’s construction to prove the existence of a triangulation for any C^2 manifold, so that we get an algorithm with explicit bounds. We also give a new elementary proof, which is completely geometric.","lang":"eng"}]},{"article_processing_charge":"No","date_updated":"2025-07-14T09:10:07Z","oa":1,"title":"Symbolic time and space tradeoffs for probabilistic verification","isi":1,"scopus_import":"1","language":[{"iso":"eng"}],"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","arxiv":1,"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Dvorak","full_name":"Dvorak, Wolfgang","first_name":"Wolfgang"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"publication_identifier":{"eisbn":["978-1-6654-4895-6"],"isbn":["978-1-6654-4896-3"],"issn":["1043-6871"]},"month":"07","conference":{"start_date":"2021-06-29","name":"LICS: Symposium on Logic in Computer Science","end_date":"2021-07-02","location":"Rome, Italy"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07466"}],"oa_version":"Preprint","day":"07","status":"public","type":"conference","year":"2021","acknowledgement":"The authors are grateful to the anonymous referees for their valuable comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For M. H. the research leading to these results has received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007–2013) / ERC Grant Agreement no. 340506.","keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"citation":{"apa":"Chatterjee, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470739","short":"K. Chatterjee, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ama":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470739","ieee":"K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739.","mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.","ista":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13."},"date_created":"2021-09-12T22:01:24Z","ec_funded":1,"_id":"10002","doi":"10.1109/LICS52264.2021.9470739","publication_status":"published","abstract":[{"lang":"eng","text":"We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with n vertices and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires O(n2) symbolic operations and O(1) symbolic space. The only other symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of ω -regular objectives for MDPs. We consider the canonical parity objectives for ω -regular objectives, and for parity objectives with d -priorities we present an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 ."}],"external_id":{"arxiv":["2104.07466"],"isi":["000947350400089"]},"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"date_published":"2021-07-07T00:00:00Z","publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","department":[{"_id":"KrCh"}],"page":"1-13"},{"arxiv":1,"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07278"}],"day":"07","month":"07","publication_identifier":{"isbn":["978-1-6654-4896-3"],"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"]},"conference":{"name":"LICS: Symposium on Logic in Computer Science","start_date":"2021-06-29","location":"Rome, Italy","end_date":"2021-07-02"},"type":"conference","status":"public","title":"Stochastic processes with expected stopping time","article_processing_charge":"No","oa":1,"date_updated":"2025-07-14T09:10:08Z","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","publication_status":"published","abstract":[{"lang":"eng","text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs."}],"external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"quality_controlled":"1","page":"1-13","department":[{"_id":"KrCh"}],"date_published":"2021-07-07T00:00:00Z","publisher":"Institute of Electrical and Electronics Engineers","keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"date_created":"2021-09-12T22:01:25Z","citation":{"apa":"Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470595","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.","ista":"Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13."},"year":"2021","acknowledgement":"We are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. This research was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","ec_funded":1,"_id":"10004","doi":"10.1109/LICS52264.2021.9470595"}]