[{"title":"Optimal decay of the parabolic semigroup in stochastic homogenization  for correlated coefficient fields","oa":1,"publication_identifier":{"issn":["2194-0401"]},"type":"journal_article","doi":"10.1007/s40072-022-00254-w","publication":"Stochastics and Partial Differential Equations: Analysis and Computations","author":[{"id":"fea1b376-906f-11eb-847d-b2c0cf46455b","last_name":"Clozeau","full_name":"Clozeau, Nicolas","first_name":"Nicolas"}],"corr_author":"1","scopus_import":"1","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","date_created":"2021-10-23T10:50:22Z","month":"09","license":"https://creativecommons.org/licenses/by/4.0/","page":"1254–1378","publication_status":"published","language":[{"iso":"eng"}],"volume":11,"department":[{"_id":"JuFi"}],"has_accepted_license":"1","date_published":"2023-09-01T00:00:00Z","ddc":["510"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_type":"original","fulldoi":"https://doi.org/10.1007/s40072-022-00254-w","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We study the large scale behavior of elliptic systems with stationary random coefficient that have only slowly decaying correlations. To this aim we analyze the so-called corrector equation, a degenerate elliptic equation posed in the probability space. In this contribution, we use a parabolic approach and optimally quantify the time decay of the semigroup. For the theoretical point of view, we prove an optimal decay estimate of the gradient and flux of the corrector when spatially averaged over a scale R larger than 1. For the numerical point of view, our results provide convenient tools for the analysis of various numerical methods."}],"file_date_updated":"2023-08-14T11:51:04Z","date_updated":"2024-10-09T21:01:04Z","external_id":{"arxiv":["2102.07452"],"isi":["000799715600001"]},"intvolume":"        11","file":[{"file_size":1635193,"date_created":"2023-08-14T11:51:04Z","file_name":"2023_StochPartialDiffEquations_Clozeau.pdf","success":1,"file_id":"14052","creator":"dernst","content_type":"application/pdf","date_updated":"2023-08-14T11:51:04Z","access_level":"open_access","checksum":"f83dcaecdbd3ace862c4ed97a20e8501","relation":"main_file"}],"isi":1,"arxiv":1,"day":"01","publisher":"Springer Nature","year":"2023","citation":{"short":"N. Clozeau, Stochastics and Partial Differential Equations: Analysis and Computations 11 (2023) 1254–1378.","mla":"Clozeau, Nicolas. “Optimal Decay of the Parabolic Semigroup in Stochastic Homogenization  for Correlated Coefficient Fields.” <i>Stochastics and Partial Differential Equations: Analysis and Computations</i>, vol. 11, Springer Nature, 2023, pp. 1254–1378, doi:<a href=\"https://doi.org/10.1007/s40072-022-00254-w\">10.1007/s40072-022-00254-w</a>.","chicago":"Clozeau, Nicolas. “Optimal Decay of the Parabolic Semigroup in Stochastic Homogenization  for Correlated Coefficient Fields.” <i>Stochastics and Partial Differential Equations: Analysis and Computations</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s40072-022-00254-w\">https://doi.org/10.1007/s40072-022-00254-w</a>.","apa":"Clozeau, N. (2023). Optimal decay of the parabolic semigroup in stochastic homogenization  for correlated coefficient fields. <i>Stochastics and Partial Differential Equations: Analysis and Computations</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40072-022-00254-w\">https://doi.org/10.1007/s40072-022-00254-w</a>","ieee":"N. Clozeau, “Optimal decay of the parabolic semigroup in stochastic homogenization  for correlated coefficient fields,” <i>Stochastics and Partial Differential Equations: Analysis and Computations</i>, vol. 11. Springer Nature, pp. 1254–1378, 2023.","ista":"Clozeau N. 2023. Optimal decay of the parabolic semigroup in stochastic homogenization  for correlated coefficient fields. Stochastics and Partial Differential Equations: Analysis and Computations. 11, 1254–1378.","ama":"Clozeau N. Optimal decay of the parabolic semigroup in stochastic homogenization  for correlated coefficient fields. <i>Stochastics and Partial Differential Equations: Analysis and Computations</i>. 2023;11:1254–1378. doi:<a href=\"https://doi.org/10.1007/s40072-022-00254-w\">10.1007/s40072-022-00254-w</a>"},"acknowledgement":"I would like to thank my advisor Antoine Gloria for suggesting this problem to me, as well for many interesting discussions and suggestions.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","_id":"10173","status":"public","oa_version":"Published Version"},{"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"article_type":"original","fulldoi":"https://doi.org/10.1002/cpa.22028","date_published":"2023-05-01T00:00:00Z","has_accepted_license":"1","ddc":["510"],"abstract":[{"text":"We consider large non-Hermitian random matrices X with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having 2+ϵ derivatives. Previously this result was known only for a few special cases; either the test functions were required to be analytic [72], or the distribution of the matrix elements needed to be Gaussian [73], or at least match the Gaussian up to the first four moments [82, 56]. We find the exact dependence of the limiting variance on the fourth cumulant that was not known before. The proof relies on two novel ingredients: (i) a local law for a product of two resolvents of the Hermitisation of X with different spectral parameters and (ii) a coupling of several weakly dependent Dyson Brownian motions. These methods are also the key inputs for our analogous results on the linear eigenvalue statistics of real matrices X that are presented in the companion paper [32]. ","lang":"eng"}],"file_date_updated":"2023-10-04T09:21:48Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-03-31T16:00:54Z","intvolume":"        76","file":[{"relation":"main_file","access_level":"open_access","checksum":"8346bc2642afb4ccb7f38979f41df5d9","date_updated":"2023-10-04T09:21:48Z","content_type":"application/pdf","creator":"dernst","file_id":"14388","success":1,"file_name":"2023_CommPureMathematics_Cipolloni.pdf","file_size":803440,"date_created":"2023-10-04T09:21:48Z"}],"issue":"5","external_id":{"arxiv":["1912.04100"],"isi":["000724652500001"]},"publisher":"Wiley","acknowledgement":"L.E. would like to thank Nathanaël Berestycki and D.S.would like to thank Nina Holden for valuable discussions on the Gaussian freefield.G.C. and L.E. are partially supported by ERC Advanced Grant No. 338804.G.C. received funding from the European Union’s Horizon 2020 research and in-novation programme under the Marie Skłodowska-Curie Grant Agreement No.665385. D.S. is supported by Dr. Max Rössler, the Walter Haefner Foundation, and the ETH Zürich Foundation.","citation":{"chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Central Limit Theorem for Linear Eigenvalue Statistics of Non-Hermitian Random Matrices.” <i>Communications on Pure and Applied Mathematics</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/cpa.22028\">https://doi.org/10.1002/cpa.22028</a>.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Communications on Pure and Applied Mathematics 76 (2023) 946–1034.","mla":"Cipolloni, Giorgio, et al. “Central Limit Theorem for Linear Eigenvalue Statistics of Non-Hermitian Random Matrices.” <i>Communications on Pure and Applied Mathematics</i>, vol. 76, no. 5, Wiley, 2023, pp. 946–1034, doi:<a href=\"https://doi.org/10.1002/cpa.22028\">10.1002/cpa.22028</a>.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2023. Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. Communications on Pure and Applied Mathematics. 76(5), 946–1034.","ama":"Cipolloni G, Erdös L, Schröder DJ. Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. <i>Communications on Pure and Applied Mathematics</i>. 2023;76(5):946-1034. doi:<a href=\"https://doi.org/10.1002/cpa.22028\">10.1002/cpa.22028</a>","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2023). Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices. <i>Communications on Pure and Applied Mathematics</i>. Wiley. <a href=\"https://doi.org/10.1002/cpa.22028\">https://doi.org/10.1002/cpa.22028</a>","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices,” <i>Communications on Pure and Applied Mathematics</i>, vol. 76, no. 5. Wiley, pp. 946–1034, 2023."},"year":"2023","isi":1,"day":"01","arxiv":1,"oa_version":"Published Version","_id":"10405","status":"public","type":"journal_article","doi":"10.1002/cpa.22028","title":"Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices","oa":1,"publication_identifier":{"eissn":["1097-0312"],"issn":["0010-3640"]},"author":[{"full_name":"Cipolloni, Giorgio","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","first_name":"Giorgio"},{"full_name":"Erdös, László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László"},{"full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder","first_name":"Dominik J","orcid":"0000-0002-2904-1856"}],"publication":"Communications on Pure and Applied Mathematics","scopus_import":"1","corr_author":"1","quality_controlled":"1","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"article_processing_charge":"Yes (via OA deal)","date_created":"2021-12-05T23:01:41Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","month":"05","publication_status":"published","language":[{"iso":"eng"}],"volume":76,"department":[{"_id":"LaEr"}],"page":"946-1034"},{"article_processing_charge":"No","date_created":"2021-12-16T12:15:35Z","quality_controlled":"1","publication_status":"published","volume":33,"department":[{"_id":"JuFi"}],"language":[{"iso":"eng"}],"month":"06","oa":1,"title":"Global renormalised solutions and equilibration of reaction-diffusion systems with non-linear diffusion","publication_identifier":{"eissn":["1432-1467"],"issn":["0938-8974"]},"type":"journal_article","doi":"10.1007/s00332-023-09926-w","article_number":"66","scopus_import":"1","publication":"Journal of Nonlinear Science","author":[{"first_name":"Klemens","full_name":"Fellner, Klemens","last_name":"Fellner"},{"orcid":"0000-0002-0479-558X","first_name":"Julian L","full_name":"Fischer, Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"},{"id":"2CA2C08C-F248-11E8-B48F-1D18A9856A87","last_name":"Kniely","full_name":"Kniely, Michael","first_name":"Michael","orcid":"0000-0001-5645-4333"},{"first_name":"Bao Quoc","last_name":"Tang","full_name":"Tang, Bao Quoc"}],"external_id":{"arxiv":["2109.12019"],"isi":["001002343400002"]},"intvolume":"        33","file":[{"file_name":"2023_JourNonlinearScience_Fellner.pdf","date_created":"2023-06-19T07:33:53Z","file_size":742315,"success":1,"file_id":"13149","date_updated":"2023-06-19T07:33:53Z","content_type":"application/pdf","creator":"dernst","checksum":"f3f0f0886098e31c81116cff8183750b","access_level":"open_access","relation":"main_file"}],"status":"public","_id":"10550","oa_version":"Published Version","isi":1,"arxiv":1,"day":"07","publisher":"Springer Nature","acknowledgement":"We thank the referees for their valuable comments and suggestions. A major part of this work was carried out when B. Q. Tang visited the Institute of Science and Technology Austria (ISTA). The hospitality of ISTA is greatly acknowledged. This work was partially supported by NAWI Graz.\r\nOpen access funding provided by University of Graz.","year":"2023","citation":{"ieee":"K. Fellner, J. L. Fischer, M. Kniely, and B. Q. Tang, “Global renormalised solutions and equilibration of reaction-diffusion systems with non-linear diffusion,” <i>Journal of Nonlinear Science</i>, vol. 33. Springer Nature, 2023.","apa":"Fellner, K., Fischer, J. L., Kniely, M., &#38; Tang, B. Q. (2023). Global renormalised solutions and equilibration of reaction-diffusion systems with non-linear diffusion. <i>Journal of Nonlinear Science</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00332-023-09926-w\">https://doi.org/10.1007/s00332-023-09926-w</a>","ista":"Fellner K, Fischer JL, Kniely M, Tang BQ. 2023. Global renormalised solutions and equilibration of reaction-diffusion systems with non-linear diffusion. Journal of Nonlinear Science. 33, 66.","ama":"Fellner K, Fischer JL, Kniely M, Tang BQ. Global renormalised solutions and equilibration of reaction-diffusion systems with non-linear diffusion. <i>Journal of Nonlinear Science</i>. 2023;33. doi:<a href=\"https://doi.org/10.1007/s00332-023-09926-w\">10.1007/s00332-023-09926-w</a>","short":"K. Fellner, J.L. Fischer, M. Kniely, B.Q. Tang, Journal of Nonlinear Science 33 (2023).","mla":"Fellner, Klemens, et al. “Global Renormalised Solutions and Equilibration of Reaction-Diffusion Systems with Non-Linear Diffusion.” <i>Journal of Nonlinear Science</i>, vol. 33, 66, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1007/s00332-023-09926-w\">10.1007/s00332-023-09926-w</a>.","chicago":"Fellner, Klemens, Julian L Fischer, Michael Kniely, and Bao Quoc Tang. “Global Renormalised Solutions and Equilibration of Reaction-Diffusion Systems with Non-Linear Diffusion.” <i>Journal of Nonlinear Science</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00332-023-09926-w\">https://doi.org/10.1007/s00332-023-09926-w</a>."},"has_accepted_license":"1","date_published":"2023-06-07T00:00:00Z","ddc":["510"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_type":"original","fulldoi":"https://doi.org/10.1007/s00332-023-09926-w","date_updated":"2023-08-01T14:40:33Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file_date_updated":"2023-06-19T07:33:53Z","abstract":[{"text":"The global existence of renormalised solutions and convergence to equilibrium for reaction-diffusion systems with non-linear diffusion are investigated. The system is assumed to have quasi-positive non-linearities and to satisfy an entropy inequality. The difficulties in establishing global renormalised solutions caused by possibly degenerate diffusion are overcome by introducing a new class of weighted truncation functions. By means of the obtained global renormalised solutions, we study the large-time behaviour of complex balanced systems arising from chemical reaction network theory with non-linear diffusion. When the reaction network does not admit boundary equilibria, the complex balanced equilibrium is shown, by using the entropy method, to exponentially attract all renormalised solutions in the same compatibility class. This convergence extends even to a range of non-linear diffusion, where global existence is an open problem, yet we are able to show that solutions to approximate systems converge exponentially to equilibrium uniformly in the regularisation parameter.","lang":"eng"}]},{"article_number":"76","title":"The Dean-Kawasaki equation and the structure of density fluctuations in systems of diffusing particles","oa":1,"publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"pmid":1,"type":"journal_article","doi":"10.1007/s00205-023-01903-7","publication":"Archive for Rational Mechanics and Analysis","author":[{"first_name":"Federico","orcid":"0000-0002-6269-5149","full_name":"Cornalba, Federico","id":"2CEB641C-A400-11E9-A717-D712E6697425","last_name":"Cornalba"},{"first_name":"Julian L","orcid":"0000-0002-0479-558X","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Fischer, Julian L"}],"corr_author":"1","scopus_import":"1","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","date_created":"2021-12-16T12:16:03Z","month":"08","publication_status":"published","language":[{"iso":"eng"}],"volume":247,"department":[{"_id":"JuFi"}],"has_accepted_license":"1","date_published":"2023-08-04T00:00:00Z","ddc":["510"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"fulldoi":"https://doi.org/10.1007/s00205-023-01903-7","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"file_date_updated":"2024-01-30T12:09:34Z","abstract":[{"text":"The Dean–Kawasaki equation—a strongly singular SPDE—is a basic equation of fluctuating hydrodynamics; it has been proposed in the physics literature to describe the fluctuations of the density of N independent diffusing particles in the regime of large particle numbers N≫1. The singular nature of the Dean–Kawasaki equation presents a substantial challenge for both its analysis and its rigorous mathematical justification. Besides being non-renormalisable by the theory of regularity structures by Hairer et al., it has recently been shown to not even admit nontrivial martingale solutions. In the present work, we give a rigorous and fully quantitative justification of the Dean–Kawasaki equation by considering the natural regularisation provided by standard numerical discretisations: We show that structure-preserving discretisations of the Dean–Kawasaki equation may approximate the density fluctuations of N non-interacting diffusing particles to arbitrary order in N−1  (in suitable weak metrics). In other words, the Dean–Kawasaki equation may be interpreted as a “recipe” for accurate and efficient numerical simulations of the density fluctuations of independent diffusing particles.","lang":"eng"}],"date_updated":"2025-04-23T13:06:01Z","issue":"5","external_id":{"pmid":["37547904"],"arxiv":["2109.06500"],"isi":["001043086800001"]},"intvolume":"       247","file":[{"checksum":"4529eeff170b6745a461d397ee611b5a","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_updated":"2024-01-30T12:09:34Z","creator":"dernst","success":1,"file_id":"14904","file_name":"2023_ArchiveRationalMech_Cornalba.pdf","file_size":1851185,"date_created":"2024-01-30T12:09:34Z"}],"isi":1,"day":"04","arxiv":1,"publisher":"Springer Nature","year":"2023","citation":{"apa":"Cornalba, F., &#38; Fischer, J. L. (2023). The Dean-Kawasaki equation and the structure of density fluctuations in systems of diffusing particles. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-023-01903-7\">https://doi.org/10.1007/s00205-023-01903-7</a>","ieee":"F. Cornalba and J. L. Fischer, “The Dean-Kawasaki equation and the structure of density fluctuations in systems of diffusing particles,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 247, no. 5. Springer Nature, 2023.","ista":"Cornalba F, Fischer JL. 2023. The Dean-Kawasaki equation and the structure of density fluctuations in systems of diffusing particles. Archive for Rational Mechanics and Analysis. 247(5), 76.","ama":"Cornalba F, Fischer JL. The Dean-Kawasaki equation and the structure of density fluctuations in systems of diffusing particles. <i>Archive for Rational Mechanics and Analysis</i>. 2023;247(5). doi:<a href=\"https://doi.org/10.1007/s00205-023-01903-7\">10.1007/s00205-023-01903-7</a>","mla":"Cornalba, Federico, and Julian L. Fischer. “The Dean-Kawasaki Equation and the Structure of Density Fluctuations in Systems of Diffusing Particles.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 247, no. 5, 76, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1007/s00205-023-01903-7\">10.1007/s00205-023-01903-7</a>.","short":"F. Cornalba, J.L. Fischer, Archive for Rational Mechanics and Analysis 247 (2023).","chicago":"Cornalba, Federico, and Julian L Fischer. “The Dean-Kawasaki Equation and the Structure of Density Fluctuations in Systems of Diffusing Particles.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00205-023-01903-7\">https://doi.org/10.1007/s00205-023-01903-7</a>."},"acknowledgement":"We thank the anonymous referee for his/her careful reading of the manuscript and valuable suggestions. FC gratefully acknowledges funding from the Austrian Science Fund (FWF) through the project F65, and from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.\r\nOpen access funding provided by Austrian Science Fund (FWF).","_id":"10551","status":"public","oa_version":"Published Version"},{"quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}],"article_processing_charge":"No","date_created":"2022-02-20T23:01:32Z","month":"03","publication_status":"published","volume":13,"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"page":"231-264","type":"journal_article","doi":"10.1007/s13235-022-00425-3","oa":1,"title":"Where do mistakes lead? A survey of games with incompetent players","publication_identifier":{"issn":["2153-0785"],"eissn":["2153-0793"]},"author":[{"full_name":"Graham, Thomas","last_name":"Graham","first_name":"Thomas"},{"first_name":"Maria","last_name":"Kleshnina","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","full_name":"Kleshnina, Maria"},{"first_name":"Jerzy A.","last_name":"Filar","full_name":"Filar, Jerzy A."}],"publication":"Dynamic Games and Applications","scopus_import":"1","intvolume":"        13","file":[{"file_id":"10781","success":1,"file_name":"2022_DynamicGamesApplic_Graham.pdf","date_created":"2022-02-21T08:54:17Z","file_size":1890512,"relation":"main_file","checksum":"cd53b07e96f9030ddb348f305e5b58c7","access_level":"open_access","content_type":"application/pdf","date_updated":"2022-02-21T08:54:17Z","creator":"dernst"}],"external_id":{"isi":["000753777100001"]},"publisher":"Springer Nature","citation":{"ama":"Graham T, Kleshnina M, Filar JA. Where do mistakes lead? A survey of games with incompetent players. <i>Dynamic Games and Applications</i>. 2023;13:231-264. doi:<a href=\"https://doi.org/10.1007/s13235-022-00425-3\">10.1007/s13235-022-00425-3</a>","ista":"Graham T, Kleshnina M, Filar JA. 2023. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. 13, 231–264.","ieee":"T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” <i>Dynamic Games and Applications</i>, vol. 13. Springer Nature, pp. 231–264, 2023.","apa":"Graham, T., Kleshnina, M., &#38; Filar, J. A. (2023). Where do mistakes lead? A survey of games with incompetent players. <i>Dynamic Games and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s13235-022-00425-3\">https://doi.org/10.1007/s13235-022-00425-3</a>","chicago":"Graham, Thomas, Maria Kleshnina, and Jerzy A. Filar. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” <i>Dynamic Games and Applications</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s13235-022-00425-3\">https://doi.org/10.1007/s13235-022-00425-3</a>.","mla":"Graham, Thomas, et al. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” <i>Dynamic Games and Applications</i>, vol. 13, Springer Nature, 2023, pp. 231–64, doi:<a href=\"https://doi.org/10.1007/s13235-022-00425-3\">10.1007/s13235-022-00425-3</a>.","short":"T. Graham, M. Kleshnina, J.A. Filar, Dynamic Games and Applications 13 (2023) 231–264."},"year":"2023","acknowledgement":"The authors would like to acknowledge stimulating email discussions with Dr Wayne Lobb of W.A. Lobb LLC on the topic of evolutionary games. We also thank Dr Thomas Taimre for his input to the material in Sect. 3.\r\nThe authors would like to acknowledge partial support from the Australian Research Council under the Discovery grant DP180101602 and support by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411.","isi":1,"day":"01","oa_version":"Published Version","status":"public","_id":"10770","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"fulldoi":"https://doi.org/10.1007/s13235-022-00425-3","article_type":"original","has_accepted_license":"1","date_published":"2023-03-01T00:00:00Z","ddc":["000"],"ec_funded":1,"abstract":[{"text":"Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings.","lang":"eng"}],"file_date_updated":"2022-02-21T08:54:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-04-14T07:43:48Z"},{"doi":"10.1007/s11856-022-2448-6","type":"journal_article","publication_identifier":{"eissn":["1565-8511"]},"oa":1,"title":"Highly irregular separated nets","author":[{"first_name":"Michael","last_name":"Dymond","full_name":"Dymond, Michael"},{"full_name":"Kaluza, Vojtech","last_name":"Kaluza","id":"21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E","first_name":"Vojtech","orcid":"0000-0002-2512-8698"}],"publication":"Israel Journal of Mathematics","scopus_import":"1","quality_controlled":"1","date_created":"2021-07-14T07:01:28Z","article_processing_charge":"No","month":"03","volume":253,"department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"publication_status":"published","page":"501-554","article_type":"original","fulldoi":"https://doi.org/10.1007/s11856-022-2448-6","keyword":["Lipschitz","bilipschitz","bounded displacement","modulus of continuity","separated net","non-realisable density","Burago--Kleiner construction"],"ddc":["515","516"],"date_published":"2023-03-01T00:00:00Z","has_accepted_license":"1","abstract":[{"text":"In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice. We study weaker notions of equivalence of separated nets and demonstrate that such notions also give rise to distinct equivalence classes. Put differently, we find occurrences of particularly strong divergence of separated nets from the integer lattice. Our approach generalises that of Burago and Kleiner and McMullen which takes place largely in a continuous setting. Existence of irregular separated nets is verified via the existence of non-realisable density functions ρ:[0,1]d→(0,∞). In the present work we obtain stronger types of non-realisable densities.","lang":"eng"}],"file_date_updated":"2021-07-14T07:41:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-08-14T11:26:34Z","file":[{"date_created":"2021-07-14T07:41:50Z","file_size":900422,"file_name":"separated_nets.pdf","file_id":"9653","creator":"vkaluza","content_type":"application/pdf","date_updated":"2021-07-14T07:41:50Z","relation":"main_file","access_level":"open_access","checksum":"6fa0a3207dd1d6467c309fd1bcc867d1"}],"intvolume":"       253","external_id":{"arxiv":["1903.05923"],"isi":["000904950300003"]},"citation":{"ieee":"M. Dymond and V. Kaluza, “Highly irregular separated nets,” <i>Israel Journal of Mathematics</i>, vol. 253. Springer Nature, pp. 501–554, 2023.","apa":"Dymond, M., &#38; Kaluza, V. (2023). Highly irregular separated nets. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-022-2448-6\">https://doi.org/10.1007/s11856-022-2448-6</a>","ama":"Dymond M, Kaluza V. Highly irregular separated nets. <i>Israel Journal of Mathematics</i>. 2023;253:501-554. doi:<a href=\"https://doi.org/10.1007/s11856-022-2448-6\">10.1007/s11856-022-2448-6</a>","ista":"Dymond M, Kaluza V. 2023. Highly irregular separated nets. Israel Journal of Mathematics. 253, 501–554.","short":"M. Dymond, V. Kaluza, Israel Journal of Mathematics 253 (2023) 501–554.","mla":"Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.” <i>Israel Journal of Mathematics</i>, vol. 253, Springer Nature, 2023, pp. 501–54, doi:<a href=\"https://doi.org/10.1007/s11856-022-2448-6\">10.1007/s11856-022-2448-6</a>.","chicago":"Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11856-022-2448-6\">https://doi.org/10.1007/s11856-022-2448-6</a>."},"acknowledgement":"This work was done while both authors were employed at the University of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35.","year":"2023","publisher":"Springer Nature","arxiv":1,"day":"01","isi":1,"oa_version":"Submitted Version","_id":"9652","status":"public"},{"file_date_updated":"2024-01-24T11:19:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-02T06:42:45Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"fulldoi":"https://doi.org/10.5194/egusphere-egu23-6157","has_accepted_license":"1","date_published":"2023-04-13T00:00:00Z","ddc":["550"],"publisher":"European Geosciences Union","citation":{"short":"A. Polesello, C.J. Muller, C. Pasquero, A.N. Meroni, in:, EGU General Assembly 2023, European Geosciences Union, 2023.","mla":"Polesello, Andrea, et al. “Intensification Mechanisms of Tropical Cyclones.” <i>EGU General Assembly 2023</i>, EGU23-6157, European Geosciences Union, 2023, doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">10.5194/egusphere-egu23-6157</a>.","chicago":"Polesello, Andrea, Caroline J Muller, Claudia Pasquero, and Agostino N. Meroni. “Intensification Mechanisms of Tropical Cyclones.” In <i>EGU General Assembly 2023</i>. European Geosciences Union, 2023. <a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">https://doi.org/10.5194/egusphere-egu23-6157</a>.","apa":"Polesello, A., Muller, C. J., Pasquero, C., &#38; Meroni, A. N. (2023). Intensification mechanisms of tropical cyclones. In <i>EGU General Assembly 2023</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">https://doi.org/10.5194/egusphere-egu23-6157</a>","ieee":"A. Polesello, C. J. Muller, C. Pasquero, and A. N. Meroni, “Intensification mechanisms of tropical cyclones,” in <i>EGU General Assembly 2023</i>, Vienna, Austria &#38; Virtual, 2023.","ista":"Polesello A, Muller CJ, Pasquero C, Meroni AN. 2023. Intensification mechanisms of tropical cyclones. EGU General Assembly 2023. EGU General Assembly, EGU23-6157.","ama":"Polesello A, Muller CJ, Pasquero C, Meroni AN. Intensification mechanisms of tropical cyclones. In: <i>EGU General Assembly 2023</i>. European Geosciences Union; 2023. doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">10.5194/egusphere-egu23-6157</a>"},"year":"2023","day":"13","oa_version":"Published Version","_id":"14863","status":"public","file":[{"file_size":296769,"date_created":"2024-01-24T11:19:54Z","file_name":"2023_EGU_Polesello.pdf","success":1,"file_id":"14883","creator":"dernst","date_updated":"2024-01-24T11:19:54Z","content_type":"application/pdf","access_level":"open_access","checksum":"8cb88c1bc80ccee328478a62064d98f7","relation":"main_file"}],"author":[{"full_name":"Polesello, Andrea","last_name":"Polesello","id":"74c777f4-32da-11ee-b498-874db0835561","first_name":"Andrea"},{"last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","first_name":"Caroline J","orcid":"0000-0001-5836-5350"},{"first_name":"Claudia","last_name":"Pasquero","full_name":"Pasquero, Claudia"},{"first_name":"Agostino N.","last_name":"Meroni","full_name":"Meroni, Agostino N."}],"publication":"EGU General Assembly 2023","conference":{"location":"Vienna, Austria & Virtual","name":"EGU General Assembly","end_date":"2023-04-28","start_date":"2023-04-23"},"corr_author":"1","article_number":"EGU23-6157","type":"conference_abstract","doi":"10.5194/egusphere-egu23-6157","oa":1,"title":"Intensification mechanisms of tropical cyclones","month":"04","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"CaMu"},{"_id":"GradSch"}],"article_processing_charge":"No","date_created":"2024-01-22T12:08:12Z"},{"day":"16","das_tickbox":"1","isi":1,"acknowledgement":"N.C. is supported by the DFG Heisenberg Programme.\r\nWe are grateful to Tobias Dyckerhoff, Lukas Müller, Ingo Runkel, and Christopher Schommer-Pries for helpful discussions.","year":"2023","citation":{"chicago":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” <i>Quantum Topology</i>. EMS Press, 2023. <a href=\"https://doi.org/10.4171/qt/193\">https://doi.org/10.4171/qt/193</a>.","mla":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” <i>Quantum Topology</i>, vol. 14, no. 3, EMS Press, 2023, pp. 467–532, doi:<a href=\"https://doi.org/10.4171/qt/193\">10.4171/qt/193</a>.","short":"N. Carqueville, L. Szegedy, Quantum Topology 14 (2023) 467–532.","ama":"Carqueville N, Szegedy L. Fully extended r-spin TQFTs. <i>Quantum Topology</i>. 2023;14(3):467-532. doi:<a href=\"https://doi.org/10.4171/qt/193\">10.4171/qt/193</a>","ista":"Carqueville N, Szegedy L. 2023. Fully extended r-spin TQFTs. Quantum Topology. 14(3), 467–532.","ieee":"N. Carqueville and L. Szegedy, “Fully extended r-spin TQFTs,” <i>Quantum Topology</i>, vol. 14, no. 3. EMS Press, pp. 467–532, 2023.","apa":"Carqueville, N., &#38; Szegedy, L. (2023). Fully extended r-spin TQFTs. <i>Quantum Topology</i>. EMS Press. <a href=\"https://doi.org/10.4171/qt/193\">https://doi.org/10.4171/qt/193</a>"},"publisher":"EMS Press","status":"public","_id":"14756","oa_version":"Published Version","external_id":{"isi":["001104620800003"]},"issue":"3","file":[{"checksum":"b0590aff6e7ec89cc149ba94d459d3a3","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_updated":"2024-01-09T09:25:34Z","creator":"dernst","success":1,"file_id":"14764","file_name":"2023_QuantumTopol_Carqueville.pdf","file_size":707344,"date_created":"2024-01-09T09:25:34Z"}],"intvolume":"        14","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We prove the r-spin cobordism hypothesis in the setting of (weak) 2-categories for every positive integer r: the 2-groupoid of 2-dimensional fully extended r-spin TQFTs with given target is equivalent to the homotopy fixed points of an induced Spin 2r -action. In particular, such TQFTs are classified by fully dualisable objects together with a trivialisation of the rth power of their Serre automorphisms. For r=1, we recover the oriented case (on which our proof builds), while ordinary spin structures correspond to r=2.\r\nTo construct examples, we explicitly describe Spin 2r​-homotopy fixed points in the equivariant completion of any symmetric monoidal 2-category. We also show that every object in a 2-category of Landau–Ginzburg models gives rise to fully extended spin TQFTs and that half of these do not factor through the oriented bordism 2-category."}],"file_date_updated":"2024-01-09T09:25:34Z","date_updated":"2026-07-06T11:52:15Z","ddc":["530"],"has_accepted_license":"1","date_published":"2023-10-16T00:00:00Z","article_type":"original","fulldoi":"https://doi.org/10.4171/qt/193","keyword":["Geometry and Topology","Mathematical Physics"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"month":"10","page":"467-532","department":[{"_id":"MiLe"}],"volume":14,"language":[{"iso":"eng"}],"publication_status":"published","quality_controlled":"1","date_created":"2024-01-08T13:14:48Z","article_processing_charge":"Yes","publication":"Quantum Topology","author":[{"last_name":"Carqueville","full_name":"Carqueville, Nils","first_name":"Nils"},{"orcid":"0000-0003-2834-5054","first_name":"Lorant","full_name":"Szegedy, Lorant","id":"7943226E-220E-11EA-94C7-D59F3DDC885E","last_name":"Szegedy"}],"corr_author":"1","scopus_import":"1","publication_identifier":{"issn":["1663-487X"]},"title":"Fully extended r-spin TQFTs","oa":1,"doi":"10.4171/qt/193","type":"journal_article"},{"fulldoi":"https://doi.org/10.1145/3591230","article_type":"original","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"has_accepted_license":"1","date_published":"2023-06-06T00:00:00Z","date_updated":"2026-07-06T12:12:08Z","abstract":[{"text":"Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads.\r\n\r\nThis paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives.","lang":"eng"}],"file_date_updated":"2023-07-03T13:09:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"5dba6e73f0ed79adbdae14d165bc2f68","access_level":"open_access","relation":"main_file","creator":"alisjak","date_updated":"2023-07-03T13:09:39Z","content_type":"application/pdf","success":1,"file_id":"13187","date_created":"2023-07-03T13:09:39Z","file_size":1266773,"file_name":"2023_ACMProgram.Lang._Koval.pdf"}],"intvolume":"         7","oa_version":"Published Version","_id":"13179","status":"public","citation":{"ama":"Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. <i>Proceedings of the ACM on Programming Languages</i>. 2023;7. doi:<a href=\"https://doi.org/10.1145/3591230\">10.1145/3591230</a>","ista":"Koval N, Khalanskiy D, Alistarh D-A. 2023. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 7, 116.","ieee":"N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework for fair and abortable synchronization,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 7. Association for Computing Machinery, 2023.","apa":"Koval, N., Khalanskiy, D., &#38; Alistarh, D.-A. (2023). CQS: A formally-verified framework for fair and abortable synchronization. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3591230\">https://doi.org/10.1145/3591230</a>","chicago":"Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3591230\">https://doi.org/10.1145/3591230</a>.","mla":"Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 7, 116, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3591230\">10.1145/3591230</a>.","short":"N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming Languages 7 (2023)."},"year":"2023","publisher":"Association for Computing Machinery","day":"06","das_tickbox":"1","doi":"10.1145/3591230","type":"journal_article","publication_identifier":{"eissn":["2475-1421"]},"oa":1,"title":"CQS: A formally-verified framework for fair and abortable synchronization","article_number":"116","scopus_import":"1","corr_author":"1","author":[{"first_name":"Nikita","full_name":"Koval, Nikita","last_name":"Koval","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dmitry","last_name":"Khalanskiy","full_name":"Khalanskiy, Dmitry"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"}],"publication":"Proceedings of the ACM on Programming Languages","date_created":"2023-07-02T22:00:43Z","article_processing_charge":"No","quality_controlled":"1","volume":7,"department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"06"},{"OA_place":"repository","date_published":"2023-01-12T00:00:00Z","OA_type":"green","fulldoi":"https://doi.org/10.1137/1.9781611977585.ch17","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orientation is Ω(log n) in the deterministic LOCAL model and O(log log n) in the deterministic SLOCAL model. Both of these results are known by prior work, but here we give new simple, self-contained proofs for them."}],"ec_funded":1,"date_updated":"2026-07-06T11:57:38Z","external_id":{"arxiv":["2108.02655"]},"arxiv":1,"das_tickbox":"1","day":"12","publisher":"Society for Industrial and Applied Mathematics","year":"2023","citation":{"ama":"Balliu A, Korhonen J, Kuhn F, et al. Sinkless Orientation Made Simple. In: <i>Symposium on Simplicity in Algorithms</i>. Society for Industrial and Applied Mathematics; 2023:175-191. doi:<a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">10.1137/1.9781611977585.ch17</a>","ista":"Balliu A, Korhonen J, Kuhn F, Lievonen H, Olivetti D, Pai S, Paz A, Rybicki J, Schmid S, Studený J, Suomela J, Uitto J. 2023.Sinkless Orientation Made Simple. In: Symposium on Simplicity in Algorithms. , 175–191.","ieee":"A. Balliu <i>et al.</i>, “Sinkless Orientation Made Simple,” in <i>Symposium on Simplicity in Algorithms</i>, Society for Industrial and Applied Mathematics, 2023, pp. 175–191.","apa":"Balliu, A., Korhonen, J., Kuhn, F., Lievonen, H., Olivetti, D., Pai, S., … Uitto, J. (2023). Sinkless Orientation Made Simple. In <i>Symposium on Simplicity in Algorithms</i> (pp. 175–191). Florence, Italy: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">https://doi.org/10.1137/1.9781611977585.ch17</a>","chicago":"Balliu, Alkida, Janne Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, et al. “Sinkless Orientation Made Simple.” In <i>Symposium on Simplicity in Algorithms</i>, 175–91. Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">https://doi.org/10.1137/1.9781611977585.ch17</a>.","mla":"Balliu, Alkida, et al. “Sinkless Orientation Made Simple.” <i>Symposium on Simplicity in Algorithms</i>, Society for Industrial and Applied Mathematics, 2023, pp. 175–91, doi:<a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">10.1137/1.9781611977585.ch17</a>.","short":"A. Balliu, J. Korhonen, F. Kuhn, H. Lievonen, D. Olivetti, S. Pai, A. Paz, J. Rybicki, S. Schmid, J. Studený, J. Suomela, J. Uitto, in:, Symposium on Simplicity in Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 175–191."},"acknowledgement":"We thank the anonymous reviewers for their helpful feedback on previous versions of this work. Parts ofthis work appeared in DISC 2021 as a brief announcement [ 21]. This work was supported in part by theEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovationprogramme (grant agreement No 805223 ScaleML), the Academy of Finland (grant agreement No 333837),the Austrian Science Fund (FWF) and netIDEE (grant agreement No P 33775-N), and the AustrianScience Fund (FWF) project DELTA (grant agreement No I 5025-N).","status":"public","_id":"19983","oa_version":"Preprint","oa":1,"title":"Sinkless Orientation Made Simple","publication_identifier":{"eisbn":["9781611977585"]},"type":"book_chapter","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2108.02655","open_access":"1"}],"doi":"10.1137/1.9781611977585.ch17","publication":"Symposium on Simplicity in Algorithms","author":[{"full_name":"Balliu, Alkida","last_name":"Balliu","first_name":"Alkida"},{"id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","full_name":"Korhonen, Janne","first_name":"Janne"},{"last_name":"Kuhn","full_name":"Kuhn, Fabian","first_name":"Fabian"},{"full_name":"Lievonen, Henrik","last_name":"Lievonen","first_name":"Henrik"},{"last_name":"Olivetti","full_name":"Olivetti, Dennis","first_name":"Dennis"},{"first_name":"Shreyas","full_name":"Pai, Shreyas","last_name":"Pai"},{"first_name":"Ami","last_name":"Paz","full_name":"Paz, Ami"},{"first_name":"Joel","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"last_name":"Studený","full_name":"Studený, Jan","first_name":"Jan"},{"last_name":"Suomela","full_name":"Suomela, Jukka","first_name":"Jukka"},{"full_name":"Uitto, Jara","last_name":"Uitto","first_name":"Jara"}],"conference":{"location":"Florence, Italy","end_date":"2023-01-25","name":"SOSA: Symposium on Simplicity in Algorithms","start_date":"2023-01-23"},"project":[{"grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"quality_controlled":"1","article_processing_charge":"No","date_created":"2025-07-10T13:11:47Z","month":"01","page":"175-191","publication_status":"published","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}]},{"scopus_import":"1","author":[{"first_name":"Savita","last_name":"Mathur","full_name":"Mathur, Savita"},{"full_name":"Claytor, Zachary R.","last_name":"Claytor","first_name":"Zachary R."},{"first_name":"Ângela R. G.","full_name":"Santos, Ângela R. G.","last_name":"Santos"},{"first_name":"Rafael A.","last_name":"García","full_name":"García, Rafael A."},{"last_name":"Amard","full_name":"Amard, Louis","first_name":"Louis"},{"last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","orcid":"0000-0003-0142-4000"},{"first_name":"Enrico","full_name":"Corsaro, Enrico","last_name":"Corsaro"},{"last_name":"Bonanno","full_name":"Bonanno, Alfio","first_name":"Alfio"},{"first_name":"Sylvain N.","full_name":"Breton, Sylvain N.","last_name":"Breton"},{"full_name":"Godoy-Rivera, Diego","last_name":"Godoy-Rivera","first_name":"Diego"},{"first_name":"Marc H.","full_name":"Pinsonneault, Marc H.","last_name":"Pinsonneault"},{"last_name":"van Saders","full_name":"van Saders, Jennifer","first_name":"Jennifer"}],"publication":"The Astrophysical Journal","doi":"10.3847/1538-4357/acd118","type":"journal_article","publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"oa":1,"title":"Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations","article_number":"131","department":[{"_id":"LiBu"}],"volume":952,"language":[{"iso":"eng"}],"publication_status":"published","month":"08","date_created":"2023-08-01T14:19:16Z","article_processing_charge":"Yes","quality_controlled":"1","date_updated":"2026-07-06T12:20:17Z","file_date_updated":"2023-08-02T07:42:26Z","abstract":[{"text":"The ages of solar-like stars have been at the center of many studies such as exoplanet characterization or Galactic-archeology. While ages are usually computed from stellar evolution models, relations linking ages to other stellar properties, such as rotation and magnetic activity, have been investigated. With the large catalog of 55,232 rotation periods, Prot, and photometric magnetic activity index, Sph from Kepler data, we have the opportunity to look for such magneto-gyro-chronology relations. Stellar ages are obtained with two stellar evolution codes that include treatment of angular momentum evolution, hence using Prot as input in addition to classical atmospheric parameters. We explore two different ways of predicting stellar ages on three subsamples with spectroscopic observations: solar analogs, late-F and G dwarfs, and K dwarfs. We first perform a Bayesian analysis to derive relations between Sph and ages between 1 and 5 Gyr, and other stellar properties. For late-F and G dwarfs, and K dwarfs, the multivariate regression favors the model with Prot and Sph with median differences of 0.1% and 0.2%, respectively. We also apply Machine Learning techniques with a Random Forest algorithm to predict ages up to 14 Gyr with the same set of input parameters. For late-F, G and K dwarfs together, predicted ages are on average within 5.3% of the model ages and improve to 3.1% when including Prot. These are very promising results for a quick age estimation for solar-like stars with photometric observations, especially with current and future space missions.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","fulldoi":"https://doi.org/10.3847/1538-4357/acd118","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["520"],"date_published":"2023-08-01T00:00:00Z","has_accepted_license":"1","oa_version":"Published Version","_id":"13443","status":"public","citation":{"ista":"Mathur S, Claytor ZR, Santos ÂRG, García RA, Amard L, Bugnet LA, Corsaro E, Bonanno A, Breton SN, Godoy-Rivera D, Pinsonneault MH, van Saders J. 2023. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. The Astrophysical Journal. 952(2), 131.","ama":"Mathur S, Claytor ZR, Santos ÂRG, et al. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. <i>The Astrophysical Journal</i>. 2023;952(2). doi:<a href=\"https://doi.org/10.3847/1538-4357/acd118\">10.3847/1538-4357/acd118</a>","apa":"Mathur, S., Claytor, Z. R., Santos, Â. R. G., García, R. A., Amard, L., Bugnet, L. A., … van Saders, J. (2023). Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/acd118\">https://doi.org/10.3847/1538-4357/acd118</a>","ieee":"S. Mathur <i>et al.</i>, “Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations,” <i>The Astrophysical Journal</i>, vol. 952, no. 2. IOP Publishing, 2023.","chicago":"Mathur, Savita, Zachary R. Claytor, Ângela R. G. Santos, Rafael A. García, Louis Amard, Lisa Annabelle Bugnet, Enrico Corsaro, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” <i>The Astrophysical Journal</i>. IOP Publishing, 2023. <a href=\"https://doi.org/10.3847/1538-4357/acd118\">https://doi.org/10.3847/1538-4357/acd118</a>.","mla":"Mathur, Savita, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” <i>The Astrophysical Journal</i>, vol. 952, no. 2, 131, IOP Publishing, 2023, doi:<a href=\"https://doi.org/10.3847/1538-4357/acd118\">10.3847/1538-4357/acd118</a>.","short":"S. Mathur, Z.R. Claytor, Â.R.G. Santos, R.A. García, L. Amard, L.A. Bugnet, E. Corsaro, A. Bonanno, S.N. Breton, D. Godoy-Rivera, M.H. Pinsonneault, J. van Saders, The Astrophysical Journal 952 (2023)."},"year":"2023","acknowledgement":"This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the NASA Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. We acknowledge that this research was supported in part by the National Science Foundation under grant No. NSF PHY-1748958. S.M. acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the Ramón y Cajal fellowship No. RYC-2015-17697, the grant No. PID2019-107061GB-C66, and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023 (CEX2019-000920-S). S.M. and D.G.R. acknowledge support from the Spanish Ministry of Science and Innovation (MICINN) with the grant No. PID2019-107187GB-I00. Z.R.C. acknowledges support from National Aeronautics and Space Administration via the TESS Guest Investigator Program (grant No. 80NSSC18K18584). The work presented here was partially supported by the NASA grant NNX17AF27G. A.R.G.S. acknowledges the support by FCT through national funds and by FEDER through COMPETE2020 by the following grants: UIDB/04434/2020 and UIDP/04434/2020. A.R.G.S. is supported by FCT through the work contract No. 2020.02480.CEECIND/CP1631/CT0001. R.A.G., L.A., and S.N.B. acknowledge the support from PLATO and GOLF CNES grants. S.N.B. acknowledges support from PLATO ASI-INAF agreement No. 2015-019-R.1-2018.","publisher":"IOP Publishing","das_tickbox":"1","day":"01","isi":1,"file":[{"file_id":"13448","success":1,"date_created":"2023-08-02T07:42:26Z","file_size":4192386,"file_name":"2023_AstrophysicalJour_Mathur.pdf","relation":"main_file","checksum":"f12452834d7ed6748dbf5ace18af4723","access_level":"open_access","creator":"dernst","date_updated":"2023-08-02T07:42:26Z","content_type":"application/pdf"}],"intvolume":"       952","external_id":{"isi":["001034185700001"]},"issue":"2"},{"month":"04","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"MaIb"}],"publication_status":"published","page":"82","related_material":{"record":[{"status":"public","id":"12237","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10806","status":"public"},{"id":"10123","relation":"part_of_dissertation","status":"public"},{"id":"9118","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10042"}]},"project":[{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"degree_awarded":"PhD","date_created":"2023-05-02T07:58:57Z","article_processing_charge":"No","author":[{"first_name":"Mariano","orcid":"0000-0003-4566-5877","full_name":"Calcabrini, Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","last_name":"Calcabrini"}],"corr_author":"1","doi":"10.15479/at:ista:12885","type":"dissertation","publication_identifier":{"isbn":["978-3-99078-028-2"],"issn":["2663-337X"]},"title":"Nanoparticle-based semiconductor solids: From synthesis to consolidation","oa":1,"year":"2023","citation":{"short":"M. Calcabrini, Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation, Institute of Science and Technology Austria, 2023.","mla":"Calcabrini, Mariano. <i>Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:12885\">10.15479/at:ista:12885</a>.","chicago":"Calcabrini, Mariano. “Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:12885\">https://doi.org/10.15479/at:ista:12885</a>.","ieee":"M. Calcabrini, “Nanoparticle-based semiconductor solids: From synthesis to consolidation,” Institute of Science and Technology Austria, 2023.","apa":"Calcabrini, M. (2023). <i>Nanoparticle-based semiconductor solids: From synthesis to consolidation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12885\">https://doi.org/10.15479/at:ista:12885</a>","ista":"Calcabrini M. 2023. Nanoparticle-based semiconductor solids: From synthesis to consolidation. Institute of Science and Technology Austria.","ama":"Calcabrini M. Nanoparticle-based semiconductor solids: From synthesis to consolidation. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:12885\">10.15479/at:ista:12885</a>"},"publisher":"Institute of Science and Technology Austria","day":"28","supervisor":[{"orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","_id":"12885","status":"public","file":[{"relation":"source_file","access_level":"closed","checksum":"9347b0e09425f56fdcede5d3528404dc","creator":"mcalcabr","date_updated":"2023-05-02T07:43:18Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"12887","file_size":99627036,"date_created":"2023-05-02T07:43:18Z","file_name":"Thesis_Calcabrini.docx"},{"date_created":"2023-05-02T07:42:45Z","file_size":8742220,"file_name":"Thesis_Calcabrini_pdfa.pdf","success":1,"file_id":"12888","creator":"mcalcabr","content_type":"application/pdf","date_updated":"2023-05-02T07:42:45Z","access_level":"open_access","checksum":"2d188b76621086cd384f0b9264b0a576","relation":"main_file"}],"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"abstract":[{"lang":"eng","text":"High-performance semiconductors rely upon precise control of heat and charge transport. This can be achieved by precisely engineering defects in polycrystalline solids. There are multiple approaches to preparing such polycrystalline semiconductors, and the transformation of solution-processed colloidal nanoparticles is appealing because colloidal nanoparticles combine low cost with structural and compositional tunability along with rich surface chemistry. However, the multiple processes from nanoparticle synthesis to the final bulk nanocomposites are very complex. They involve nanoparticle purification, post-synthetic modifications, and finally consolidation (thermal treatments and densification). All these properties dictate the final material’s composition and microstructure, ultimately affecting its functional properties. This thesis explores the synthesis, surface chemistry and consolidation of colloidal semiconductor nanoparticles into dense solids. In particular, the transformations that take place during these processes, and their effect on the material’s transport properties are evaluated. "}],"file_date_updated":"2023-05-02T07:43:18Z","ec_funded":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"date_updated":"2026-07-06T12:16:05Z","OA_place":"publisher","fulldoi":"https://doi.org/10.15479/at:ista:12885","ddc":["546","541"],"date_published":"2023-04-28T00:00:00Z","has_accepted_license":"1"},{"publication":"Cell Reports","author":[{"orcid":"0000-0003-2623-5249","first_name":"Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425","last_name":"Lombardi","full_name":"Lombardi, Fabrizio"},{"first_name":"Hans J.","last_name":"Herrmann","full_name":"Herrmann, Hans J."},{"first_name":"Liborio","last_name":"Parrino","full_name":"Parrino, Liborio"},{"full_name":"Plenz, Dietmar","last_name":"Plenz","first_name":"Dietmar"},{"first_name":"Silvia","full_name":"Scarpetta, Silvia","last_name":"Scarpetta"},{"first_name":"Anna Elisabetta","full_name":"Vaudano, Anna Elisabetta","last_name":"Vaudano"},{"first_name":"Lucilla","last_name":"De Arcangelis","full_name":"De Arcangelis, Lucilla"},{"first_name":"Oren","full_name":"Shriki, Oren","last_name":"Shriki"}],"corr_author":"1","scopus_import":"1","article_number":"113162","oa":1,"title":"Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state","publication_identifier":{"eissn":["2211-1247"]},"pmid":1,"type":"journal_article","doi":"10.1016/j.celrep.2023.113162","month":"10","publication_status":"published","volume":42,"department":[{"_id":"GaTk"}],"language":[{"iso":"eng"}],"project":[{"grant_number":"M03318","_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67","name":"Functional Advantages of Critical Brain Dynamics"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"related_material":{"record":[{"id":"10821","relation":"earlier_version","status":"public"}]},"quality_controlled":"1","article_processing_charge":"Yes","date_created":"2023-10-08T22:01:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Alpha oscillations are a distinctive feature of the awake resting state of the human brain. However, their functional role in resting-state neuronal dynamics remains poorly understood. Here we show that, during resting wakefulness, alpha oscillations drive an alternation of attenuation and amplification bouts in neural activity. Our analysis indicates that inhibition is activated in pulses that last for a single alpha cycle and gradually suppress neural activity, while excitation is successively enhanced over a few alpha cycles to amplify neural activity. Furthermore, we show that long-term alpha amplitude fluctuations—the “waxing and waning” phenomenon—are an attenuation-amplification mechanism described by a power-law decay of the activity rate in the “waning” phase. Importantly, we do not observe such dynamics during non-rapid eye movement (NREM) sleep with marginal alpha oscillations. The results suggest that alpha oscillations modulate neural activity not only through pulses of inhibition (pulsed inhibition hypothesis) but also by timely enhancement of excitation (or disinhibition).","lang":"eng"}],"ec_funded":1,"file_date_updated":"2024-01-30T14:07:08Z","date_updated":"2026-07-06T12:48:55Z","date_published":"2023-10-31T00:00:00Z","has_accepted_license":"1","ddc":["570"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_type":"original","fulldoi":"https://doi.org/10.1016/j.celrep.2023.113162","isi":1,"day":"31","publisher":"Elsevier","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) (grant PT1013M03318 to F.L.). For the purpose of open access, the author has applied a CC BY public copyright license to any Author Accepted Manuscript version arising from this submission. The study was supported by the European Union Horizon 2020 Research and Innovation Program under the Marie Sklodowska-Curie action (grant agreement 754411 to F.L.) and in part by the NextGenerationEU through the grant TAlent in ReSearch@University of Padua – STARS@UNIPD (to F.L.) (project BRAINCIP [brain criticality and information processing]). L.d.A. acknowledges support from the Italian MIUR project PRIN2017WZFTZP and partial support from NEXTGENERATIONEU (NGEU) funded by the Ministry of University and Research (MUR), National Recovery and Resilience Plan (NRRP), and project MNESYS (PE0000006)—a multiscale integrated approach to the study of the nervous system in health and disease (DN. 1553 11.10.2022). O.S. acknowledges support from the Israel Science Foundation, grant 504/17. The work was supported in part by DIRP ZIAMH02797 (to D.P.).","citation":{"short":"F. Lombardi, H.J. Herrmann, L. Parrino, D. Plenz, S. Scarpetta, A.E. Vaudano, L. De Arcangelis, O. Shriki, Cell Reports 42 (2023).","mla":"Lombardi, Fabrizio, et al. “Beyond Pulsed Inhibition: Alpha Oscillations Modulate Attenuation and Amplification of Neural Activity in the Awake Resting State.” <i>Cell Reports</i>, vol. 42, no. 10, 113162, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">10.1016/j.celrep.2023.113162</a>.","chicago":"Lombardi, Fabrizio, Hans J. Herrmann, Liborio Parrino, Dietmar Plenz, Silvia Scarpetta, Anna Elisabetta Vaudano, Lucilla De Arcangelis, and Oren Shriki. “Beyond Pulsed Inhibition: Alpha Oscillations Modulate Attenuation and Amplification of Neural Activity in the Awake Resting State.” <i>Cell Reports</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">https://doi.org/10.1016/j.celrep.2023.113162</a>.","apa":"Lombardi, F., Herrmann, H. J., Parrino, L., Plenz, D., Scarpetta, S., Vaudano, A. E., … Shriki, O. (2023). Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">https://doi.org/10.1016/j.celrep.2023.113162</a>","ieee":"F. Lombardi <i>et al.</i>, “Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state,” <i>Cell Reports</i>, vol. 42, no. 10. Elsevier, 2023.","ista":"Lombardi F, Herrmann HJ, Parrino L, Plenz D, Scarpetta S, Vaudano AE, De Arcangelis L, Shriki O. 2023. Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. Cell Reports. 42(10), 113162.","ama":"Lombardi F, Herrmann HJ, Parrino L, et al. Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. <i>Cell Reports</i>. 2023;42(10). doi:<a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">10.1016/j.celrep.2023.113162</a>"},"year":"2023","_id":"14402","status":"public","oa_version":"Published Version","issue":"10","external_id":{"isi":["001086695500001"],"pmid":["37777965"]},"intvolume":"        42","file":[{"creator":"dernst","date_updated":"2024-01-30T14:07:08Z","content_type":"application/pdf","access_level":"open_access","checksum":"9c71eb2a03aa160415f01ad95f49ceb5","relation":"main_file","file_size":5599007,"date_created":"2024-01-30T14:07:08Z","file_name":"2023_CellReports_Lombardi.pdf","success":1,"file_id":"14914"}]},{"month":"11","day":"21","publisher":"Institute of Science and Technology Austria","citation":{"ista":"Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. 2023. Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>.","ama":"Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data. 2023. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>","ieee":"G. A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, and F. K. Schur, “Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data.” Institute of Science and Technology Austria, 2023.","apa":"Dimchev, G. A., Amiri, B., Fäßler, F., Falcke, M., &#38; Schur, F. K. (2023). Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">https://doi.org/10.15479/AT:ISTA:14502</a>","chicago":"Dimchev, Georgi A, Behnam Amiri, Florian Fäßler, Martin Falcke, and Florian KM Schur. “Computational Toolbox for Ultrastructural Quantitative Analysis of Filament Networks in Cryo-ET Data.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">https://doi.org/10.15479/AT:ISTA:14502</a>.","mla":"Dimchev, Georgi A., et al. <i>Computational Toolbox for Ultrastructural Quantitative Analysis of Filament Networks in Cryo-ET Data</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>.","short":"G.A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, F.K. Schur, (2023)."},"license":"https://choosealicense.com/licenses/agpl-3.0/","year":"2023","_id":"14502","status":"public","department":[{"_id":"FlSc"}],"project":[{"_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","name":"Structure and isoform diversity of the Arp2/3 complex","grant_number":"P33367"}],"file":[{"file_name":"Computational_Toolbox_v1.2.zip","file_size":347641117,"date_created":"2023-11-08T20:23:07Z","success":1,"file_id":"14503","content_type":"application/zip","date_updated":"2023-11-08T20:23:07Z","creator":"fschur","access_level":"open_access","checksum":"a8b9adeb53a4109dea4d5e39fa1acccf","relation":"main_file"},{"file_id":"14586","success":1,"file_name":"Readme.txt","file_size":1522,"date_created":"2023-11-21T08:20:23Z","relation":"main_file","access_level":"open_access","checksum":"14db2addbfca61a085ba301ed6f2900b","content_type":"text/plain","date_updated":"2023-11-21T08:20:23Z","creator":"dernst"}],"related_material":{"record":[{"status":"public","relation":"used_for_analysis_in","id":"10290"}]},"date_created":"2023-11-08T19:40:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2023-11-21T08:20:23Z","abstract":[{"text":"A precise quantitative description of the ultrastructural characteristics underlying biological mechanisms is often key to their understanding. This is particularly true for dynamic extra- and intracellular filamentous assemblies, playing a role in cell motility, cell integrity, cytokinesis, tissue formation and maintenance. For example, genetic manipulation or modulation of actin regulatory proteins frequently manifests in changes of the morphology, dynamics, and ultrastructural architecture of actin filament-rich cell peripheral structures, such as lamellipodia or filopodia. However, the observed ultrastructural effects often remain subtle and require sufficiently large datasets for appropriate quantitative analysis. The acquisition of such large datasets has been enabled by recent advances in high-throughput cryo-electron tomography (cryo-ET) methods. This also necessitates the development of complementary approaches to maximize the extraction of relevant biological information. We have developed a computational toolbox for the semi-automatic quantification of segmented and vectorized fila- mentous networks from pre-processed cryo-electron tomograms, facilitating the analysis and cross-comparison of multiple experimental conditions. GUI-based components simplify the processing of data and allow users to obtain a large number of ultrastructural parameters describing filamentous assemblies. We demonstrate the feasibility of this workflow by analyzing cryo-ET data of untreated and chemically perturbed branched actin filament networks and that of parallel actin filament arrays. In principle, the computational toolbox presented here is applicable for data analysis comprising any type of filaments in regular (i.e. parallel) or random arrangement. We show that it can ease the identification of key differences between experimental groups and facilitate the in-depth analysis of ultrastructural data in a time-efficient manner.","lang":"eng"}],"author":[{"id":"38C393BE-F248-11E8-B48F-1D18A9856A87","last_name":"Dimchev","full_name":"Dimchev, Georgi A","first_name":"Georgi A","orcid":"0000-0001-8370-6161"},{"last_name":"Amiri","full_name":"Amiri, Behnam","first_name":"Behnam"},{"last_name":"Fäßler","id":"404F5528-F248-11E8-B48F-1D18A9856A87","full_name":"Fäßler, Florian","orcid":"0000-0001-7149-769X","first_name":"Florian"},{"first_name":"Martin","last_name":"Falcke","full_name":"Falcke, Martin"},{"orcid":"0000-0003-4790-8078","first_name":"Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","full_name":"Schur, Florian KM"}],"date_updated":"2026-07-06T12:57:43Z","corr_author":"1","oa":1,"has_accepted_license":"1","title":"Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data","date_published":"2023-11-21T00:00:00Z","ddc":["570"],"type":"software","tmp":{"name":"GNU Affero General Public License v3.0","legal_code_url":"https://www.gnu.org/licenses/agpl-3.0.html","short":"GNU AGPLv3  "},"keyword":["cryo-electron tomography","actin cytoskeleton","toolbox"],"doi":"10.15479/AT:ISTA:14502","fulldoi":"https://doi.org/10.15479/AT:ISTA:14502"},{"type":"journal_article","doi":"10.1016/j.xplc.2023.100632","title":"Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen","oa":1,"pmid":1,"publication_identifier":{"eissn":["2590-3462"]},"article_number":"100632","scopus_import":"1","author":[{"last_name":"Xia","full_name":"Xia, Jing","first_name":"Jing"},{"last_name":"Kong","full_name":"Kong, Mengjuan","first_name":"Mengjuan"},{"first_name":"Zhisen","last_name":"Yang","full_name":"Yang, Zhisen"},{"first_name":"Lianghanxiao","full_name":"Sun, Lianghanxiao","last_name":"Sun"},{"last_name":"Peng","full_name":"Peng, Yakun","first_name":"Yakun"},{"first_name":"Yanbo","full_name":"Mao, Yanbo","last_name":"Mao"},{"first_name":"Hong","last_name":"Wei","full_name":"Wei, Hong"},{"last_name":"Ying","full_name":"Ying, Wei","first_name":"Wei"},{"full_name":"Gao, Yongxiao","last_name":"Gao","first_name":"Yongxiao"},{"orcid":"0000-0002-8302-7596","first_name":"Jiří","full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jianping","full_name":"Weng, Jianping","last_name":"Weng"},{"last_name":"Liu","full_name":"Liu, Xin","first_name":"Xin"},{"last_name":"Sun","full_name":"Sun, Linfeng","first_name":"Linfeng"},{"first_name":"Shutang","last_name":"Tan","full_name":"Tan, Shutang"}],"publication":"Plant Communications","article_processing_charge":"Yes","date_created":"2023-07-12T07:32:00Z","quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"volume":4,"department":[{"_id":"JiFr"}],"month":"11","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"article_type":"original","fulldoi":"https://doi.org/10.1016/j.xplc.2023.100632","has_accepted_license":"1","date_published":"2023-11-13T00:00:00Z","ddc":["580"],"date_updated":"2026-07-06T12:59:25Z","abstract":[{"lang":"eng","text":"The phytohormone auxin plays central roles in many growth and developmental processes in plants. Development of chemical tools targeting the auxin pathway is useful for both plant biology and agriculture. Here we reveal that naproxen, a synthetic compound with anti-inflammatory activity in humans, acts as an auxin transport inhibitor targeting PIN-FORMED (PIN) transporters in plants. Physiological experiments indicate that exogenous naproxen treatment affects pleiotropic auxin-regulated developmental processes. Additional cellular and biochemical evidence indicates that naproxen suppresses auxin transport, specifically PIN-mediated auxin efflux. Moreover, biochemical and structural analyses confirm that naproxen binds directly to PIN1 protein via the same binding cavity as the indole-3-acetic acid substrate. Thus, by combining cellular, biochemical, and structural approaches, this study clearly establishes that naproxen is a PIN inhibitor and elucidates the underlying mechanisms. Further use of this compound may advance our understanding of the molecular mechanisms of PIN-mediated auxin transport and expand our toolkit in auxin biology and agriculture."}],"file_date_updated":"2024-01-30T10:54:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         4","file":[{"date_created":"2024-01-30T10:54:40Z","file_size":1434862,"file_name":"2023_PlantCommunications_Xia.pdf","file_id":"14900","success":1,"creator":"dernst","date_updated":"2024-01-30T10:54:40Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"f8ef92af6096834f91ce38587fb1db9f"}],"issue":"6","external_id":{"isi":["001113003000001"],"pmid":["37254481"]},"oa_version":"Published Version","_id":"13209","status":"public","publisher":"Elsevier","year":"2023","acknowledgement":"This work was supported by the Strategic Priority Research Program of the Chinese Academy of Sciences (XDB37020103 to Linfeng Sun); research funds from the Center for Advanced Interdisciplinary Science\r\nand Biomedicine of IHM, Division of Life Sciences and Medicine, University of Science and Technology of China (QYPY20220012 to S.T.); start-up funding from the University of Science and Technology of China and the\r\nChinese Academy of Sciences (GG9100007007, KY9100000026,KY9100000051, and KJ2070000079 to S.T.); the National Natural Science Foundation of China (31900885 to X.L. and 31870732 to Linfeng Sun); the Natural Science Foundation of Anhui Province (2008085MC90 to X.L. and 2008085J15 to Linfeng Sun); the Fundamental Research Funds for the Central Universities (WK9100000021 to S.T. and WK9100000031 to Linfeng Sun); and the USTC Research Funds of the Double First-Class Initiative (YD9100002016 to S.T. and YD9100002004 to Linfeng Sun). Linfeng Sun is supported by an Outstanding Young Scholar Award from the Qiu Shi Science and Technologies Foundation and a Young Scholar Award from the Cyrus Tang Foundation.We thank Dr. Yang Zhao for sharing published materials (Center for Excellence in Molecular Plant Sciences, Chinese Academy of Sciences) and the Cryo-EM Center of the University of Science and Technology of China for the EM facility support. We are grateful to Y. Gao and all other staff members for their technical support on cryo-EM data collection. ","citation":{"ama":"Xia J, Kong M, Yang Z, et al. Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. <i>Plant Communications</i>. 2023;4(6). doi:<a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">10.1016/j.xplc.2023.100632</a>","ista":"Xia J, Kong M, Yang Z, Sun L, Peng Y, Mao Y, Wei H, Ying W, Gao Y, Friml J, Weng J, Liu X, Sun L, Tan S. 2023. Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. Plant Communications. 4(6), 100632.","apa":"Xia, J., Kong, M., Yang, Z., Sun, L., Peng, Y., Mao, Y., … Tan, S. (2023). Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. <i>Plant Communications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">https://doi.org/10.1016/j.xplc.2023.100632</a>","ieee":"J. Xia <i>et al.</i>, “Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen,” <i>Plant Communications</i>, vol. 4, no. 6. Elsevier, 2023.","chicago":"Xia, Jing, Mengjuan Kong, Zhisen Yang, Lianghanxiao Sun, Yakun Peng, Yanbo Mao, Hong Wei, et al. “Chemical Inhibition of Arabidopsis PIN-FORMED Auxin Transporters by the Anti-Inflammatory Drug Naproxen.” <i>Plant Communications</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">https://doi.org/10.1016/j.xplc.2023.100632</a>.","mla":"Xia, Jing, et al. “Chemical Inhibition of Arabidopsis PIN-FORMED Auxin Transporters by the Anti-Inflammatory Drug Naproxen.” <i>Plant Communications</i>, vol. 4, no. 6, 100632, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">10.1016/j.xplc.2023.100632</a>.","short":"J. Xia, M. Kong, Z. Yang, L. Sun, Y. Peng, Y. Mao, H. Wei, W. Ying, Y. Gao, J. Friml, J. Weng, X. Liu, L. Sun, S. Tan, Plant Communications 4 (2023)."},"isi":1,"day":"13","das_tickbox":"1"},{"scopus_import":"1","corr_author":"1","author":[{"last_name":"Huybrechts","full_name":"Huybrechts, D.","first_name":"D."},{"id":"2cf70c34-09c1-11ed-bd8d-c34fac206130","last_name":"Mauri","full_name":"Mauri, Mirko","first_name":"Mirko"}],"publication":"Mathematical Research Letters","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2108.01587","open_access":"1"}],"doi":"10.4310/mrl.2023.v30.n1.a6","type":"journal_article","publication_identifier":{"issn":["1073-2780"],"eissn":["1945-001X"]},"oa":1,"title":"On type II degenerations of hyperkähler manifolds","department":[{"_id":"TaHa"}],"language":[{"iso":"eng"}],"volume":30,"publication_status":"published","page":"125-141","month":"06","date_created":"2023-07-23T22:01:14Z","article_processing_charge":"No","quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"date_updated":"2026-07-06T13:37:53Z","ec_funded":1,"abstract":[{"lang":"eng","text":"We give a simple argument to prove Nagai’s conjecture for type II degenerations of compact hyperkähler manifolds and cohomology classes of middle degree. Under an additional assumption, the techniques yield the conjecture in arbitrary degree. This would complete the proof of Nagai’s conjecture in general, as it was proved already for type I degenerations by Kollár, Laza, Saccà, and Voisin [10] and independently by Soldatenkov [18], while it is immediate for type III degenerations. Our arguments are close in spirit to a recent paper by Harder [8] proving similar results for the restrictive class of good degenerations."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","fulldoi":"https://doi.org/10.4310/mrl.2023.v30.n1.a6","date_published":"2023-06-21T00:00:00Z","oa_version":"Preprint","_id":"13268","status":"public","citation":{"ista":"Huybrechts D, Mauri M. 2023. On type II degenerations of hyperkähler manifolds. Mathematical Research Letters. 30(1), 125–141.","ama":"Huybrechts D, Mauri M. On type II degenerations of hyperkähler manifolds. <i>Mathematical Research Letters</i>. 2023;30(1):125-141. doi:<a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">10.4310/mrl.2023.v30.n1.a6</a>","apa":"Huybrechts, D., &#38; Mauri, M. (2023). On type II degenerations of hyperkähler manifolds. <i>Mathematical Research Letters</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">https://doi.org/10.4310/mrl.2023.v30.n1.a6</a>","ieee":"D. Huybrechts and M. Mauri, “On type II degenerations of hyperkähler manifolds,” <i>Mathematical Research Letters</i>, vol. 30, no. 1. International Press of Boston, pp. 125–141, 2023.","chicago":"Huybrechts, D., and Mirko Mauri. “On Type II Degenerations of Hyperkähler Manifolds.” <i>Mathematical Research Letters</i>. International Press of Boston, 2023. <a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">https://doi.org/10.4310/mrl.2023.v30.n1.a6</a>.","short":"D. Huybrechts, M. Mauri, Mathematical Research Letters 30 (2023) 125–141.","mla":"Huybrechts, D., and Mirko Mauri. “On Type II Degenerations of Hyperkähler Manifolds.” <i>Mathematical Research Letters</i>, vol. 30, no. 1, International Press of Boston, 2023, pp. 125–41, doi:<a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">10.4310/mrl.2023.v30.n1.a6</a>."},"year":"2023","acknowledgement":"The first author is supported by the ERC Synergy Grant HyperK. The second author is supported by the Max Planck Institute for Mathematics and the Institute of Science and Technology Austria. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413.","publisher":"International Press of Boston","day":"21","arxiv":1,"das_tickbox":"1","isi":1,"intvolume":"        30","external_id":{"arxiv":["2108.01587"],"isi":["001027656000006"]},"issue":"1"},{"ddc":["000"],"date_published":"2023-08-15T00:00:00Z","has_accepted_license":"1","abstract":[{"text":"Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted party. DKG is an essential building block to many decentralized protocols such as randomness beacons, threshold signatures, Byzantine consensus, and multiparty computation. While significant progress has been made recently, existing asynchronous DKG constructions are inefficient when the reconstruction threshold is larger than one-third of the total nodes. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol among n = 3t + 1 nodes that can tolerate up to t malicious nodes and support any reconstruction threshold ℓ ≥ t. Our protocol has an expected O(κn3) communication cost, where κ is the security parameter, and only assumes the hardness of the Discrete Logarithm. The\r\ncore ingredient of our ADKG protocol is an asynchronous protocol to secret share a random polynomial of degree ℓ ≥ t, which has other applications, such as asynchronous proactive secret sharing and asynchronous multiparty computation. We implement our high-threshold ADKG protocol and evaluate it using a network of up to 128 geographically distributed nodes. Our evaluation shows that our high-threshold ADKG protocol reduces the running time by 90% and bandwidth usage by 80% over the state-of-the-art.","lang":"eng"}],"file_date_updated":"2023-11-28T09:14:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-07T06:02:32Z","file":[{"content_type":"application/pdf","date_updated":"2023-11-28T09:14:34Z","creator":"dernst","relation":"main_file","checksum":"1a730765930138e23c6efd2575872641","access_level":"open_access","file_name":"2023_USENIX_Das.pdf","file_size":704331,"date_created":"2023-11-28T09:14:34Z","file_id":"14621","success":1}],"intvolume":"         8","external_id":{"cryptoeprintid":["2022/1389"]},"citation":{"ama":"Das S, Xiang Z, Kokoris Kogias E, Ren L. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In: <i>32nd USENIX Security Symposium</i>. Vol 8. Usenix Association; 2023:5359-5376.","ista":"Das S, Xiang Z, Kokoris Kogias E, Ren L. 2023. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. 32nd USENIX Security Symposium. USENIX Security Symposium vol. 8, 5359–5376.","apa":"Das, S., Xiang, Z., Kokoris Kogias, E., &#38; Ren, L. (2023). Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In <i>32nd USENIX Security Symposium</i> (Vol. 8, pp. 5359–5376). Anaheim, CA, United States: Usenix Association.","ieee":"S. Das, Z. Xiang, E. Kokoris Kogias, and L. Ren, “Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling,” in <i>32nd USENIX Security Symposium</i>, Anaheim, CA, United States, 2023, vol. 8, pp. 5359–5376.","chicago":"Das, Sourav, Zhuolun Xiang, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial Sampling.” In <i>32nd USENIX Security Symposium</i>, 8:5359–76. Usenix Association, 2023.","mla":"Das, Sourav, et al. “Practical Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial Sampling.” <i>32nd USENIX Security Symposium</i>, vol. 8, Usenix Association, 2023, pp. 5359–76.","short":"S. Das, Z. Xiang, E. Kokoris Kogias, L. Ren, in:, 32nd USENIX Security Symposium, Usenix Association, 2023, pp. 5359–5376."},"acknowledgement":"The authors would like to thank Amit Agarwal, Andrew Miller, and Tom Yurek for the helpful discussions related to the paper. This work is funded in part by a VMware early career faculty grant, a Chainlink Labs Ph.D. fellowship, the National Science Foundation, and the Austrian Science Fund (FWF) F8512-N.","year":"2023","publisher":"Usenix Association","day":"15","das_tickbox":"1","oa_version":"Published Version","status":"public","_id":"14609","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/1389"}],"type":"conference","publication_identifier":{"isbn":["9781713879497"]},"title":"Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling","oa":1,"author":[{"last_name":"Das","full_name":"Das, Sourav","first_name":"Sourav"},{"full_name":"Xiang, Zhuolun","last_name":"Xiang","first_name":"Zhuolun"},{"last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios","orcid":"0000-0002-8827-3382","first_name":"Eleftherios"},{"full_name":"Ren, Ling","last_name":"Ren","first_name":"Ling"}],"cryptoeprintid":1,"publication":"32nd USENIX Security Symposium","scopus_import":"1","corr_author":"1","conference":{"location":"Anaheim, CA, United States","end_date":"2023-08-11","name":"USENIX Security Symposium","start_date":"2023-08-09"},"quality_controlled":"1","project":[{"name":"Security and Privacy by Design for Complex Systems","_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","grant_number":"F8512"}],"date_created":"2023-11-26T23:00:55Z","article_processing_charge":"No","month":"08","language":[{"iso":"eng"}],"volume":8,"department":[{"_id":"ElKo"}],"publication_status":"published","page":"5359-5376"},{"oa_version":"Published Version","status":"public","_id":"14718","publisher":"TU Wien Academic Press","year":"2023","acknowledgement":"This work was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413 and the\r\n“VAMOS” grant ERC-2020-AdG 101020093.","citation":{"ama":"Pastva S, Henzinger TA. Binary decision diagrams on modern hardware. In: <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>. TU Wien Academic Press; 2023:122-131. doi:<a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">10.34727/2023/isbn.978-3-85448-060-0_20</a>","ista":"Pastva S, Henzinger TA. 2023. Binary decision diagrams on modern hardware. Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 122–131.","ieee":"S. Pastva and T. A. Henzinger, “Binary decision diagrams on modern hardware,” in <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, Ames, IA, United States, 2023, pp. 122–131.","apa":"Pastva, S., &#38; Henzinger, T. A. (2023). Binary decision diagrams on modern hardware. In <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i> (pp. 122–131). Ames, IA, United States: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20</a>","chicago":"Pastva, Samuel, and Thomas A Henzinger. “Binary Decision Diagrams on Modern Hardware.” In <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, 122–31. TU Wien Academic Press, 2023. <a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20</a>.","short":"S. Pastva, T.A. Henzinger, in:, Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2023, pp. 122–131.","mla":"Pastva, Samuel, and Thomas A. Henzinger. “Binary Decision Diagrams on Modern Hardware.” <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, TU Wien Academic Press, 2023, pp. 122–31, doi:<a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">10.34727/2023/isbn.978-3-85448-060-0_20</a>."},"isi":1,"das_tickbox":"1","day":"01","file":[{"success":1,"file_id":"14721","file_name":"2023_FMCAD_Pastva.pdf","date_created":"2024-01-02T08:14:23Z","file_size":524321,"access_level":"open_access","checksum":"818d6e13dd508f3a04f0941081022e5d","relation":"main_file","date_updated":"2024-01-02T08:14:23Z","content_type":"application/pdf","creator":"dernst"}],"external_id":{"isi":["001504402400020"]},"date_updated":"2026-07-07T05:58:51Z","ec_funded":1,"abstract":[{"lang":"eng","text":"Binary decision diagrams (BDDs) are one of the fundamental data structures in formal methods and computer science in general. However, the performance of BDD-based algorithms greatly depends on memory latency due to the reliance on large hash tables and thus, by extension, on the speed of random memory access. This hinders the full utilisation of resources available on modern CPUs, since the absolute memory latency has not improved significantly for at least a decade. In this paper, we explore several implementation techniques that improve the performance of BDD manipulation either through enhanced memory locality or by partially eliminating random memory access. On a benchmark suite of 600+ BDDs derived from real-world applications, we demonstrate runtime that is comparable or better than parallelising the same operations on eight CPU cores. "}],"file_date_updated":"2024-01-02T08:14:23Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"fulldoi":"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20","date_published":"2023-10-01T00:00:00Z","has_accepted_license":"1","ddc":["000"],"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"page":"122-131","month":"10","article_processing_charge":"No","date_created":"2023-12-31T23:01:03Z","quality_controlled":"1","project":[{"grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"scopus_import":"1","conference":{"start_date":"2023-10-25","location":"Ames, IA, United States","name":"FMCAD: Formal Methods in Computer-Aided Design","end_date":"2023-10-27"},"corr_author":"1","author":[{"orcid":"0000-0003-1993-0331","first_name":"Samuel","last_name":"Pastva","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","full_name":"Pastva, Samuel"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A"}],"publication":"Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design","type":"conference","doi":"10.34727/2023/isbn.978-3-85448-060-0_20","title":"Binary decision diagrams on modern hardware","oa":1,"publication_identifier":{"isbn":["9783854480600"]}},{"scopus_import":"1","conference":{"start_date":"2023-02-07","name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14","location":"Washington, DC, United States"},"author":[{"first_name":"Guy","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","full_name":"Jecker, Ismael R","first_name":"Ismael R"},{"orcid":"0000-0002-4681-1699","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","doi":"10.1609/aaai.v37i5.25679","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1609/aaai.v37i5.25679"}],"type":"conference","publication_identifier":{"isbn":["9781577358800"]},"oa":1,"title":"Bidding graph games with partially-observable budgets","volume":37,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","page":"5464-5471","month":"06","date_created":"2023-08-27T22:01:18Z","article_processing_charge":"No","quality_controlled":"1","project":[{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"date_updated":"2026-07-07T06:24:15Z","ec_funded":1,"abstract":[{"lang":"eng","text":"Two-player zero-sum \"graph games\" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In \"bidding games\", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with \"mean-payoff\" objectives in combination with \"poorman\" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the \"value\" under pure strategies does not necessarily exist in such games."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1609/aaai.v37i5.25679","ddc":["000"],"date_published":"2023-06-27T00:00:00Z","oa_version":"Published Version","_id":"14243","status":"public","year":"2023","acknowledgement":"This research was supported in part by ISF grant no.1679/21, by the ERC CoG 863818 (ForM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","citation":{"chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:5464–71. AAAI Press, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>.","mla":"Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 5, AAAI Press, 2023, pp. 5464–71, doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI Press, 2023, pp. 5464–5471.","ama":"Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. AAAI Press; 2023:5464-5471. doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>","ista":"Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 5464–5471). Washington, DC, United States: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>"},"publisher":"AAAI Press","day":"27","das_tickbox":"1","arxiv":1,"intvolume":"        37","external_id":{"arxiv":["2211.13626"]},"issue":"5"},{"file_date_updated":"2024-05-22T07:34:00Z","abstract":[{"text":"Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and k-means++ can make Ω(ndk) time when clustering n points in a d-dimensional space (represented by an n×d matrix X) into k clusters. On massive datasets with moderate to large k, the multiplicative \r\nk factor can become very expensive. We introduce a simple randomized clustering algorithm that provably runs in expected time O(nnz(X)+nlogn) for arbitrary k. Here nnz(X) is the total number of non-zero entries in the input dataset X, which is upper bounded by nd and can be significantly smaller for sparse datasets. We prove that our algorithm achieves approximation ratio ˜O(k4) on any input dataset for the k-means objective, and our experiments show that the quality of the clusters found by our algorithm is usually much better than this worst-case bound. We use our algorithm for k-means clustering and for coreset construction; our experiments show that it gives a new tradeoff between running time and cluster quality compared to previous state-of-the-art methods for these tasks. Our theoretical analysis is based on novel results of independent interest. We show that the approximation ratio achieved after a random one-dimensional projection can be lifted to the original points and that k-means++ seeding can be implemented in expected time O(nlogn) in one dimension.","lang":"eng"}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["Advances in Neural Information Processing Systems"],"date_updated":"2026-07-07T06:37:54Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","date_published":"2023-12-15T00:00:00Z","ddc":["000"],"publisher":"Neural Information Processing Systems Foundation","citation":{"short":"M. Charikar, L. Hu, M. Henzinger, M. Vötsch, E. Waingarten, in:, 37th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","mla":"Charikar, Moses, et al. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” <i>37th Conference on Neural Information Processing Systems</i>, vol. 36, Neural Information Processing Systems Foundation, 2023.","chicago":"Charikar, Moses, Lunjia Hu, Monika Henzinger, Maximilian Vötsch, and Erik Waingarten. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” In <i>37th Conference on Neural Information Processing Systems</i>, Vol. 36. Neural Information Processing Systems Foundation, 2023.","apa":"Charikar, M., Hu, L., Henzinger, M., Vötsch, M., &#38; Waingarten, E. (2023). Simple, scalable and effective clustering via one-dimensional projections. In <i>37th Conference on Neural Information Processing Systems</i> (Vol. 36). New Orleans, LA, United States: Neural Information Processing Systems Foundation.","ieee":"M. Charikar, L. Hu, M. Henzinger, M. Vötsch, and E. Waingarten, “Simple, scalable and effective clustering via one-dimensional projections,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36.","ama":"Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. Simple, scalable and effective clustering via one-dimensional projections. In: <i>37th Conference on Neural Information Processing Systems</i>. Vol 36. Neural Information Processing Systems Foundation; 2023.","ista":"Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. 2023. Simple, scalable and effective clustering via one-dimensional projections. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 36."},"year":"2023","acknowledgement":"Moses Charikar was supported by a Simons Investigator award. Lunjia Hu was supported by Moses Charikar’s and Omer Reingold’s Simons Investigators awards, Omer Reingold’s NSF Award IIS-1908774, and the Simons Foundation Collaboration on the Theory of Algorithmic Fairness. Part of this work was done while Erik Waingarten was a postdoc at Stanford University, supported by an NSF postdoctoral fellowship and by Moses Charikar’s Simons\r\nInvestigator Award. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme\r\n(Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data\r\nStructures (MoDynStruct)” and the Austrian Science Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","arxiv":1,"day":"15","das_tickbox":"1","oa_version":"Published Version","status":"public","_id":"15364","intvolume":"        36","file":[{"content_type":"application/pdf","date_updated":"2024-05-22T07:34:00Z","creator":"dernst","relation":"main_file","checksum":"d169a147a2adf55878e0a99e36a9d468","access_level":"open_access","file_name":"2023_Neurips_Charikar.pdf","date_created":"2024-05-22T07:34:00Z","file_size":1445159,"file_id":"15416","success":1}],"external_id":{"arxiv":["2310.16752"]},"author":[{"last_name":"Charikar","full_name":"Charikar, Moses","first_name":"Moses"},{"first_name":"Lunjia","last_name":"Hu","full_name":"Hu, Lunjia"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"full_name":"Vötsch, Maximilian","last_name":"Vötsch","first_name":"Maximilian"},{"first_name":"Erik","last_name":"Waingarten","full_name":"Waingarten, Erik"}],"publication":"37th Conference on Neural Information Processing Systems","scopus_import":"1","conference":{"start_date":"2023-12-10","name":"NeurIPS: Neural Information Processing Systems","end_date":"2023-12-16","location":"New Orleans, LA, United States"},"type":"conference","oa":1,"title":"Simple, scalable and effective clustering via one-dimensional projections","publication_identifier":{"issn":["1049-5258"]},"month":"12","publication_status":"published","department":[{"_id":"MoHe"}],"volume":36,"language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564"},{"grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"article_processing_charge":"Yes","date_created":"2024-05-05T22:01:05Z"}]