[{"file_date_updated":"2023-02-13T10:38:10Z","ec_funded":1,"article_number":"013029","date_created":"2023-02-10T09:02:26Z","date_updated":"2023-02-20T07:02:00Z","volume":5,"author":[{"orcid":"0000-0001-9666-3543","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","first_name":"Areg","full_name":"Ghazaryan, Areg"},{"first_name":"Alberto","last_name":"Cappellaro","id":"9d13b3cb-30a2-11eb-80dc-f772505e8660","orcid":"0000-0001-6110-2359","full_name":"Cappellaro, Alberto"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"orcid":"0000-0003-0393-5525","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev","first_name":"Artem","full_name":"Volosniev, Artem"}],"publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","acknowledgement":"We thank Rafael Barfknecht for help at the initial stages of this project; Fabian Brauneis for useful discussions; Miguel A. Garcia-March, Georgios Koutentakis, and Simeon Mistakidis\r\nfor comments on the paper. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","year":"2023","month":"01","publication_identifier":{"issn":["2643-1564"]},"language":[{"iso":"eng"}],"doi":"10.1103/physrevresearch.5.013029","quality_controlled":"1","project":[{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"abstract":[{"text":"Brownian motion of a mobile impurity in a bath is affected by spin-orbit coupling (SOC). Here, we discuss a Caldeira-Leggett-type model that can be used to propose and interpret quantum simulators of this problem in cold Bose gases. First, we derive a master equation that describes the model and explore it in a one-dimensional (1D) setting. To validate the standard assumptions needed for our derivation, we analyze available experimental data without SOC; as a byproduct, this analysis suggests that the quench dynamics of the impurity is beyond the 1D Bose-polaron approach at temperatures currently accessible in a cold-atom laboratory—motion of the impurity is mainly driven by dissipation. For systems with SOC, we demonstrate that 1D spin-orbit coupling can be gauged out even in the presence of dissipation—the information about SOC is incorporated in the initial conditions. Observables sensitive to this information (such as spin densities) can be used to study formation of steady spin polarization domains during quench dynamics.","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"Published Version","file":[{"file_id":"12546","relation":"main_file","date_created":"2023-02-13T10:38:10Z","date_updated":"2023-02-13T10:38:10Z","success":1,"checksum":"6068b62874c0099628a108bb9c5c6bd2","file_name":"2023_PhysicalReviewResearch_Ghazaryan.pdf","access_level":"open_access","creator":"dernst","file_size":865150,"content_type":"application/pdf"}],"title":"Dissipative dynamics of an impurity with spin-orbit coupling","status":"public","ddc":["530"],"intvolume":" 5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12534","day":"20","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2023-01-20T00:00:00Z","article_type":"original","publication":"Physical Review Research","citation":{"ieee":"A. Ghazaryan, A. Cappellaro, M. Lemeshko, and A. Volosniev, “Dissipative dynamics of an impurity with spin-orbit coupling,” Physical Review Research, vol. 5, no. 1. American Physical Society, 2023.","apa":"Ghazaryan, A., Cappellaro, A., Lemeshko, M., & Volosniev, A. (2023). Dissipative dynamics of an impurity with spin-orbit coupling. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.5.013029","ista":"Ghazaryan A, Cappellaro A, Lemeshko M, Volosniev A. 2023. Dissipative dynamics of an impurity with spin-orbit coupling. Physical Review Research. 5(1), 013029.","ama":"Ghazaryan A, Cappellaro A, Lemeshko M, Volosniev A. Dissipative dynamics of an impurity with spin-orbit coupling. Physical Review Research. 2023;5(1). doi:10.1103/physrevresearch.5.013029","chicago":"Ghazaryan, Areg, Alberto Cappellaro, Mikhail Lemeshko, and Artem Volosniev. “Dissipative Dynamics of an Impurity with Spin-Orbit Coupling.” Physical Review Research. American Physical Society, 2023. https://doi.org/10.1103/physrevresearch.5.013029.","short":"A. Ghazaryan, A. Cappellaro, M. Lemeshko, A. Volosniev, Physical Review Research 5 (2023).","mla":"Ghazaryan, Areg, et al. “Dissipative Dynamics of an Impurity with Spin-Orbit Coupling.” Physical Review Research, vol. 5, no. 1, 013029, American Physical Society, 2023, doi:10.1103/physrevresearch.5.013029."}},{"month":"02","publication_identifier":{"issn":["1061-4036"],"eissn":["1546-1718"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.1038/s41588-022-01260-3","language":[{"iso":"eng"}],"file_date_updated":"2023-02-27T07:46:45Z","year":"2023","acknowledgement":"We thank A. Giladi for sharing mRNA abundance tables of cell types together with J. van den Berg for critical reading of the manuscript. We thank M. Bartosovic for sharing method comparison data. pK19pA-MN was a gift from Ulrich Laemmli (Addgene plasmid 86973, http://n2t.net/addgene:86973; RRID:Addgene_86973). Figure 8 is adopted from Hematopoiesis (human) diagram by A. Rad and M. Häggström under CC-BY-SA 3.0 license. This work was supported by European Research Council Advanced under grant ERC-AdG 742225-IntScOmics and Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO) TOP award NWO-CW 714.016.001. The SNF (P2BSP3-174991), HFSP (LT000209/2018-L) and Marie Skłodowska-Curie Actions (798573) supported P.Z. The SNF (P2ELP3_184488) and HFSP (LT000097/2019-L) supported J.Y. and the EMBO LTF (ALTF 1197–2019) supported V.B. This work is part of the Oncode Institute, which is partly financed by the Dutch Cancer Society. The funders had no role in study design, data collection and analysis, decision to publish or preparation of the manuscript.","publication_status":"published","department":[{"_id":"ScienComp"}],"publisher":"Springer Nature","author":[{"full_name":"Zeller, Peter","last_name":"Zeller","first_name":"Peter"},{"id":"123012b2-db30-11eb-b4d8-a35840c0551b","orcid":"0000-0003-1732-1559","first_name":"Jake","last_name":"Yeung","full_name":"Yeung, Jake"},{"first_name":"Helena","last_name":"Viñas Gaza","full_name":"Viñas Gaza, Helena"},{"first_name":"Buys Anton","last_name":"de Barbanson","full_name":"de Barbanson, Buys Anton"},{"last_name":"Bhardwaj","first_name":"Vivek","full_name":"Bhardwaj, Vivek"},{"last_name":"Florescu","first_name":"Maria","full_name":"Florescu, Maria"},{"last_name":"van der Linden","first_name":"Reinier","full_name":"van der Linden, Reinier"},{"full_name":"van Oudenaarden, Alexander","first_name":"Alexander","last_name":"van Oudenaarden"}],"date_updated":"2023-02-27T07:48:24Z","date_created":"2023-01-12T12:09:09Z","volume":55,"scopus_import":"1","keyword":["Genetics"],"day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"Nature Genetics","citation":{"short":"P. Zeller, J. Yeung, H. Viñas Gaza, B.A. de Barbanson, V. Bhardwaj, M. Florescu, R. van der Linden, A. van Oudenaarden, Nature Genetics 55 (2023) 333–345.","mla":"Zeller, Peter, et al. “Single-Cell SortChIC Identifies Hierarchical Chromatin Dynamics during Hematopoiesis.” Nature Genetics, vol. 55, Springer Nature, 2023, pp. 333–45, doi:10.1038/s41588-022-01260-3.","chicago":"Zeller, Peter, Jake Yeung, Helena Viñas Gaza, Buys Anton de Barbanson, Vivek Bhardwaj, Maria Florescu, Reinier van der Linden, and Alexander van Oudenaarden. “Single-Cell SortChIC Identifies Hierarchical Chromatin Dynamics during Hematopoiesis.” Nature Genetics. Springer Nature, 2023. https://doi.org/10.1038/s41588-022-01260-3.","ama":"Zeller P, Yeung J, Viñas Gaza H, et al. Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis. Nature Genetics. 2023;55:333-345. doi:10.1038/s41588-022-01260-3","apa":"Zeller, P., Yeung, J., Viñas Gaza, H., de Barbanson, B. A., Bhardwaj, V., Florescu, M., … van Oudenaarden, A. (2023). Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis. Nature Genetics. Springer Nature. https://doi.org/10.1038/s41588-022-01260-3","ieee":"P. Zeller et al., “Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis,” Nature Genetics, vol. 55. Springer Nature, pp. 333–345, 2023.","ista":"Zeller P, Yeung J, Viñas Gaza H, de Barbanson BA, Bhardwaj V, Florescu M, van der Linden R, van Oudenaarden A. 2023. Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis. Nature Genetics. 55, 333–345."},"article_type":"review","page":"333-345","date_published":"2023-02-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Post-translational histone modifications modulate chromatin activity to affect gene expression. How chromatin states underlie lineage choice in single cells is relatively unexplored. We develop sort-assisted single-cell chromatin immunocleavage (sortChIC) and map active (H3K4me1 and H3K4me3) and repressive (H3K27me3 and H3K9me3) histone modifications in the mouse bone marrow. During differentiation, hematopoietic stem and progenitor cells (HSPCs) acquire active chromatin states mediated by cell-type-specifying transcription factors, which are unique for each lineage. By contrast, most alterations in repressive marks during differentiation occur independent of the final cell type. Chromatin trajectory analysis shows that lineage choice at the chromatin level occurs at the progenitor stage. Joint profiling of H3K4me1 and H3K9me3 demonstrates that cell types within the myeloid lineage have distinct active chromatin but share similar myeloid-specific heterochromatin states. This implies a hierarchical regulation of chromatin during hematopoiesis: heterochromatin dynamics distinguish differentiation trajectories and lineages, while euchromatin dynamics reflect cell types within lineages."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12158","ddc":["570","000"],"status":"public","title":"Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis","intvolume":" 55","oa_version":"Published Version","file":[{"file_name":"2023_NatureGenetics_Zeller.pdf","access_level":"open_access","file_size":21484855,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"12688","date_updated":"2023-02-27T07:46:45Z","date_created":"2023-02-27T07:46:45Z","checksum":"6fdb8e34fbeea63edd0f2c6c2cc5823e","success":1}]},{"date_published":"2023-02-01T00:00:00Z","page":"4590-4605","publication":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms","citation":{"chicago":"Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 4590–4605. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch173.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–605, doi:10.1137/1.9781611977554.ch173.","short":"K. Chatterjee, T. Meggendorfer, R.J. Saona Urmeneta, J. Svoboda, in:, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–4605.","ista":"Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster algorithm for turn-based stochastic games with bounded treewidth. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 4590–4605.","ieee":"K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster algorithm for turn-based stochastic games with bounded treewidth,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, pp. 4590–4605.","apa":"Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., & Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch173","ama":"Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. Faster algorithm for turn-based stochastic games with bounded treewidth. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2023:4590-4605. doi:10.1137/1.9781611977554.ch173"},"day":"01","article_processing_charge":"No","oa_version":"Published Version","title":"Faster algorithm for turn-based stochastic games with bounded treewidth","status":"public","_id":"12676","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Turn-based stochastic games (aka simple stochastic games) are two-player zero-sum games played on directed graphs with probabilistic transitions. The goal of player-max is to maximize the probability to reach a target state against the adversarial player-min. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class for which the existence of polynomial-time algorithm is a major open question. While randomized sub-exponential time algorithm exists, all known deterministic algorithms require exponential time in the worst-case. An important open question has been whether faster algorithms can be obtained parametrized by the treewidth of the game graph. Even deterministic sub-exponential time algorithm for constant treewidth turn-based stochastic games has remain elusive. In this work our main result is a deterministic algorithm to solve turn-based stochastic games that, given a game with n states, treewidth at most t, and the bit-complexity of the probabilistic transition function log D, has running time O ((tn2 log D)t log n). In particular, our algorithm is quasi-polynomial time for games with constant or poly-logarithmic treewidth.","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2023-01-25","start_date":"2023-01-22","location":"Florence, Italy","name":"SODA: Symposium on Discrete Algorithms"},"doi":"10.1137/1.9781611977554.ch173","quality_controlled":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611977554.ch173"}],"oa":1,"month":"02","publication_identifier":{"isbn":["9781611977554"]},"date_updated":"2023-02-27T09:01:16Z","date_created":"2023-02-24T12:20:47Z","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"},{"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"},{"full_name":"Svoboda, Jakub","first_name":"Jakub","last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"}],"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Society for Industrial and Applied Mathematics","year":"2023","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","ec_funded":1},{"volume":2633,"date_updated":"2023-03-16T08:34:24Z","date_created":"2023-03-12T23:01:02Z","author":[{"full_name":"Arroyo-Urea, Sandra","first_name":"Sandra","last_name":"Arroyo-Urea"},{"full_name":"Watson, Jake","orcid":"0000-0002-8698-3823","id":"63836096-4690-11EA-BD4E-32803DDC885E","last_name":"Watson","first_name":"Jake"},{"first_name":"Javier","last_name":"García-Nafría","full_name":"García-Nafría, Javier"}],"editor":[{"first_name":"Garry","last_name":"Scarlett","full_name":"Scarlett, Garry"}],"publisher":"Springer Nature","department":[{"_id":"PeJo"}],"publication_status":"published","pmid":1,"year":"2023","place":"New York, NY, United States","language":[{"iso":"eng"}],"doi":"10.1007/978-1-0716-3004-4_3","quality_controlled":"1","external_id":{"pmid":["36853454"]},"publication_identifier":{"eisbn":["978-1-0716-3004-4"],"issn":["1064-3745"],"eissn":["1940-6029"],"isbn":["978-1-0716-3003-7"]},"month":"03","oa_version":"None","intvolume":" 2633","title":"Molecular Cloning Using In Vivo DNA Assembly","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12720","abstract":[{"lang":"eng","text":"Here we describe the in vivo DNA assembly approach, where molecular cloning procedures are performed using an E. coli recA-independent recombination pathway, which assembles linear fragments of DNA with short homologous termini. This pathway is present in all standard laboratory E. coli strains and, by bypassing the need for in vitro DNA assembly, allows simplified molecular cloning to be performed without the plasmid instability issues associated with specialized recombination-cloning bacterial strains. The methodology requires specific primer design and can perform all standard plasmid modifications (insertions, deletions, mutagenesis, and sub-cloning) in a rapid, simple, and cost-efficient manner, as it does not require commercial kits or specialized bacterial strains. Additionally, this approach can be used to perform complex procedures such as multiple modifications to a plasmid, as up to 6 linear fragments can be assembled in vivo by this recombination pathway. Procedures generally require less than 3 h, involving PCR amplification, DpnI digestion of template DNA, and transformation, upon which circular plasmids are assembled. In this chapter we describe the requirements, procedure, and potential pitfalls when using this technique, as well as protocol variations to overcome the most common issues."}],"alternative_title":["Methods in Molecular Biology"],"type":"book_chapter","date_published":"2023-03-01T00:00:00Z","page":"33-44","citation":{"chicago":"Arroyo-Urea, Sandra, Jake Watson, and Javier García-Nafría. “Molecular Cloning Using In Vivo DNA Assembly.” In DNA Manipulation and Analysis, edited by Garry Scarlett, 2633:33–44. MIMB. New York, NY, United States: Springer Nature, 2023. https://doi.org/10.1007/978-1-0716-3004-4_3.","short":"S. Arroyo-Urea, J. Watson, J. García-Nafría, in:, G. Scarlett (Ed.), DNA Manipulation and Analysis, Springer Nature, New York, NY, United States, 2023, pp. 33–44.","mla":"Arroyo-Urea, Sandra, et al. “Molecular Cloning Using In Vivo DNA Assembly.” DNA Manipulation and Analysis, edited by Garry Scarlett, vol. 2633, Springer Nature, 2023, pp. 33–44, doi:10.1007/978-1-0716-3004-4_3.","apa":"Arroyo-Urea, S., Watson, J., & García-Nafría, J. (2023). Molecular Cloning Using In Vivo DNA Assembly. In G. Scarlett (Ed.), DNA Manipulation and Analysis (Vol. 2633, pp. 33–44). New York, NY, United States: Springer Nature. https://doi.org/10.1007/978-1-0716-3004-4_3","ieee":"S. Arroyo-Urea, J. Watson, and J. García-Nafría, “Molecular Cloning Using In Vivo DNA Assembly,” in DNA Manipulation and Analysis, vol. 2633, G. Scarlett, Ed. New York, NY, United States: Springer Nature, 2023, pp. 33–44.","ista":"Arroyo-Urea S, Watson J, García-Nafría J. 2023.Molecular Cloning Using In Vivo DNA Assembly. In: DNA Manipulation and Analysis. Methods in Molecular Biology, vol. 2633, 33–44.","ama":"Arroyo-Urea S, Watson J, García-Nafría J. Molecular Cloning Using In Vivo DNA Assembly. In: Scarlett G, ed. DNA Manipulation and Analysis. Vol 2633. MIMB. New York, NY, United States: Springer Nature; 2023:33-44. doi:10.1007/978-1-0716-3004-4_3"},"publication":"DNA Manipulation and Analysis","article_processing_charge":"No","day":"01","series_title":"MIMB","scopus_import":"1"},{"abstract":[{"text":"Asynchronous programming has gained significant popularity over the last decade: support for this programming pattern is available in many popular languages via libraries and native language implementations, typically in the form of coroutines or the async/await construct. Instead of programming via shared memory, this concept assumes implicit synchronization through message passing. The key data structure enabling such communication is the rendezvous channel. Roughly, a rendezvous channel is a blocking queue of size zero, so both send(e) and receive() operations wait for each other, performing a rendezvous when they meet. To optimize the message passing pattern, channels are usually equipped with a fixed-size buffer, so sends do not suspend and put elements into the buffer until its capacity is exceeded. This primitive is known as a buffered channel.\r\n\r\nThis paper presents a fast and scalable algorithm for both rendezvous and buffered channels. Similarly to modern queues, our solution is based on an infinite array with two positional counters for send(e) and receive() operations, leveraging the unconditional Fetch-And-Add instruction to update them. Yet, the algorithm requires non-trivial modifications of this classic pattern, in order to support the full channel semantics, such as buffering and cancellation of waiting requests. We compare the performance of our solution to that of the Kotlin implementation, as well as against other academic proposals, showing up to 9.8× speedup. To showcase its expressiveness and performance, we also integrated the proposed algorithm into the standard Kotlin Coroutines library, replacing the previous channel implementations.","lang":"eng"}],"type":"conference","date_created":"2023-03-19T23:00:58Z","date_updated":"2023-03-20T07:29:28Z","oa_version":"Preprint","author":[{"last_name":"Koval","first_name":"Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","full_name":"Koval, Nikita"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Roman","last_name":"Elizarov","full_name":"Elizarov, Roman"}],"title":"Fast and scalable channels in Kotlin Coroutines","publication_status":"published","status":"public","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","_id":"12735","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","day":"25","article_processing_charge":"No","publication_identifier":{"isbn":["9798400700156"]},"scopus_import":"1","language":[{"iso":"eng"}],"conference":{"start_date":"2023-02-25","location":"Montreal, QC, Canada","end_date":"2023-03-01","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming"},"date_published":"2023-02-25T00:00:00Z","doi":"10.1145/3572848.3577481","quality_controlled":"1","page":"107-118","publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","citation":{"ista":"Koval N, Alistarh D-A, Elizarov R. 2023. Fast and scalable channels in Kotlin Coroutines. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 107–118.","ieee":"N. Koval, D.-A. Alistarh, and R. Elizarov, “Fast and scalable channels in Kotlin Coroutines,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Montreal, QC, Canada, 2023, pp. 107–118.","apa":"Koval, N., Alistarh, D.-A., & Elizarov, R. (2023). Fast and scalable channels in Kotlin Coroutines. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 107–118). Montreal, QC, Canada: Association for Computing Machinery. https://doi.org/10.1145/3572848.3577481","ama":"Koval N, Alistarh D-A, Elizarov R. Fast and scalable channels in Kotlin Coroutines. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2023:107-118. doi:10.1145/3572848.3577481","chicago":"Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Fast and Scalable Channels in Kotlin Coroutines.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 107–18. Association for Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577481.","mla":"Koval, Nikita, et al. “Fast and Scalable Channels in Kotlin Coroutines.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2023, pp. 107–18, doi:10.1145/3572848.3577481.","short":"N. Koval, D.-A. Alistarh, R. Elizarov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2023, pp. 107–118."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.04986"}],"oa":1,"external_id":{"arxiv":["2211.04986"]}},{"oa_version":"Published Version","date_created":"2023-03-19T23:00:58Z","date_updated":"2023-03-20T07:57:27Z","author":[{"full_name":"Aksenov, Vitaly","last_name":"Aksenov","first_name":"Vitaly"},{"last_name":"Brown","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","last_name":"Fedorov","first_name":"Alexander","full_name":"Fedorov, Alexander"},{"full_name":"Kokorin, Ilya","first_name":"Ilya","last_name":"Kokorin"}],"department":[{"_id":"DaAl"},{"_id":"GradSch"}],"publisher":"Association for Computing Machinery","publication_status":"published","title":"Unexpected scaling in path copying trees","status":"public","_id":"12736","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","acknowledgement":"This work was supported by: the Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Program grant: RGPIN-2019-04227, and the Canada Foundation for Innovation John R. Evans Leaders Fund (CFI-JELF) with equal support from the Ontario Research Fund CFI Leaders Opportunity Fund: 38512.","abstract":[{"lang":"eng","text":"Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (Universal Constructions or UCs) for building concurrent data structures. UCs (semi-)automatically convert a sequential data structure into a concurrent one. The simplest approach uses locks [3, 6] that protect a sequential data structure and allow only one process to access it at a time. However, the resulting data structure is blocking. Most work on UCs instead focuses on obtaining non-blocking progress guarantees such as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et al."}],"type":"conference_poster","language":[{"iso":"eng"}],"doi":"10.1145/3572848.3577512","date_published":"2023-02-25T00:00:00Z","conference":{"location":"Montreal, QB, Canada","start_date":"2023-02-25","end_date":"2023-03-01","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming"},"page":"438-440","quality_controlled":"1","citation":{"ieee":"V. Aksenov, T. A. Brown, A. Fedorov, and I. Kokorin, Unexpected scaling in path copying trees. Association for Computing Machinery, 2023, pp. 438–440.","apa":"Aksenov, V., Brown, T. A., Fedorov, A., & Kokorin, I. (2023). Unexpected scaling in path copying trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 438–440). Montreal, QB, Canada: Association for Computing Machinery. https://doi.org/10.1145/3572848.3577512","ista":"Aksenov V, Brown TA, Fedorov A, Kokorin I. 2023. Unexpected scaling in path copying trees, Association for Computing Machinery,p.","ama":"Aksenov V, Brown TA, Fedorov A, Kokorin I. Unexpected Scaling in Path Copying Trees. Association for Computing Machinery; 2023:438-440. doi:10.1145/3572848.3577512","chicago":"Aksenov, Vitaly, Trevor A Brown, Alexander Fedorov, and Ilya Kokorin. Unexpected Scaling in Path Copying Trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577512.","short":"V. Aksenov, T.A. Brown, A. Fedorov, I. Kokorin, Unexpected Scaling in Path Copying Trees, Association for Computing Machinery, 2023.","mla":"Aksenov, Vitaly, et al. “Unexpected Scaling in Path Copying Trees.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2023, pp. 438–40, doi:10.1145/3572848.3577512."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3572848.3577512"}],"publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","article_processing_charge":"No","publication_identifier":{"isbn":["9798400700156"]},"month":"02","day":"25"},{"scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"40th International Symposium on Theoretical Aspects of Computer Science","citation":{"chicago":"Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.” In 40th International Symposium on Theoretical Aspects of Computer Science, Vol. 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.STACS.2023.36.","mla":"Henzinger, Monika H., et al. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.” 40th International Symposium on Theoretical Aspects of Computer Science, vol. 254, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.STACS.2023.36.","short":"M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 40th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ista":"Henzinger MH, Neumann S, Räcke H, Schmid S. 2023. Dynamic maintenance of monotone dynamic programs and applications. 40th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 254, 36.","ieee":"M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance of monotone dynamic programs and applications,” in 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.","apa":"Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2023). Dynamic maintenance of monotone dynamic programs and applications. In 40th International Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2023.36","ama":"Henzinger MH, Neumann S, Räcke H, Schmid S. Dynamic maintenance of monotone dynamic programs and applications. In: 40th International Symposium on Theoretical Aspects of Computer Science. Vol 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.STACS.2023.36"},"date_published":"2023-03-01T00:00:00Z","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"Dynamic programming (DP) is one of the fundamental paradigms in algorithm design. However,\r\nmany DP algorithms have to fill in large DP tables, represented by two-dimensional arrays, which causes at least quadratic running times and space usages. This has led to the development of improved algorithms for special cases when the DPs satisfy additional properties like, e.g., the Monge property or total monotonicity.\r\nIn this paper, we consider a new condition which assumes (among some other technical assumptions) that the rows of the DP table are monotone. Under this assumption, we introduce\r\na novel data structure for computing (1 + ϵ)-approximate DP solutions in near-linear time and\r\nspace in the static setting, and with polylogarithmic update times when the DP entries change\r\ndynamically. To the best of our knowledge, our new condition is incomparable to previous conditions and is the first which allows to derive dynamic algorithms based on existing DPs. Instead of using two-dimensional arrays to store the DP tables, we store the rows of the DP tables using monotone piecewise constant functions. This allows us to store length-n DP table rows with entries in [0, W] using only polylog(n, W) bits, and to perform operations, such as (min, +)-convolution or rounding, on these functions in polylogarithmic time.\r\nWe further present several applications of our data structure. For bicriteria versions of k-balanced graph partitioning and simultaneous source location, we obtain the first dynamic algorithms with subpolynomial update times, as well as the first static algorithms using only near-linear time and space. Additionally, we obtain the currently fastest algorithm for fully dynamic knapsack."}],"_id":"12760","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["000"],"title":"Dynamic maintenance of monotone dynamic programs and applications","intvolume":" 254","file":[{"relation":"main_file","file_id":"12769","date_updated":"2023-03-27T06:37:22Z","date_created":"2023-03-27T06:37:22Z","checksum":"22141ab8bc55188e2dfff665e5daecbd","success":1,"file_name":"2023_LIPICS_HenzingerM.pdf","access_level":"open_access","file_size":872706,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","month":"03","publication_identifier":{"isbn":["9783959772662"],"issn":["1868-8969"]},"external_id":{"arxiv":["2301.01744"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","conference":{"location":"Hamburg, Germany","start_date":"2023-03-07","end_date":"2023-03-09","name":"STACS: Symposium on Theoretical Aspects of Computer Science"},"doi":"10.4230/LIPIcs.STACS.2023.36","language":[{"iso":"eng"}],"article_number":"36","file_date_updated":"2023-03-27T06:37:22Z","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nStefan Neumann: This research is supported by the the ERC Advanced Grant REBOUND (834862) and the EC H2020 RIA project SoBigData++ (871042).\r\nStefan Schmid: Research supported by Austrian Science Fund (FWF) project I 5025-N (DELTA), 2020-2024.","year":"2023","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"MoHe"}],"author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Neumann, Stefan","last_name":"Neumann","first_name":"Stefan"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"date_updated":"2023-03-27T06:46:27Z","date_created":"2023-03-26T22:01:07Z","volume":254},{"publication_identifier":{"issn":["2663-337X"]},"month":"03","oa":1,"project":[{"name":"Circuits of Visual Attention","call_identifier":"H2020","_id":"2634E9D2-B435-11E9-9278-68D0E5697425","grant_number":"756502"}],"doi":"10.15479/at:ista:12716","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Jösch","first_name":"Maximilian A","orcid":"0000-0002-3937-1330","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","full_name":"Jösch, Maximilian A"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"CampIT"}],"degree_awarded":"PhD","ec_funded":1,"file_date_updated":"2023-03-08T15:08:46Z","year":"2023","department":[{"_id":"GradSch"},{"_id":"MaJö"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","author":[{"full_name":"Burnett, Laura","last_name":"Burnett","first_name":"Laura","orcid":"0000-0002-8937-410X","id":"3B717F68-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2023-03-08T15:19:45Z","date_updated":"2023-04-05T10:59:04Z","article_processing_charge":"No","has_accepted_license":"1","day":"10","citation":{"ama":"Burnett L. To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism. 2023. doi:10.15479/at:ista:12716","ista":"Burnett L. 2023. To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism. Institute of Science and Technology Austria.","ieee":"L. Burnett, “To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism,” Institute of Science and Technology Austria, 2023.","apa":"Burnett, L. (2023). To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12716","mla":"Burnett, Laura. To Flee, or Not to Flee? Using Innate Defensive Behaviours to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in Mouse Models of Autism. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12716.","short":"L. Burnett, To Flee, or Not to Flee? Using Innate Defensive Behaviours to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in Mouse Models of Autism, Institute of Science and Technology Austria, 2023.","chicago":"Burnett, Laura. “To Flee, or Not to Flee? Using Innate Defensive Behaviours to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in Mouse Models of Autism.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12716."},"page":"178","date_published":"2023-03-10T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"The process of detecting and evaluating sensory information to guide behaviour is termed perceptual decision-making (PDM), and is critical for the ability of an organism to interact with its external world. Individuals with autism, a neurodevelopmental condition primarily characterised by social and communication difficulties, frequently exhibit altered sensory processing and PDM difficulties are widely reported. Recent technological advancements have pushed forward our understanding of the genetic changes accompanying this condition, however our understanding of how these mutations affect the function of specific neuronal circuits and bring about the corresponding behavioural changes remains limited. Here, we use an innate PDM task, the looming avoidance response (LAR) paradigm, to identify a convergent behavioural abnormality across three molecularly distinct genetic mouse models of autism (Cul3, Setd5 and Ptchd1). Although mutant mice can rapidly detect threatening visual stimuli, their responses are consistently delayed, requiring longer to initiate an appropriate response than their wild-type siblings. Mutant animals show abnormal adaptation in both their stimulus- evoked escape responses and exploratory dynamics following repeated stimulus presentations. Similarly delayed behavioural responses are observed in wild-type animals when faced with more ambiguous threats, suggesting the mutant phenotype could arise from a dysfunction in the flexible control of this PDM process.\r\nOur knowledge of the core neuronal circuitry mediating the LAR facilitated a detailed dissection of the neuronal mechanisms underlying the behavioural impairment. In vivo extracellular recording revealed that visual responses were unaffected within a key brain region for the rapid processing of visual threats, the superior colliculus (SC), indicating that the behavioural delay was unlikely to originate from sensory impairments. Delayed behavioural responses were recapitulated in the Setd5 model following optogenetic stimulation of the excitatory output neurons of the SC, which are known to mediate escape initiation through the activation of cells in the underlying dorsal periaqueductal grey (dPAG). In vitro patch-clamp recordings of dPAG cells uncovered a stark hypoexcitability phenotype in two out of the three genetic models investigated (Setd5 and Ptchd1), that in Setd5, is mediated by the misregulation of voltage-gated potassium channels. Overall, our results show that the ability to use visual information to drive efficient escape responses is impaired in three diverse genetic mouse models of autism and that, in one of the models studied, this behavioural delay likely originates from differences in the intrinsic excitability of a key subcortical node, the dPAG. Furthermore, this work showcases the use of an innate behavioural paradigm to mechanistically dissect PDM processes in autism."}],"_id":"12716","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","ddc":["599","573"],"title":"To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism","file":[{"relation":"source_file","file_id":"12717","date_updated":"2023-03-08T15:08:46Z","date_created":"2023-03-08T15:08:46Z","checksum":"6c6d9cc2c4cdacb74e6b1047a34d7332","file_name":"Burnett_Thesis_2023.docx","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":23029260,"creator":"lburnett"},{"file_name":"Burnett_Thesis_2023_pdfA.pdf","access_level":"open_access","content_type":"application/pdf","file_size":11959869,"creator":"lburnett","relation":"main_file","file_id":"12718","date_created":"2023-03-08T15:08:46Z","date_updated":"2023-03-08T15:08:46Z","checksum":"cebc77705288bf4382db9b3541483cd0","success":1}],"oa_version":"Published Version"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-30820-8_32","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Paris, France","start_date":"2023-04-22","end_date":"2023-04-27"},"project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_identifier":{"isbn":["9783031308192"],"eissn":["1611-3349"],"eisbn":["9783031308208"],"issn":["0302-9743"]},"month":"04","volume":13994,"date_created":"2023-04-20T08:22:53Z","date_updated":"2023-04-25T07:02:43Z","author":[{"last_name":"Chalupa","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"department":[{"_id":"ToHe"}],"publisher":"Springer Nature","publication_status":"published","acknowledgement":"This work was supported by the ERC-2020-AdG 10102009 grant.","year":"2023","ec_funded":1,"file_date_updated":"2023-04-25T06:58:36Z","date_published":"2023-04-20T00:00:00Z","page":"535-540","citation":{"ieee":"M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,” in Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 535–540.","apa":"Chalupa, M., & Henzinger, T. A. (2023). Bubaak: Runtime monitoring of program verifiers. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 535–540). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_32","ista":"Chalupa M, Henzinger TA. 2023. Bubaak: Runtime monitoring of program verifiers. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 535–540.","ama":"Chalupa M, Henzinger TA. Bubaak: Runtime monitoring of program verifiers. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13994. Springer Nature; 2023:535-540. doi:10.1007/978-3-031-30820-8_32","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” In Tools and Algorithms for the Construction and Analysis of Systems, 13994:535–40. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_32.","short":"M. Chalupa, T.A. Henzinger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 535–540.","mla":"Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 535–40, doi:10.1007/978-3-031-30820-8_32."},"publication":"Tools and Algorithms for the Construction and Analysis of Systems","article_processing_charge":"No","has_accepted_license":"1","day":"20","oa_version":"Published Version","file":[{"file_name":"2023_LNCS_Chalupa.pdf","access_level":"open_access","creator":"dernst","file_size":16096413,"content_type":"application/pdf","file_id":"12864","relation":"main_file","date_updated":"2023-04-25T06:58:36Z","date_created":"2023-04-25T06:58:36Z","success":1,"checksum":"120d2c2a38384058ad0630fdf8288312"}],"intvolume":" 13994","title":"Bubaak: Runtime monitoring of program verifiers","status":"public","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12854","abstract":[{"text":"The main idea behind BUBAAK is to run multiple program analyses in parallel and use runtime monitoring and enforcement to observe and control their progress in real time. The analyses send information about (un)explored states of the program and discovered invariants to a monitor. The monitor processes the received data and can force an analysis to stop the search of certain program parts (which have already been analyzed by other analyses), or to make it utilize a program invariant found by another analysis.\r\nAt SV-COMP 2023, the implementation of data exchange between the monitor and the analyses was not yet completed, which is why BUBAAK only ran several analyses in parallel, without any coordination. Still, BUBAAK won the meta-category FalsificationOverall and placed very well in several other (sub)-categories of the competition.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference"},{"_id":"12846","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors acknowledge Chris Wojtan for his continuous support to the present work through discussions and advice. The second author thanks Anna Sisak for a fruitful discussion on prequantum bundles. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).","publication_status":"submitted","status":"public","title":"Area formula for spherical polygons via prequantization","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"author":[{"full_name":"Chern, Albert","first_name":"Albert","last_name":"Chern"},{"full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige","last_name":"Ishida"}],"date_updated":"2023-04-25T06:51:21Z","date_created":"2023-04-18T19:16:06Z","oa_version":"Preprint","article_number":"2303.14555","type":"preprint","abstract":[{"text":"We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons.","lang":"eng"}],"publication":"arXiv","oa":1,"citation":{"chicago":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2303.14555.","mla":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, 2303.14555, doi:10.48550/arXiv.2303.14555.","short":"A. Chern, S. Ishida, ArXiv (n.d.).","ista":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv, 2303.14555.","apa":"Chern, A., & Ishida, S. (n.d.). Area formula for spherical polygons via prequantization. arXiv. https://doi.org/10.48550/arXiv.2303.14555","ieee":"A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,” arXiv. .","ama":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv. doi:10.48550/arXiv.2303.14555"},"main_file_link":[{"url":"https://arxiv.org/abs/2303.14555","open_access":"1"}],"external_id":{"arxiv":["2303.14555"]},"project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"date_published":"2023-03-25T00:00:00Z","doi":"10.48550/arXiv.2303.14555","language":[{"iso":"eng"}],"day":"25","month":"03","article_processing_charge":"No"}]